oj.uz

Submission #369676

# Submission time Handle Problem Language Result Execution time Memory
369676 2021-02-22T08:04:20 Z 8e7 Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 1924 ms 128876 KB 
//Challenge: Accepted
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#define ll long long
#define maxn 100005
#define pii pair<int, int>
#define ff first
#define ss second
using namespace std;
const int siz = 140;
vector<int> adj[maxn], from[maxn];
pii pnt[maxn][siz + 3];
pii tmp[siz + 3];
int num[maxn];

inline bool cmp (pii a, pii b) {
	return a.ss > b.ss;
}


int dp[maxn];
bool part[maxn], found[maxn];
void getdp(int n, int id) {
	for (int i = 1;i <= id;i++) dp[i] = 0;
	for (int i = 1;i <= id;i++) {
		for (int v:adj[i]) {
			dp[v] = max(dp[v], (dp[i] == 0 ? (part[i] ? -1 : 0) : dp[i]) + 1);
		}
	}
}
void merge(int a, int b) {
	int n = num[a], m = num[b], ind = 0, c = 0;
	for (int i = 0;i < n;i++) {
		while (ind < m && pnt[b][ind].ss + 1 > pnt[a][i].ss) {
			if (!found[pnt[b][ind].ff]) {
				found[pnt[b][ind].ff] = 1;
				tmp[c++] = make_pair(pnt[b][ind].ff, pnt[b][ind].ss + 1);
			}
			ind++;
			if (c > siz) break;
		}
		if (!found[pnt[a][i].ff]) {
			found[pnt[a][i].ff] = 1;
			tmp[c++] = pnt[a][i];
		}
		if (c > siz) break;
	}
	while (ind < m) {
		if (!found[pnt[b][ind].ff]) {
			found[pnt[b][ind].ff] = 1;
			tmp[c++] = make_pair(pnt[b][ind].ff, pnt[b][ind].ss + 1);
		}
		ind++;
		if (c > siz) break;
	}
	for (int i = 0;i < c;i++) found[tmp[i].ff] = 0;
	num[a] = min(siz, c);
	for (int i = 0;i < num[a];i++) pnt[a][i] = tmp[i];
}
int main() {
	ios_base::sync_with_stdio(0);cin.tie(0);
	int n, m, q;
	cin >> n >> m >> q;
	for (int i = 0;i < m;i++) {
		int a, b;
		cin >> a >> b;
		adj[a].push_back(b);
		from[b].push_back(a);
	}
	for (int i = 1;i <= n;i++) {
		num[i] = 1;
		pnt[i][0] = make_pair(i, 0);
		for (int v:from[i]) {
			merge(i, v);
		}
	}
	getdp(n, n);
	while (q--) {
		int ind, yi;
		cin >> ind >> yi;
		vector<int> val;
		for (int i = 0;i < yi;i++) {
			int x;
			cin >> x;
			if (x <= ind) part[x] = 1, val.push_back(x);
		}
		if (yi >= siz) {
			getdp(n, ind);
			if (part[ind] && dp[ind] == 0) cout << -1 << "\n";
			else cout << dp[ind] << "\n";
		} else {
			int ans = -1;
			for (int v = 0;v < num[ind];v++) {
				if (!part[pnt[ind][v].ff]) ans = max(ans, pnt[ind][v].ss);
			}
			cout << ans << "\n";
		}
		for (int i:val) part[i] = 0;
	}
}
/*
5 6 3
1 2
2 4
3 4
1 3
3 5
4 5
4 1 1
5 2 2 3
2 3 1 4 5
 */

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5120 KB Output is correct
5 Correct 6 ms 6252 KB Output is correct
6 Correct 6 ms 6252 KB Output is correct
7 Correct 6 ms 6252 KB Output is correct
8 Correct 7 ms 6252 KB Output is correct
9 Correct 9 ms 6268 KB Output is correct
10 Correct 8 ms 6400 KB Output is correct
11 Correct 8 ms 6200 KB Output is correct
12 Correct 7 ms 6252 KB Output is correct
13 Correct 8 ms 6276 KB Output is correct
14 Correct 7 ms 6252 KB Output is correct
15 Correct 7 ms 6252 KB Output is correct
16 Correct 7 ms 6252 KB Output is correct
17 Correct 7 ms 6280 KB Output is correct
18 Correct 192 ms 6252 KB Output is correct
19 Correct 7 ms 6252 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5120 KB Output is correct
5 Correct 6 ms 6252 KB Output is correct
6 Correct 6 ms 6252 KB Output is correct
7 Correct 6 ms 6252 KB Output is correct
8 Correct 7 ms 6252 KB Output is correct
9 Correct 9 ms 6268 KB Output is correct
10 Correct 8 ms 6400 KB Output is correct
11 Correct 8 ms 6200 KB Output is correct
12 Correct 7 ms 6252 KB Output is correct
13 Correct 8 ms 6276 KB Output is correct
14 Correct 7 ms 6252 KB Output is correct
15 Correct 7 ms 6252 KB Output is correct
16 Correct 7 ms 6252 KB Output is correct
17 Correct 7 ms 6280 KB Output is correct
18 Correct 192 ms 6252 KB Output is correct
19 Correct 7 ms 6252 KB Output is correct
20 Correct 315 ms 9580 KB Output is correct
21 Correct 751 ms 9580 KB Output is correct
22 Correct 308 ms 9580 KB Output is correct
23 Correct 308 ms 9580 KB Output is correct
24 Correct 468 ms 124268 KB Output is correct
25 Correct 473 ms 124288 KB Output is correct
26 Correct 467 ms 124308 KB Output is correct
27 Correct 447 ms 125936 KB Output is correct
28 Correct 450 ms 125804 KB Output is correct
29 Correct 506 ms 125808 KB Output is correct
30 Correct 435 ms 124780 KB Output is correct
31 Correct 434 ms 125100 KB Output is correct
32 Correct 439 ms 124908 KB Output is correct
33 Correct 394 ms 124780 KB Output is correct
34 Correct 372 ms 125164 KB Output is correct
35 Correct 396 ms 124652 KB Output is correct
36 Correct 410 ms 125292 KB Output is correct
37 Correct 422 ms 125036 KB Output is correct
38 Correct 426 ms 125196 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5100 KB Output is correct
2 Correct 4 ms 5100 KB Output is correct
3 Correct 4 ms 5100 KB Output is correct
4 Correct 4 ms 5120 KB Output is correct
5 Correct 6 ms 6252 KB Output is correct
6 Correct 6 ms 6252 KB Output is correct
7 Correct 6 ms 6252 KB Output is correct
8 Correct 7 ms 6252 KB Output is correct
9 Correct 9 ms 6268 KB Output is correct
10 Correct 8 ms 6400 KB Output is correct
11 Correct 8 ms 6200 KB Output is correct
12 Correct 7 ms 6252 KB Output is correct
13 Correct 8 ms 6276 KB Output is correct
14 Correct 7 ms 6252 KB Output is correct
15 Correct 7 ms 6252 KB Output is correct
16 Correct 7 ms 6252 KB Output is correct
17 Correct 7 ms 6280 KB Output is correct
18 Correct 192 ms 6252 KB Output is correct
19 Correct 7 ms 6252 KB Output is correct
20 Correct 315 ms 9580 KB Output is correct
21 Correct 751 ms 9580 KB Output is correct
22 Correct 308 ms 9580 KB Output is correct
23 Correct 308 ms 9580 KB Output is correct
24 Correct 468 ms 124268 KB Output is correct
25 Correct 473 ms 124288 KB Output is correct
26 Correct 467 ms 124308 KB Output is correct
27 Correct 447 ms 125936 KB Output is correct
28 Correct 450 ms 125804 KB Output is correct
29 Correct 506 ms 125808 KB Output is correct
30 Correct 435 ms 124780 KB Output is correct
31 Correct 434 ms 125100 KB Output is correct
32 Correct 439 ms 124908 KB Output is correct
33 Correct 394 ms 124780 KB Output is correct
34 Correct 372 ms 125164 KB Output is correct
35 Correct 396 ms 124652 KB Output is correct
36 Correct 410 ms 125292 KB Output is correct
37 Correct 422 ms 125036 KB Output is correct
38 Correct 426 ms 125196 KB Output is correct
39 Correct 527 ms 124364 KB Output is correct
40 Correct 457 ms 124012 KB Output is correct
41 Correct 480 ms 124012 KB Output is correct
42 Correct 822 ms 124056 KB Output is correct
43 Correct 542 ms 124140 KB Output is correct
44 Correct 378 ms 10020 KB Output is correct
45 Correct 335 ms 9744 KB Output is correct
46 Correct 327 ms 9660 KB Output is correct
47 Correct 375 ms 9684 KB Output is correct
48 Correct 313 ms 9652 KB Output is correct
49 Correct 522 ms 126060 KB Output is correct
50 Correct 480 ms 125476 KB Output is correct
51 Correct 361 ms 10008 KB Output is correct
52 Correct 320 ms 9580 KB Output is correct
53 Correct 499 ms 125356 KB Output is correct
54 Correct 487 ms 125268 KB Output is correct
55 Correct 436 ms 124908 KB Output is correct
56 Correct 406 ms 124872 KB Output is correct
57 Correct 362 ms 10100 KB Output is correct
58 Correct 402 ms 10092 KB Output is correct
59 Correct 305 ms 9580 KB Output is correct
60 Correct 341 ms 9708 KB Output is correct
61 Correct 740 ms 125548 KB Output is correct
62 Correct 700 ms 125036 KB Output is correct
63 Correct 668 ms 124908 KB Output is correct
64 Correct 1401 ms 125420 KB Output is correct
65 Correct 1249 ms 124780 KB Output is correct
66 Correct 1356 ms 124908 KB Output is correct
67 Correct 1924 ms 125380 KB Output is correct
68 Correct 1867 ms 126700 KB Output is correct
69 Correct 1838 ms 126700 KB Output is correct
70 Correct 475 ms 127340 KB Output is correct
71 Correct 446 ms 126828 KB Output is correct
72 Correct 438 ms 126976 KB Output is correct
73 Correct 581 ms 127340 KB Output is correct
74 Correct 504 ms 126956 KB Output is correct
75 Correct 513 ms 126692 KB Output is correct
76 Correct 530 ms 128876 KB Output is correct
77 Correct 1445 ms 127468 KB Output is correct
78 Correct 486 ms 127596 KB Output is correct
79 Correct 354 ms 11588 KB Output is correct
80 Correct 455 ms 10732 KB Output is correct
81 Correct 301 ms 10348 KB Output is correct
82 Correct 529 ms 128108 KB Output is correct
83 Correct 554 ms 127852 KB Output is correct
84 Correct 1340 ms 126828 KB Output is correct
85 Correct 1576 ms 127020 KB Output is correct
86 Correct 475 ms 126832 KB Output is correct
87 Correct 521 ms 126828 KB Output is correct
88 Correct 387 ms 11628 KB Output is correct
89 Correct 373 ms 11648 KB Output is correct
90 Correct 476 ms 10604 KB Output is correct
91 Correct 527 ms 10712 KB Output is correct
92 Correct 302 ms 10348 KB Output is correct
93 Correct 306 ms 10476 KB Output is correct
94 Correct 470 ms 128108 KB Output is correct
95 Correct 464 ms 127876 KB Output is correct
96 Correct 1447 ms 126880 KB Output is correct
97 Correct 1442 ms 126828 KB Output is correct
98 Correct 441 ms 126964 KB Output is correct
99 Correct 436 ms 127084 KB Output is correct
100 Correct 417 ms 11628 KB Output is correct
101 Correct 385 ms 11700 KB Output is correct
102 Correct 501 ms 10732 KB Output is correct
103 Correct 460 ms 10732 KB Output is correct
104 Correct 354 ms 10476 KB Output is correct
105 Correct 315 ms 10476 KB Output is correct
106 Correct 483 ms 128324 KB Output is correct
107 Correct 478 ms 127980 KB Output is correct
108 Correct 1243 ms 126956 KB Output is correct
109 Correct 1265 ms 126828 KB Output is correct
110 Correct 474 ms 127256 KB Output is correct
111 Correct 435 ms 127176 KB Output is correct
112 Correct 362 ms 11628 KB Output is correct
113 Correct 360 ms 11628 KB Output is correct
114 Correct 476 ms 10712 KB Output is correct
115 Correct 483 ms 10604 KB Output is correct
116 Correct 302 ms 10348 KB Output is correct
117 Correct 318 ms 10220 KB Output is correct
118 Correct 445 ms 127084 KB Output is correct
119 Correct 454 ms 126572 KB Output is correct
120 Correct 414 ms 126700 KB Output is correct
121 Correct 467 ms 127204 KB Output is correct
122 Correct 421 ms 126700 KB Output is correct
123 Correct 429 ms 126580 KB Output is correct
124 Correct 463 ms 127212 KB Output is correct
125 Correct 418 ms 126596 KB Output is correct
126 Correct 401 ms 126572 KB Output is correct