(cache)Submission #68379514 - 第2回ドワンゴからの挑戦状予選

Contest Duration: 2016-01-23(Sat) 20:00 - 2016-01-23(Sat) 22:00 (local time) (120 minutes)

Submission #68379514

Source Code Expand

Copy

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
#include <stdio.h>
int N;
int K[114514];
int main(void) {
  int i;
  if (scanf("%d", &N) != 1) return 1;
  for (i = 1; i < N; i++) {
    if (scanf("%d", &K[i]) != 1) return 1;
  }
  printf("%d", K[1]);
  for (i = 2; i < N; i++) {
    printf(" %d", K[i - 1] <= K[i] ? K[i - 1] : K[i]);
  }
  printf(" %d\n", K[N - 1]);
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int N;
int K[114514];

int main(void) {
	int i;
	if (scanf("%d", &N) != 1) return 1;
	for (i = 1; i < N; i++) {
		if (scanf("%d", &K[i]) != 1) return 1;
	}
	printf("%d", K[1]);
	for (i = 2; i < N; i++) {
		printf(" %d", K[i - 1] <= K[i] ? K[i - 1] : K[i]);
	}
	printf(" %d\n", K[N - 1]);
	return 0;
}

Submission Info

Submission Time	2025-08-10 08:13:48
Task	B - 積み鉛筆
User	mikecat
Language	C (gcc 12.2.0)
Score	80
Code Size	339 Byte
Status	AC
Exec Time	16 ms
Memory	2116 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

80 / 80

Status

× 3

× 18

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	1 ms	1632 KiB
sample2.txt	AC	1 ms	1744 KiB
sample3.txt	AC	1 ms	1624 KiB
subtask0_0.txt	AC	14 ms	2056 KiB
subtask0_1.txt	AC	11 ms	1968 KiB
subtask0_10.txt	AC	10 ms	2076 KiB
subtask0_11.txt	AC	12 ms	1948 KiB
subtask0_12.txt	AC	15 ms	2056 KiB
subtask0_13.txt	AC	12 ms	2092 KiB
subtask0_14.txt	AC	12 ms	1976 KiB
subtask0_2.txt	AC	10 ms	2056 KiB
subtask0_3.txt	AC	13 ms	1916 KiB
subtask0_4.txt	AC	11 ms	1972 KiB
subtask0_5.txt	AC	11 ms	1896 KiB
subtask0_6.txt	AC	13 ms	1956 KiB
subtask0_7.txt	AC	10 ms	2012 KiB
subtask0_8.txt	AC	12 ms	2116 KiB
subtask0_9.txt	AC	16 ms	2088 KiB