Submission #1212274


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(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 0
Code Size 623 Byte
Status RE
Exec Time 881 ms
Memory 61424 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 80
Status
AC × 2
RE × 1
AC × 11
RE × 7
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 RE 92 ms 20688 KB
sample2.txt AC 93 ms 19796 KB
sample3.txt AC 100 ms 17620 KB
subtask0_0.txt AC 824 ms 54552 KB
subtask0_1.txt AC 808 ms 55036 KB
subtask0_10.txt AC 711 ms 52496 KB
subtask0_11.txt AC 829 ms 60792 KB
subtask0_12.txt RE 439 ms 48156 KB
subtask0_13.txt AC 765 ms 51540 KB
subtask0_14.txt AC 796 ms 57172 KB
subtask0_2.txt RE 394 ms 48264 KB
subtask0_3.txt RE 437 ms 49784 KB
subtask0_4.txt AC 783 ms 59696 KB
subtask0_5.txt RE 408 ms 49492 KB
subtask0_6.txt RE 420 ms 49112 KB
subtask0_7.txt AC 759 ms 47960 KB
subtask0_8.txt RE 404 ms 48284 KB
subtask0_9.txt AC 881 ms 61424 KB