(cache)Submission #69613269 - AtCoder Beginner Contest 424

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

Submission #69613269

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, M, K;
int A[114514], B[114514];
int status[114514];
int main(void) {
  int i;
  int target;
  int first = 1;
  if (scanf("%d%d%d", &N, &M, &K) != 3) return 1;
  for (i = 0; i < K; i++) {
    if (scanf("%d%d", &A[i], &B[i]) != 2) return 1;
  }
  target = (2 << M) - 2;
  for (i = 0; i < K; i++) {
    status[A[i]] |= 1 << B[i];
    if (status[A[i]] == target) {
      printf(" %d" + first, A[i]);
      first = 0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>

int N, M, K;
int A[114514], B[114514];

int status[114514];

int main(void) {
	int i;
	int target;
	int first = 1;
	if (scanf("%d%d%d", &N, &M, &K) != 3) return 1;
	for (i = 0; i < K; i++) {
		if (scanf("%d%d", &A[i], &B[i]) != 2) return 1;
	}
	target = (2 << M) - 2;
	for (i = 0; i < K; i++) {
		status[A[i]] |= 1 << B[i];
		if (status[A[i]] == target) {
			printf(" %d" + first, A[i]);
			first = 0;
		}
	}
	if (!first) putchar('\n');
	return 0;
}

Submission Info

Submission Time	2025-09-26 00:35:59
Task	B - Perfect
User	mikecat
Language	C (gcc 12.2.0)
Score	200
Code Size	496 Byte
Status	AC
Exec Time	0 ms
Memory	1736 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

200 / 200

Status

× 2

× 21

Set Name	Test Cases
Sample	example_00.txt, example_01.txt
All	example_00.txt, example_01.txt, hand_00.txt, hand_01.txt, hand_02.txt, hand_03.txt, hand_04.txt, hand_05.txt, hand_06.txt, random_00.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_10.txt, random_11.txt

Case Name	Status	Memory
example_00.txt	AC	1620 KiB
example_01.txt	AC	1504 KiB
hand_00.txt	AC	1712 KiB
hand_01.txt	AC	1592 KiB
hand_02.txt	AC	1652 KiB
hand_03.txt	AC	1624 KiB
hand_04.txt	AC	1624 KiB
hand_05.txt	AC	1548 KiB
hand_06.txt	AC	1556 KiB
random_00.txt	AC	1628 KiB
random_01.txt	AC	1628 KiB
random_02.txt	AC	1700 KiB
random_03.txt	AC	1632 KiB
random_04.txt	AC	1620 KiB
random_05.txt	AC	1628 KiB
random_06.txt	AC	1720 KiB
random_07.txt	AC	1624 KiB
random_08.txt	AC	1736 KiB
random_09.txt	AC	1588 KiB
random_10.txt	AC	1696 KiB
random_11.txt	AC	1584 KiB