oj.uz

Submission #556729

# Submission time Handle Problem Language Result Execution time Memory
556729 2022-05-03T18:59:28 Z lunchbox Bitaro’s Party (JOI18_bitaro) C++17
100 / 100
 691 ms 163524 KB 
/*
https://oj.uz/problem/view/JOI18_bitaro
Bitaro's Party
*/
#include <bits/stdc++.h>
using namespace std;

using LL = long long;
const int N = 100000, B = 200, Q = 100000, INF = 0x3f3f3f3f;

vector<int> gr[N];
pair<int, int> pp[N][B];

void join(pair<int, int> *aa, pair<int, int> *bb, pair<int, int> *cc) {
	static int used[N], _ = 1;

	int i = 0, j = 0;

	for (int k = 0; k < B; k++) {
		while (i < B && aa[i].second != -1 && used[aa[i].second] == _)
			i++;
		while (j < B && bb[j].second != -1 && used[bb[j].second] == _)
			j++;
		if (i == B)
			cc[k] = {bb[j].first + 1, bb[j].second}, j++;
		else if (j == B)
			cc[k] = aa[i++];
		else if (aa[i].first > bb[j].first + 1)
			cc[k] = aa[i++];
		else
			cc[k] = {bb[j].first + 1, bb[j].second}, j++;
		if (cc[k].second != -1)
			used[cc[k].second] = _;
	}
	_++;
}

void run() {
	int n, m, q;

	scanf("%d%d%d", &n, &m, &q);
	while (m--) {
		int i, j;

		scanf("%d%d", &i, &j), i--, j--;
		gr[j].push_back(i);
	}
	for (int i = 0; i < n; i++) {
		static pair<int, int> tmp[B];

		for (int j = 0; j < B; j++)
			pp[i][j] = { -INF, -1};
		pp[i][0] = {0, i};
		for (int j : gr[i]) {
			join(pp[i], pp[j], tmp);
			for (int k = 0; k < B; k++)
				pp[i][k] = tmp[k];
		}
	}
	for (int h = 1; h <= q; h++) {
		static int removed[N];
		int i, k, ans = -1;

		scanf("%d%d", &i, &k), i--;
		for (int _ = 0; _ < k; _++) {
			int j;

			scanf("%d", &j), j--;
			removed[j] = h;
		}
		if (k < B) {
			for (int _ = 0; _ < B; _++) {
				auto [d, j] = pp[i][_];

				if (j == -1)
					break;
				if (removed[j] != h) {
					ans = d;
					break;
				}
			}
		} else {
			static int dd[N];

			memset(dd, -0x3f, n * sizeof * dd);
			dd[i] = 0;
			for (int j = i; j >= 0; j--) {
				int d = dd[j];

				if (d == -INF)
					continue;
				if (removed[j] != h)
					ans = max(ans, d);
				for (int k : gr[j])
					dd[k] = max(dd[k], d + 1);
			}
		}
		printf("%d\n", ans);
	}
}

int main() {
	run();
	return 0;
}

Compilation message

bitaro.cpp: In function 'void run()':
bitaro.cpp:41:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |  scanf("%d%d%d", &n, &m, &q);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:45:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |   scanf("%d%d", &i, &j), i--, j--;
      |   ~~~~~^~~~~~~~~~~~~~~~
bitaro.cpp:64:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |   scanf("%d%d", &i, &k), i--;
      |   ~~~~~^~~~~~~~~~~~~~~~
bitaro.cpp:68:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |    scanf("%d", &j), j--;
      |    ~~~~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 5 ms 4180 KB Output is correct
6 Correct 5 ms 4180 KB Output is correct
7 Correct 5 ms 4180 KB Output is correct
8 Correct 7 ms 4256 KB Output is correct
9 Correct 5 ms 4180 KB Output is correct
10 Correct 5 ms 4224 KB Output is correct
11 Correct 5 ms 4276 KB Output is correct
12 Correct 5 ms 4180 KB Output is correct
13 Correct 5 ms 4180 KB Output is correct
14 Correct 5 ms 4180 KB Output is correct
15 Correct 5 ms 4180 KB Output is correct
16 Correct 5 ms 4180 KB Output is correct
17 Correct 4 ms 4180 KB Output is correct
18 Correct 5 ms 4180 KB Output is correct
19 Correct 5 ms 4264 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 5 ms 4180 KB Output is correct
6 Correct 5 ms 4180 KB Output is correct
7 Correct 5 ms 4180 KB Output is correct
8 Correct 7 ms 4256 KB Output is correct
9 Correct 5 ms 4180 KB Output is correct
10 Correct 5 ms 4224 KB Output is correct
11 Correct 5 ms 4276 KB Output is correct
12 Correct 5 ms 4180 KB Output is correct
13 Correct 5 ms 4180 KB Output is correct
14 Correct 5 ms 4180 KB Output is correct
15 Correct 5 ms 4180 KB Output is correct
16 Correct 5 ms 4180 KB Output is correct
17 Correct 4 ms 4180 KB Output is correct
18 Correct 5 ms 4180 KB Output is correct
19 Correct 5 ms 4264 KB Output is correct
20 Correct 238 ms 5496 KB Output is correct
21 Correct 249 ms 5452 KB Output is correct
22 Correct 238 ms 5400 KB Output is correct
23 Correct 244 ms 5448 KB Output is correct
24 Correct 420 ms 163100 KB Output is correct
25 Correct 492 ms 163136 KB Output is correct
26 Correct 423 ms 162892 KB Output is correct
27 Correct 400 ms 163148 KB Output is correct
28 Correct 368 ms 163184 KB Output is correct
29 Correct 373 ms 163060 KB Output is correct
30 Correct 361 ms 163080 KB Output is correct
31 Correct 395 ms 163268 KB Output is correct
32 Correct 369 ms 163020 KB Output is correct
33 Correct 366 ms 163020 KB Output is correct
34 Correct 357 ms 163248 KB Output is correct
35 Correct 360 ms 162844 KB Output is correct
36 Correct 372 ms 163232 KB Output is correct
37 Correct 388 ms 163020 KB Output is correct
38 Correct 373 ms 162944 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 5 ms 4180 KB Output is correct
6 Correct 5 ms 4180 KB Output is correct
7 Correct 5 ms 4180 KB Output is correct
8 Correct 7 ms 4256 KB Output is correct
9 Correct 5 ms 4180 KB Output is correct
10 Correct 5 ms 4224 KB Output is correct
11 Correct 5 ms 4276 KB Output is correct
12 Correct 5 ms 4180 KB Output is correct
13 Correct 5 ms 4180 KB Output is correct
14 Correct 5 ms 4180 KB Output is correct
15 Correct 5 ms 4180 KB Output is correct
16 Correct 5 ms 4180 KB Output is correct
17 Correct 4 ms 4180 KB Output is correct
18 Correct 5 ms 4180 KB Output is correct
19 Correct 5 ms 4264 KB Output is correct
20 Correct 238 ms 5496 KB Output is correct
21 Correct 249 ms 5452 KB Output is correct
22 Correct 238 ms 5400 KB Output is correct
23 Correct 244 ms 5448 KB Output is correct
24 Correct 420 ms 163100 KB Output is correct
25 Correct 492 ms 163136 KB Output is correct
26 Correct 423 ms 162892 KB Output is correct
27 Correct 400 ms 163148 KB Output is correct
28 Correct 368 ms 163184 KB Output is correct
29 Correct 373 ms 163060 KB Output is correct
30 Correct 361 ms 163080 KB Output is correct
31 Correct 395 ms 163268 KB Output is correct
32 Correct 369 ms 163020 KB Output is correct
33 Correct 366 ms 163020 KB Output is correct
34 Correct 357 ms 163248 KB Output is correct
35 Correct 360 ms 162844 KB Output is correct
36 Correct 372 ms 163232 KB Output is correct
37 Correct 388 ms 163020 KB Output is correct
38 Correct 373 ms 162944 KB Output is correct
39 Correct 459 ms 163108 KB Output is correct
40 Correct 460 ms 162752 KB Output is correct
41 Correct 476 ms 162660 KB Output is correct
42 Correct 525 ms 163156 KB Output is correct
43 Correct 445 ms 163052 KB Output is correct
44 Correct 268 ms 5764 KB Output is correct
45 Correct 250 ms 5564 KB Output is correct
46 Correct 242 ms 5520 KB Output is correct
47 Correct 264 ms 5488 KB Output is correct
48 Correct 239 ms 5468 KB Output is correct
49 Correct 408 ms 162928 KB Output is correct
50 Correct 393 ms 162300 KB Output is correct
51 Correct 269 ms 5844 KB Output is correct
52 Correct 246 ms 5532 KB Output is correct
53 Correct 411 ms 162912 KB Output is correct
54 Correct 434 ms 162680 KB Output is correct
55 Correct 367 ms 162392 KB Output is correct
56 Correct 388 ms 162308 KB Output is correct
57 Correct 269 ms 5840 KB Output is correct
58 Correct 265 ms 5800 KB Output is correct
59 Correct 251 ms 5384 KB Output is correct
60 Correct 242 ms 5348 KB Output is correct
61 Correct 520 ms 162812 KB Output is correct
62 Correct 460 ms 162740 KB Output is correct
63 Correct 487 ms 162924 KB Output is correct
64 Correct 684 ms 162764 KB Output is correct
65 Correct 644 ms 162772 KB Output is correct
66 Correct 691 ms 162764 KB Output is correct
67 Correct 600 ms 162852 KB Output is correct
68 Correct 616 ms 162840 KB Output is correct
69 Correct 635 ms 162728 KB Output is correct
70 Correct 377 ms 162816 KB Output is correct
71 Correct 376 ms 162820 KB Output is correct
72 Correct 414 ms 162796 KB Output is correct
73 Correct 399 ms 162712 KB Output is correct
74 Correct 405 ms 162764 KB Output is correct
75 Correct 425 ms 162780 KB Output is correct
76 Correct 423 ms 163408 KB Output is correct
77 Correct 397 ms 163192 KB Output is correct
78 Correct 398 ms 163092 KB Output is correct
79 Correct 267 ms 5788 KB Output is correct
80 Correct 253 ms 5436 KB Output is correct
81 Correct 244 ms 5468 KB Output is correct
82 Correct 405 ms 163524 KB Output is correct
83 Correct 461 ms 163124 KB Output is correct
84 Correct 408 ms 163356 KB Output is correct
85 Correct 437 ms 163236 KB Output is correct
86 Correct 387 ms 163156 KB Output is correct
87 Correct 476 ms 163212 KB Output is correct
88 Correct 271 ms 5868 KB Output is correct
89 Correct 278 ms 5784 KB Output is correct
90 Correct 247 ms 5412 KB Output is correct
91 Correct 268 ms 5412 KB Output is correct
92 Correct 239 ms 5380 KB Output is correct
93 Correct 250 ms 5520 KB Output is correct
94 Correct 401 ms 163112 KB Output is correct
95 Correct 395 ms 162888 KB Output is correct
96 Correct 391 ms 163072 KB Output is correct
97 Correct 396 ms 163168 KB Output is correct
98 Correct 370 ms 163112 KB Output is correct
99 Correct 373 ms 163076 KB Output is correct
100 Correct 314 ms 5808 KB Output is correct
101 Correct 275 ms 5740 KB Output is correct
102 Correct 252 ms 5484 KB Output is correct
103 Correct 257 ms 5436 KB Output is correct
104 Correct 244 ms 5420 KB Output is correct
105 Correct 253 ms 5584 KB Output is correct
106 Correct 399 ms 163212 KB Output is correct
107 Correct 443 ms 163020 KB Output is correct
108 Correct 406 ms 163148 KB Output is correct
109 Correct 423 ms 163128 KB Output is correct
110 Correct 382 ms 163164 KB Output is correct
111 Correct 402 ms 163224 KB Output is correct
112 Correct 274 ms 5824 KB Output is correct
113 Correct 279 ms 5844 KB Output is correct
114 Correct 247 ms 5448 KB Output is correct
115 Correct 245 ms 5376 KB Output is correct
116 Correct 246 ms 5432 KB Output is correct
117 Correct 240 ms 5460 KB Output is correct
118 Correct 389 ms 162500 KB Output is correct
119 Correct 375 ms 162412 KB Output is correct
120 Correct 403 ms 162360 KB Output is correct
121 Correct 374 ms 162452 KB Output is correct
122 Correct 396 ms 162332 KB Output is correct
123 Correct 388 ms 162380 KB Output is correct
124 Correct 385 ms 162308 KB Output is correct
125 Correct 371 ms 162308 KB Output is correct
126 Correct 396 ms 162488 KB Output is correct