Submission #2125348


Source Code Expand

#include <cstdio>
#pragma warning(disable : 4996)
int n, m, q, a[100009], b[100009], t[100009], x[100009], y[100009], p[100009], f[100009];
int root(int x) { return p[x] == x ? x : p[x] = root(p[x]); }
int main() {
	scanf("%d %d %d", &n, &m, &q);
	for (int i = 0; i < m; i++) scanf("%d %d", &a[i], &b[i]), a[i]--, b[i]--;
	for (int i = 0; i < q; i++) {
		scanf("%d %d", &t[i], &x[i]); x[i]--;
		if (t[i] == 1) scanf("%d", &y[i]), y[i]--;
		else f[x[i]] = 1;
	}
	for (int i = 0; i < n; i++) p[i] = i;
	for (int i = 0; i < m; i++) {
		if (!f[i]) p[root(a[i])] = root(b[i]);
	}
	for (int i = q - 1; i >= 0; i--) {
		if (t[i] == 0) p[root(a[x[i]])] = root(b[x[i]]);
		else x[i] = (root(x[i]) == root(y[i]));
	}
	for (int i = 0; i < q; i++) {
		if (t[i] == 1) printf(x[i] ? "YES\n" : "NO\n");
	}
	return 0;
}

Submission Info

Submission Time
Task D - Graph Destruction
User square1001
Language C++14 (GCC 5.4.1)
Score 100
Code Size 827 Byte
Status AC
Exec Time 48 ms
Memory 3072 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:6:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d", &n, &m, &q);
                               ^
./Main.cpp:7:74: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 0; i < m; i++) scanf("%d %d", &a[i], &b[i]), a[i]--, b[i]--;
                                                                          ^
./Main.cpp:9:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &t[i], &x[i]); x[i]--;
                               ^
./Main.cpp:10:44: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   if (t[i] == 1) scanf("%d", &y[i]), y[i]--;
                                            ^

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 37
Set Name Test Cases
All 1, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 2, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 3, 30, 31, 32, 33, 34, 35, 36, 4, 5, 50, 6, 7, 8, 9
Case Name Status Exec Time Memory
1 AC 1 ms 128 KB
10 AC 1 ms 256 KB
11 AC 4 ms 384 KB
12 AC 11 ms 896 KB
13 AC 20 ms 1536 KB
14 AC 30 ms 1920 KB
15 AC 39 ms 2560 KB
16 AC 48 ms 3072 KB
17 AC 13 ms 896 KB
18 AC 12 ms 896 KB
19 AC 16 ms 1152 KB
2 AC 1 ms 128 KB
20 AC 23 ms 1536 KB
21 AC 16 ms 1152 KB
22 AC 23 ms 1536 KB
23 AC 16 ms 1152 KB
24 AC 10 ms 768 KB
25 AC 12 ms 896 KB
26 AC 36 ms 2304 KB
27 AC 10 ms 768 KB
28 AC 11 ms 896 KB
29 AC 26 ms 1664 KB
3 AC 1 ms 128 KB
30 AC 19 ms 1280 KB
31 AC 33 ms 2048 KB
32 AC 26 ms 1664 KB
33 AC 29 ms 1792 KB
34 AC 36 ms 2304 KB
35 AC 31 ms 1920 KB
36 AC 14 ms 1024 KB
4 AC 1 ms 128 KB
5 AC 1 ms 128 KB
50 AC 33 ms 2048 KB
6 AC 1 ms 128 KB
7 AC 1 ms 128 KB
8 AC 1 ms 256 KB
9 AC 1 ms 256 KB