Submission #1212270
Source Code Expand
import java.util.Scanner; public class Main{ public static void main(String[] args) { // TODO 自動生成されたメソッド・スタブ Scanner scan = new Scanner(System.in); int N = scan.nextInt(); int[] K = new int[N-1]; int[] L = new int[N]; for(int i=0;i<N-1;i++){ K[i]=scan.nextInt(); } L[0]=K[0]; for(int i=0;i<N-1;i++){ if(L[i]==K[i]){ L[i+1]=1; }else{ L[i+1]=K[i]; } } for(int i=0;i<N;i++){ System.out.print(L[i]+" "); } System.out.println(""); } }
Submission Info
Submission Time | |
---|---|
Task | B - 積み鉛筆 |
User | inmir |
Language | Java8 (OpenJDK 1.8.0) |
Score | 0 |
Code Size | 555 Byte |
Status | WA |
Exec Time | 809 ms |
Memory | 63264 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 80 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt |
All | sample1.txt, sample2.txt, sample3.txt, subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample1.txt | AC | 94 ms | 22996 KB |
sample2.txt | AC | 92 ms | 18644 KB |
sample3.txt | AC | 91 ms | 20692 KB |
subtask0_0.txt | WA | 801 ms | 51864 KB |
subtask0_1.txt | AC | 780 ms | 57004 KB |
subtask0_10.txt | AC | 791 ms | 50696 KB |
subtask0_11.txt | WA | 768 ms | 52240 KB |
subtask0_12.txt | WA | 757 ms | 51984 KB |
subtask0_13.txt | AC | 724 ms | 53844 KB |
subtask0_14.txt | WA | 769 ms | 63056 KB |
subtask0_2.txt | WA | 726 ms | 50192 KB |
subtask0_3.txt | WA | 765 ms | 48460 KB |
subtask0_4.txt | AC | 729 ms | 54796 KB |
subtask0_5.txt | WA | 729 ms | 49232 KB |
subtask0_6.txt | WA | 776 ms | 50180 KB |
subtask0_7.txt | AC | 712 ms | 47220 KB |
subtask0_8.txt | WA | 749 ms | 52112 KB |
subtask0_9.txt | WA | 809 ms | 63264 KB |