Submission #1212282
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]){ if(i!=N-2){ if(K[i+1]<=K[i]){ L[i+1]=K[i+1]; }else{ L[i+1]=K[i]; } } }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 | 80 |
Code Size | 652 Byte |
Status | AC |
Exec Time | 882 ms |
Memory | 61672 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 80 / 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 | 93 ms | 21844 KB |
sample2.txt | AC | 95 ms | 20948 KB |
sample3.txt | AC | 92 ms | 20564 KB |
subtask0_0.txt | AC | 776 ms | 54316 KB |
subtask0_1.txt | AC | 752 ms | 55884 KB |
subtask0_10.txt | AC | 804 ms | 50848 KB |
subtask0_11.txt | AC | 771 ms | 52612 KB |
subtask0_12.txt | AC | 778 ms | 49300 KB |
subtask0_13.txt | AC | 787 ms | 55960 KB |
subtask0_14.txt | AC | 782 ms | 56148 KB |
subtask0_2.txt | AC | 707 ms | 48480 KB |
subtask0_3.txt | AC | 737 ms | 50692 KB |
subtask0_4.txt | AC | 820 ms | 53540 KB |
subtask0_5.txt | AC | 723 ms | 48268 KB |
subtask0_6.txt | AC | 760 ms | 50404 KB |
subtask0_7.txt | AC | 695 ms | 61160 KB |
subtask0_8.txt | AC | 792 ms | 57192 KB |
subtask0_9.txt | AC | 882 ms | 61672 KB |