oj.uz

Submission #235319

# Submission time Handle Problem Language Result Execution time Memory
235319 2020-05-27T19:45:46 Z PinkRabbit Bitaro’s Party (JOI18_bitaro) C++17
100 / 100
 753 ms 249368 KB 
#include <cstdio>
#include <algorithm>
#include <vector>

const int Inf = 0x3f3f3f3f;
const int MN = 100005, MS = 100005, B = 300 /* sqrt(MS) */, MB = B + 5;

int N, M, Q, banb[MN], ban[MN];
std::vector<int> G[MN];

int V[MN][MB], D[MN][MB], tV[MB], tD[MB], vis[MN];
void Prework() {
	int id = 0;
	for (int i = 1; i <= N; ++i) {
		V[i][1] = i, D[i][1] = 0;
		for (int j : G[i]) {
			++id;
			int x = 1, y = 1, z = 0;
			while (V[i][x] && V[j][y] && z < B) {
				int v, d;
				if (D[i][x] > D[j][y]) v = V[i][x], d = D[i][x], ++x;
				else v = V[j][y], d = D[j][y] + 1, ++y;
				if (vis[v] != id)
					vis[v] = id, ++z,
					tV[z] = v, tD[z] = d;
			}
			while (V[i][x] && z < B) {
				int v = V[i][x], d = D[i][x]; ++x;
				if (vis[v] != id)
					vis[v] = id, ++z,
					tV[z] = v, tD[z] = d;
			}
			while (V[j][y] && z < B) {
				int v = V[j][y], d = D[j][y] + 1; ++y;
				if (vis[v] != id)
					vis[v] = id, ++z,
					tV[z] = v, tD[z] = d;
			}
			for (int k = 1; k <= z; ++k)
				V[i][k] = tV[k], D[i][k] = tD[k];
		}
	}
}

int f[MN];

int main() {
	scanf("%d%d%d", &N, &M, &Q);
	for (int i = 1; i <= M; ++i) {
		int x, y;
		scanf("%d%d", &x, &y);
		G[y].push_back(x);
	}
	Prework();
	while (Q--) {
		int s, c;
		scanf("%d%d", &s, &c);
		for (int i = 1; i <= c; ++i) scanf("%d", &ban[i]), banb[ban[i]] = 1;
		if (c < B) {
			int ans = -1;
			for (int i = 1; V[s][i]; ++i)
				if (!banb[V[s][i]]) {
					ans = D[s][i];
					break;
				}
			printf("%d\n", ans);
		} else {
			f[s] = 0;
			for (int i = 1; i < s; ++i) f[i] = -Inf;
			for (int i = s; i > 1; --i)
				for (int j : G[i])
					f[j] = std::max(f[j], f[i] + 1);
			int ans = -1;
			for (int i = 1; i <= s; ++i)
				if (!banb[i]) ans = std::max(ans, f[i]);
			printf("%d\n", ans);
		}
		for (int i = 1; i <= c; ++i) banb[ban[i]] = 0;
	}
	return 0;
}

Compilation message

bitaro.cpp: In function 'int main()':
bitaro.cpp:48:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &N, &M, &Q);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:51:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &x, &y);
   ~~~~~^~~~~~~~~~~~~~~~
bitaro.cpp:57:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &s, &c);
   ~~~~~^~~~~~~~~~~~~~~~
bitaro.cpp:58:52: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   for (int i = 1; i <= c; ++i) scanf("%d", &ban[i]), banb[ban[i]] = 1;
                                ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2688 KB Output is correct
2 Correct 6 ms 2688 KB Output is correct
3 Correct 6 ms 2688 KB Output is correct
4 Correct 6 ms 2740 KB Output is correct
5 Correct 8 ms 5120 KB Output is correct
6 Correct 8 ms 5120 KB Output is correct
7 Correct 8 ms 5120 KB Output is correct
8 Correct 9 ms 5120 KB Output is correct
9 Correct 9 ms 5120 KB Output is correct
10 Correct 9 ms 5120 KB Output is correct
11 Correct 10 ms 5120 KB Output is correct
12 Correct 9 ms 5120 KB Output is correct
13 Correct 10 ms 5120 KB Output is correct
14 Correct 9 ms 5156 KB Output is correct
15 Correct 8 ms 5120 KB Output is correct
16 Correct 9 ms 5120 KB Output is correct
17 Correct 9 ms 5120 KB Output is correct
18 Correct 9 ms 5120 KB Output is correct
19 Correct 9 ms 5120 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2688 KB Output is correct
2 Correct 6 ms 2688 KB Output is correct
3 Correct 6 ms 2688 KB Output is correct
4 Correct 6 ms 2740 KB Output is correct
5 Correct 8 ms 5120 KB Output is correct
6 Correct 8 ms 5120 KB Output is correct
7 Correct 8 ms 5120 KB Output is correct
8 Correct 9 ms 5120 KB Output is correct
9 Correct 9 ms 5120 KB Output is correct
10 Correct 9 ms 5120 KB Output is correct
11 Correct 10 ms 5120 KB Output is correct
12 Correct 9 ms 5120 KB Output is correct
13 Correct 10 ms 5120 KB Output is correct
14 Correct 9 ms 5156 KB Output is correct
15 Correct 8 ms 5120 KB Output is correct
16 Correct 9 ms 5120 KB Output is correct
17 Correct 9 ms 5120 KB Output is correct
18 Correct 9 ms 5120 KB Output is correct
19 Correct 9 ms 5120 KB Output is correct
20 Correct 320 ms 7904 KB Output is correct
21 Correct 271 ms 7928 KB Output is correct
22 Correct 324 ms 7804 KB Output is correct
23 Correct 341 ms 7800 KB Output is correct
24 Correct 473 ms 248056 KB Output is correct
25 Correct 464 ms 248056 KB Output is correct
26 Correct 460 ms 247800 KB Output is correct
27 Correct 414 ms 248056 KB Output is correct
28 Correct 426 ms 248008 KB Output is correct
29 Correct 421 ms 248056 KB Output is correct
30 Correct 413 ms 247800 KB Output is correct
31 Correct 429 ms 248056 KB Output is correct
32 Correct 419 ms 247672 KB Output is correct
33 Correct 365 ms 247800 KB Output is correct
34 Correct 371 ms 248056 KB Output is correct
35 Correct 368 ms 247728 KB Output is correct
36 Correct 397 ms 248184 KB Output is correct
37 Correct 408 ms 247904 KB Output is correct
38 Correct 412 ms 247648 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2688 KB Output is correct
2 Correct 6 ms 2688 KB Output is correct
3 Correct 6 ms 2688 KB Output is correct
4 Correct 6 ms 2740 KB Output is correct
5 Correct 8 ms 5120 KB Output is correct
6 Correct 8 ms 5120 KB Output is correct
7 Correct 8 ms 5120 KB Output is correct
8 Correct 9 ms 5120 KB Output is correct
9 Correct 9 ms 5120 KB Output is correct
10 Correct 9 ms 5120 KB Output is correct
11 Correct 10 ms 5120 KB Output is correct
12 Correct 9 ms 5120 KB Output is correct
13 Correct 10 ms 5120 KB Output is correct
14 Correct 9 ms 5156 KB Output is correct
15 Correct 8 ms 5120 KB Output is correct
16 Correct 9 ms 5120 KB Output is correct
17 Correct 9 ms 5120 KB Output is correct
18 Correct 9 ms 5120 KB Output is correct
19 Correct 9 ms 5120 KB Output is correct
20 Correct 320 ms 7904 KB Output is correct
21 Correct 271 ms 7928 KB Output is correct
22 Correct 324 ms 7804 KB Output is correct
23 Correct 341 ms 7800 KB Output is correct
24 Correct 473 ms 248056 KB Output is correct
25 Correct 464 ms 248056 KB Output is correct
26 Correct 460 ms 247800 KB Output is correct
27 Correct 414 ms 248056 KB Output is correct
28 Correct 426 ms 248008 KB Output is correct
29 Correct 421 ms 248056 KB Output is correct
30 Correct 413 ms 247800 KB Output is correct
31 Correct 429 ms 248056 KB Output is correct
32 Correct 419 ms 247672 KB Output is correct
33 Correct 365 ms 247800 KB Output is correct
34 Correct 371 ms 248056 KB Output is correct
35 Correct 368 ms 247728 KB Output is correct
36 Correct 397 ms 248184 KB Output is correct
37 Correct 408 ms 247904 KB Output is correct
38 Correct 412 ms 247648 KB Output is correct
39 Correct 510 ms 248848 KB Output is correct
40 Correct 486 ms 248056 KB Output is correct
41 Correct 472 ms 248056 KB Output is correct
42 Correct 618 ms 248312 KB Output is correct
43 Correct 488 ms 248312 KB Output is correct
44 Correct 364 ms 9208 KB Output is correct
45 Correct 339 ms 8308 KB Output is correct
46 Correct 332 ms 8312 KB Output is correct
47 Correct 347 ms 7980 KB Output is correct
48 Correct 317 ms 7928 KB Output is correct
49 Correct 472 ms 248440 KB Output is correct
50 Correct 426 ms 247288 KB Output is correct
51 Correct 304 ms 9180 KB Output is correct
52 Correct 283 ms 8056 KB Output is correct
53 Correct 447 ms 248312 KB Output is correct
54 Correct 457 ms 248312 KB Output is correct
55 Correct 400 ms 247220 KB Output is correct
56 Correct 403 ms 247288 KB Output is correct
57 Correct 353 ms 8956 KB Output is correct
58 Correct 367 ms 9080 KB Output is correct
59 Correct 312 ms 8052 KB Output is correct
60 Correct 331 ms 8056 KB Output is correct
61 Correct 509 ms 247672 KB Output is correct
62 Correct 505 ms 247672 KB Output is correct
63 Correct 525 ms 247800 KB Output is correct
64 Correct 738 ms 247672 KB Output is correct
65 Correct 719 ms 247672 KB Output is correct
66 Correct 753 ms 247684 KB Output is correct
67 Correct 414 ms 247356 KB Output is correct
68 Correct 405 ms 247292 KB Output is correct
69 Correct 400 ms 247160 KB Output is correct
70 Correct 430 ms 247940 KB Output is correct
71 Correct 408 ms 247800 KB Output is correct
72 Correct 416 ms 247928 KB Output is correct
73 Correct 450 ms 247800 KB Output is correct
74 Correct 438 ms 247800 KB Output is correct
75 Correct 441 ms 247800 KB Output is correct
76 Correct 463 ms 249368 KB Output is correct
77 Correct 420 ms 248172 KB Output is correct
78 Correct 434 ms 248312 KB Output is correct
79 Correct 316 ms 9208 KB Output is correct
80 Correct 277 ms 8312 KB Output is correct
81 Correct 264 ms 7928 KB Output is correct
82 Correct 468 ms 249224 KB Output is correct
83 Correct 473 ms 249080 KB Output is correct
84 Correct 426 ms 247928 KB Output is correct
85 Correct 423 ms 247884 KB Output is correct
86 Correct 438 ms 248312 KB Output is correct
87 Correct 438 ms 248312 KB Output is correct
88 Correct 361 ms 9208 KB Output is correct
89 Correct 372 ms 9208 KB Output is correct
90 Correct 327 ms 8184 KB Output is correct
91 Correct 342 ms 8192 KB Output is correct
92 Correct 321 ms 7928 KB Output is correct
93 Correct 318 ms 7800 KB Output is correct
94 Correct 426 ms 249080 KB Output is correct
95 Correct 424 ms 248952 KB Output is correct
96 Correct 374 ms 247944 KB Output is correct
97 Correct 375 ms 247800 KB Output is correct
98 Correct 377 ms 248184 KB Output is correct
99 Correct 374 ms 248144 KB Output is correct
100 Correct 392 ms 9208 KB Output is correct
101 Correct 363 ms 9208 KB Output is correct
102 Correct 354 ms 8216 KB Output is correct
103 Correct 352 ms 8224 KB Output is correct
104 Correct 346 ms 7800 KB Output is correct
105 Correct 339 ms 7800 KB Output is correct
106 Correct 446 ms 249208 KB Output is correct
107 Correct 450 ms 248884 KB Output is correct
108 Correct 415 ms 247928 KB Output is correct
109 Correct 410 ms 247928 KB Output is correct
110 Correct 420 ms 248312 KB Output is correct
111 Correct 414 ms 248440 KB Output is correct
112 Correct 354 ms 9208 KB Output is correct
113 Correct 373 ms 9208 KB Output is correct
114 Correct 327 ms 8196 KB Output is correct
115 Correct 331 ms 8184 KB Output is correct
116 Correct 310 ms 7800 KB Output is correct
117 Correct 339 ms 8060 KB Output is correct
118 Correct 414 ms 247416 KB Output is correct
119 Correct 411 ms 247160 KB Output is correct
120 Correct 401 ms 247288 KB Output is correct
121 Correct 407 ms 247416 KB Output is correct
122 Correct 419 ms 247288 KB Output is correct
123 Correct 415 ms 247288 KB Output is correct
124 Correct 420 ms 247288 KB Output is correct
125 Correct 400 ms 247160 KB Output is correct
126 Correct 401 ms 247160 KB Output is correct