(cache)Submission #69889702 - UNIQUE VISION Programming Contest 2025 Autumn (AtCoder Beginner Contest 425)

Contest Duration: 2025-09-27(Sat) 21:00 - 2025-09-27(Sat) 22:40 (local time) (100 minutes) Back to Home

Submission #69889702

Source Code Expand

Copy

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
int N;
int A[114514];
char used[114514];
int main(void) {
  int i;
  int next = 1;
  if (scanf("%d", &N) != 1) return 1;
  for (i = 1; i <= N; i++) {
    if (scanf("%d", &A[i]) != 1) return 1;
  }
  for (i = 1; i <= N; i++) {
    if (A[i] > 0) {
      if (used[A[i]]) {
        puts("No");
        return 0;
      }
      used[A[i]] = 1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int N;
int A[114514];

char used[114514];

int main(void) {
	int i;
	int next = 1;
	if (scanf("%d", &N) != 1) return 1;
	for (i = 1; i <= N; i++) {
		if (scanf("%d", &A[i]) != 1) return 1;
	}
	for (i = 1; i <= N; i++) {
		if (A[i] > 0) {
			if (used[A[i]]) {
				puts("No");
				return 0;
			}
			used[A[i]] = 1;
		}
	}
	puts("Yes");
	for (i = 1; i <= N; i++) {
		if (A[i] > 0) {
			printf(" %d" + (i == 1), A[i]);
		} else {
			while (used[next]) next++;
			printf(" %d" + (i == 1), next);
			used[next] = 1;
		}
	}
	putchar('\n');
	return 0;
}

Submission Info

Submission Time	2025-10-05 07:19:11
Task	B - Find Permutation 2
User	mikecat
Language	C (gcc 12.2.0)
Score	200
Code Size	602 Byte
Status	AC
Exec Time	1 ms
Memory	1764 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

200 / 200

Status

× 3

× 32

Set Name	Test Cases
Sample	00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All	00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_Yes_00.txt, 01_Yes_01.txt, 01_Yes_02.txt, 01_Yes_03.txt, 01_Yes_04.txt, 01_Yes_05.txt, 01_Yes_06.txt, 01_Yes_07.txt, 01_Yes_08.txt, 01_Yes_09.txt, 01_Yes_10.txt, 01_Yes_11.txt, 01_Yes_12.txt, 01_Yes_13.txt, 01_Yes_14.txt, 01_Yes_15.txt, 01_Yes_16.txt, 01_Yes_17.txt, 01_Yes_18.txt, 01_Yes_19.txt, 01_Yes_20.txt, 02_No_00.txt, 02_No_01.txt, 02_No_02.txt, 02_No_03.txt, 02_No_04.txt, 02_No_05.txt, 02_No_06.txt, 02_No_07.txt

Case Name	Status	Exec Time	Memory
00_sample_00.txt	AC	0 ms	1620 KiB
00_sample_01.txt	AC	0 ms	1608 KiB
00_sample_02.txt	AC	0 ms	1760 KiB
01_Yes_00.txt	AC	0 ms	1596 KiB
01_Yes_01.txt	AC	0 ms	1608 KiB
01_Yes_02.txt	AC	0 ms	1636 KiB
01_Yes_03.txt	AC	0 ms	1604 KiB
01_Yes_04.txt	AC	0 ms	1736 KiB
01_Yes_05.txt	AC	0 ms	1760 KiB
01_Yes_06.txt	AC	0 ms	1620 KiB
01_Yes_07.txt	AC	0 ms	1656 KiB
01_Yes_08.txt	AC	0 ms	1764 KiB
01_Yes_09.txt	AC	0 ms	1636 KiB
01_Yes_10.txt	AC	0 ms	1616 KiB
01_Yes_11.txt	AC	0 ms	1600 KiB
01_Yes_12.txt	AC	0 ms	1640 KiB
01_Yes_13.txt	AC	0 ms	1588 KiB
01_Yes_14.txt	AC	0 ms	1664 KiB
01_Yes_15.txt	AC	0 ms	1644 KiB
01_Yes_16.txt	AC	0 ms	1748 KiB
01_Yes_17.txt	AC	0 ms	1620 KiB
01_Yes_18.txt	AC	0 ms	1748 KiB
01_Yes_19.txt	AC	0 ms	1728 KiB
01_Yes_20.txt	AC	0 ms	1664 KiB
02_No_00.txt	AC	0 ms	1556 KiB
02_No_01.txt	AC	0 ms	1548 KiB
02_No_02.txt	AC	0 ms	1624 KiB
02_No_03.txt	AC	0 ms	1632 KiB
02_No_04.txt	AC	0 ms	1600 KiB
02_No_05.txt	AC	0 ms	1604 KiB
02_No_06.txt	AC	0 ms	1612 KiB
02_No_07.txt	AC	1 ms	1608 KiB