oj.uz

Submission #712323

# Submission time Handle Problem Language Result Execution time Memory
712323 2023-03-18T14:48:51 Z Radin_Zahedi2 Bitaro’s Party (JOI18_bitaro) C++17
100 / 100
 753 ms 244972 KB 
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
using ll = long long;
using ld = long double;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define sz(x) (int)x.size()
#define endl '\n'
const int mod = 1e9 + 7;
const int inf = 2e9 + 5;
const ll linf = 9e18 + 5;


int n, m, q;
const int N = 1e5 + 5;
const int M = 2e5 + 5;
const int S = 300;
vector<int> adj[N];

pair<int, int> vert[N][S];

bool ok[N];

void init() {
	fill(ok + 0, ok + N, true);
}

void input() {
	cin >> n >> m >> q;

	for (int i = 1; i <= m; i++) {
		int u, v;
		cin >> u >> v;

		adj[v].pb(u);
	}
}

void cre() {
	for (int u = 1; u <= n; u++) {
		int inds[sz(adj[u])];
		fill(inds + 0, inds + sz(adj[u]), 0);

		int ind = 0;
		while (ind < S) {
			int bestind = -1;
			pair<int, int> best = mp(-1, 0);

			for (int i = 0; i < sz(adj[u]); i++) {
				while (inds[i] < S) {
					if (ok[vert[adj[u][i]][inds[i]].se]) {
						break;
					}

					inds[i]++;
				}

				if (inds[i] == S) {
					continue;
				}

				if (best < vert[adj[u][i]][inds[i]]) {
					bestind = i;
					best = vert[adj[u][i]][inds[i]];
				}
			}

			if (bestind == -1) {
				break;
			}

			best.fi++;
			vert[u][ind] = best;
			ok[best.se] = false;
			ind++;
		}

		if (ind < S) {
			vert[u][ind] = mp(0, u);
			ind++;
		}
		while (ind < S) {
			vert[u][ind] = mp(-1, 0);
			ind++;
		}


		for (int i = 0; i < S; i++) {
			ok[vert[u][i].se] = true;
		}
	}
}

int naive(int k) {
	int dp[k + 1];
	for (int u = 1; u <= k; u++) {
		if (ok[u]) {
			dp[u] = 0;
		}
		else {
			dp[u] = -inf;
		}

		for (auto v : adj[u]) {
			dp[u] = max(dp[u], dp[v] + 1);
		}
	}

	return max(dp[k], -1);
}

void solve() {
	cre();

	fill(ok + 0, ok + n + 1, true);
	while (q--) {
		int t, y;
		cin >> t >> y;
		
		int verts[y];
		for (int i = 0; i < y; i++) {
			cin >> verts[i];
		}


		for (int i = 0; i < y; i++) {
			ok[verts[i]] = false;
		}

		if (y >= S) {
			cout << naive(t) << endl;
		}
		else {
			for (int i = 0; i < S; i++) {
				if (ok[vert[t][i].se]) {
					cout << vert[t][i].fi << endl;
					break;
				}
			}
		}

		for (int i = 0; i < y; i++) {
			ok[verts[i]] = true;
		}
	}
}

void output() {
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	int number_of_testcases = 1;
	//cin >> number_of_testcases;
	while (number_of_testcases--) {
		init();

		input();

		solve();

		output();
	}

	return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2772 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 1 ms 2772 KB Output is correct
5 Correct 5 ms 5076 KB Output is correct
6 Correct 5 ms 5076 KB Output is correct
7 Correct 6 ms 5076 KB Output is correct
8 Correct 7 ms 5076 KB Output is correct
9 Correct 6 ms 5076 KB Output is correct
10 Correct 6 ms 5076 KB Output is correct
11 Correct 6 ms 5076 KB Output is correct
12 Correct 5 ms 5040 KB Output is correct
13 Correct 6 ms 5076 KB Output is correct
14 Correct 7 ms 5116 KB Output is correct
15 Correct 5 ms 5076 KB Output is correct
16 Correct 5 ms 5076 KB Output is correct
17 Correct 6 ms 5088 KB Output is correct
18 Correct 6 ms 5076 KB Output is correct
19 Correct 6 ms 5204 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2772 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 1 ms 2772 KB Output is correct
5 Correct 5 ms 5076 KB Output is correct
6 Correct 5 ms 5076 KB Output is correct
7 Correct 6 ms 5076 KB Output is correct
8 Correct 7 ms 5076 KB Output is correct
9 Correct 6 ms 5076 KB Output is correct
10 Correct 6 ms 5076 KB Output is correct
11 Correct 6 ms 5076 KB Output is correct
12 Correct 5 ms 5040 KB Output is correct
13 Correct 6 ms 5076 KB Output is correct
14 Correct 7 ms 5116 KB Output is correct
15 Correct 5 ms 5076 KB Output is correct
16 Correct 5 ms 5076 KB Output is correct
17 Correct 6 ms 5088 KB Output is correct
18 Correct 6 ms 5076 KB Output is correct
19 Correct 6 ms 5204 KB Output is correct
20 Correct 422 ms 7800 KB Output is correct
21 Correct 381 ms 7952 KB Output is correct
22 Correct 378 ms 7952 KB Output is correct
23 Correct 338 ms 7916 KB Output is correct
24 Correct 637 ms 243256 KB Output is correct
25 Correct 579 ms 243276 KB Output is correct
26 Correct 558 ms 243256 KB Output is correct
27 Correct 542 ms 243820 KB Output is correct
28 Correct 548 ms 243696 KB Output is correct
29 Correct 527 ms 243896 KB Output is correct
30 Correct 522 ms 243704 KB Output is correct
31 Correct 588 ms 243916 KB Output is correct
32 Correct 544 ms 243676 KB Output is correct
33 Correct 454 ms 243124 KB Output is correct
34 Correct 455 ms 243392 KB Output is correct
35 Correct 480 ms 243288 KB Output is correct
36 Correct 498 ms 243444 KB Output is correct
37 Correct 595 ms 243228 KB Output is correct
38 Correct 522 ms 243276 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2772 KB Output is correct
2 Correct 2 ms 2772 KB Output is correct
3 Correct 2 ms 2772 KB Output is correct
4 Correct 1 ms 2772 KB Output is correct
5 Correct 5 ms 5076 KB Output is correct
6 Correct 5 ms 5076 KB Output is correct
7 Correct 6 ms 5076 KB Output is correct
8 Correct 7 ms 5076 KB Output is correct
9 Correct 6 ms 5076 KB Output is correct
10 Correct 6 ms 5076 KB Output is correct
11 Correct 6 ms 5076 KB Output is correct
12 Correct 5 ms 5040 KB Output is correct
13 Correct 6 ms 5076 KB Output is correct
14 Correct 7 ms 5116 KB Output is correct
15 Correct 5 ms 5076 KB Output is correct
16 Correct 5 ms 5076 KB Output is correct
17 Correct 6 ms 5088 KB Output is correct
18 Correct 6 ms 5076 KB Output is correct
19 Correct 6 ms 5204 KB Output is correct
20 Correct 422 ms 7800 KB Output is correct
21 Correct 381 ms 7952 KB Output is correct
22 Correct 378 ms 7952 KB Output is correct
23 Correct 338 ms 7916 KB Output is correct
24 Correct 637 ms 243256 KB Output is correct
25 Correct 579 ms 243276 KB Output is correct
26 Correct 558 ms 243256 KB Output is correct
27 Correct 542 ms 243820 KB Output is correct
28 Correct 548 ms 243696 KB Output is correct
29 Correct 527 ms 243896 KB Output is correct
30 Correct 522 ms 243704 KB Output is correct
31 Correct 588 ms 243916 KB Output is correct
32 Correct 544 ms 243676 KB Output is correct
33 Correct 454 ms 243124 KB Output is correct
34 Correct 455 ms 243392 KB Output is correct
35 Correct 480 ms 243288 KB Output is correct
36 Correct 498 ms 243444 KB Output is correct
37 Correct 595 ms 243228 KB Output is correct
38 Correct 522 ms 243276 KB Output is correct
39 Correct 635 ms 244312 KB Output is correct
40 Correct 602 ms 243244 KB Output is correct
41 Correct 567 ms 243148 KB Output is correct
42 Correct 658 ms 243524 KB Output is correct
43 Correct 592 ms 243636 KB Output is correct
44 Correct 367 ms 9216 KB Output is correct
45 Correct 342 ms 8304 KB Output is correct
46 Correct 346 ms 8384 KB Output is correct
47 Correct 383 ms 8044 KB Output is correct
48 Correct 379 ms 7812 KB Output is correct
49 Correct 551 ms 244592 KB Output is correct
50 Correct 528 ms 243368 KB Output is correct
51 Correct 386 ms 9040 KB Output is correct
52 Correct 359 ms 8188 KB Output is correct
53 Correct 546 ms 244192 KB Output is correct
54 Correct 579 ms 243828 KB Output is correct
55 Correct 518 ms 242904 KB Output is correct
56 Correct 549 ms 242856 KB Output is correct
57 Correct 393 ms 9084 KB Output is correct
58 Correct 386 ms 8908 KB Output is correct
59 Correct 351 ms 8092 KB Output is correct
60 Correct 352 ms 8088 KB Output is correct
61 Correct 601 ms 243844 KB Output is correct
62 Correct 575 ms 243452 KB Output is correct
63 Correct 614 ms 243428 KB Output is correct
64 Correct 688 ms 243736 KB Output is correct
65 Correct 648 ms 243408 KB Output is correct
66 Correct 753 ms 243496 KB Output is correct
67 Correct 515 ms 243532 KB Output is correct
68 Correct 500 ms 242904 KB Output is correct
69 Correct 541 ms 242880 KB Output is correct
70 Correct 524 ms 243900 KB Output is correct
71 Correct 501 ms 243444 KB Output is correct
72 Correct 561 ms 243620 KB Output is correct
73 Correct 534 ms 243836 KB Output is correct
74 Correct 507 ms 243440 KB Output is correct
75 Correct 576 ms 243500 KB Output is correct
76 Correct 558 ms 244972 KB Output is correct
77 Correct 540 ms 243588 KB Output is correct
78 Correct 520 ms 244000 KB Output is correct
79 Correct 388 ms 9204 KB Output is correct
80 Correct 364 ms 8388 KB Output is correct
81 Correct 355 ms 7800 KB Output is correct
82 Correct 585 ms 244876 KB Output is correct
83 Correct 663 ms 244688 KB Output is correct
84 Correct 538 ms 243560 KB Output is correct
85 Correct 604 ms 243672 KB Output is correct
86 Correct 525 ms 243912 KB Output is correct
87 Correct 623 ms 243944 KB Output is correct
88 Correct 386 ms 9176 KB Output is correct
89 Correct 379 ms 9196 KB Output is correct
90 Correct 363 ms 8196 KB Output is correct
91 Correct 354 ms 8264 KB Output is correct
92 Correct 363 ms 7840 KB Output is correct
93 Correct 343 ms 7824 KB Output is correct
94 Correct 497 ms 244300 KB Output is correct
95 Correct 497 ms 244248 KB Output is correct
96 Correct 439 ms 243148 KB Output is correct
97 Correct 441 ms 243124 KB Output is correct
98 Correct 457 ms 243484 KB Output is correct
99 Correct 437 ms 243460 KB Output is correct
100 Correct 359 ms 9232 KB Output is correct
101 Correct 372 ms 9188 KB Output is correct
102 Correct 341 ms 8256 KB Output is correct
103 Correct 340 ms 8224 KB Output is correct
104 Correct 343 ms 7800 KB Output is correct
105 Correct 339 ms 7924 KB Output is correct
106 Correct 525 ms 244464 KB Output is correct
107 Correct 571 ms 244284 KB Output is correct
108 Correct 486 ms 243144 KB Output is correct
109 Correct 553 ms 243136 KB Output is correct
110 Correct 497 ms 243732 KB Output is correct
111 Correct 575 ms 243828 KB Output is correct
112 Correct 463 ms 9204 KB Output is correct
113 Correct 369 ms 9152 KB Output is correct
114 Correct 375 ms 8264 KB Output is correct
115 Correct 343 ms 8228 KB Output is correct
116 Correct 359 ms 7792 KB Output is correct
117 Correct 336 ms 7900 KB Output is correct
118 Correct 522 ms 243636 KB Output is correct
119 Correct 489 ms 243068 KB Output is correct
120 Correct 526 ms 242904 KB Output is correct
121 Correct 511 ms 243404 KB Output is correct
122 Correct 484 ms 243080 KB Output is correct
123 Correct 615 ms 243088 KB Output is correct
124 Correct 561 ms 243560 KB Output is correct
125 Correct 494 ms 242976 KB Output is correct
126 Correct 544 ms 242960 KB Output is correct