Submission #69641052


Source Code Expand

Copy
#include <stdio.h>
#include <stdlib.h>
int ec[212345], *es[212345];
void ae(int f, int t) {
es[f] = realloc(es[f], sizeof(*es[f]) * (ec[f] + 1));
if (es[f] == NULL) exit(2);
es[f][ec[f]++] = t;
}
char visited[212345];
void mimorin(int node) {
int i;
if (visited[node]) return;
visited[node] = 1;
for (i = 0; i < ec[node]; i++) {
mimorin(es[node][i]);
}
}
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#include <stdio.h>
#include <stdlib.h>

int ec[212345], *es[212345];

void ae(int f, int t) {
	es[f] = realloc(es[f], sizeof(*es[f]) * (ec[f] + 1));
	if (es[f] == NULL) exit(2);
	es[f][ec[f]++] = t;
}

char visited[212345];

void mimorin(int node) {
	int i;
	if (visited[node]) return;
	visited[node] = 1;
	for (i = 0; i < ec[node]; i++) {
		mimorin(es[node][i]);
	}
}

int main(void) {
	int N;
	int i;
	int ans = 0;
	if (scanf("%d", &N) != 1) return 1;
	for (i = 1; i <= N; i++) {
		int A, B;
		if (scanf("%d%d", &A, &B) != 2) return 1;
		ae(A, i);
		ae(B, i);
	}
	mimorin(0);
	for (i = 1; i <= N; i++) {
		if (visited[i]) ans++;
	}
	printf("%d\n", ans);
	return 0;
}

Submission Info

Submission Time
Task C - New Skill Acquired
User mikecat
Language C (gcc 12.2.0)
Score 300
Code Size 709 Byte
Status AC
Exec Time 64 ms
Memory 19784 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 30
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All hand_01.txt, hand_02.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, random_12.txt, random_13.txt, random_14.txt, random_15.txt, random_16.txt, random_17.txt, random_18.txt, random_19.txt, random_20.txt, random_21.txt, random_22.txt, random_23.txt, random_24.txt, random_25.txt, random_26.txt, sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
hand_01.txt AC 0 ms 1744 KiB
hand_02.txt AC 0 ms 1612 KiB
random_01.txt AC 49 ms 9520 KiB
random_02.txt AC 2 ms 2196 KiB
random_03.txt AC 64 ms 13432 KiB
random_04.txt AC 45 ms 10216 KiB
random_05.txt AC 63 ms 13472 KiB
random_06.txt AC 45 ms 10440 KiB
random_07.txt AC 64 ms 13244 KiB
random_08.txt AC 17 ms 3360 KiB
random_09.txt AC 62 ms 19784 KiB
random_10.txt AC 63 ms 16352 KiB
random_11.txt AC 36 ms 19736 KiB
random_12.txt AC 61 ms 14092 KiB
random_13.txt AC 59 ms 11116 KiB
random_14.txt AC 57 ms 10588 KiB
random_15.txt AC 56 ms 10428 KiB
random_16.txt AC 20 ms 5304 KiB
random_17.txt AC 53 ms 10496 KiB
random_18.txt AC 5 ms 2688 KiB
random_19.txt AC 25 ms 6072 KiB
random_20.txt AC 39 ms 8432 KiB
random_21.txt AC 1 ms 1836 KiB
random_22.txt AC 11 ms 3608 KiB
random_23.txt AC 50 ms 10792 KiB
random_24.txt AC 14 ms 4540 KiB
random_25.txt AC 26 ms 6672 KiB
random_26.txt AC 2 ms 1700 KiB
sample_01.txt AC 0 ms 1716 KiB
sample_02.txt AC 0 ms 1648 KiB


2025-09-27 (Sat)
20:30:19 +09:00