oj.uz

Submission #95078

# Submission time Handle Problem Language Result Execution time Memory
95078 2019-01-27T07:48:19 Z ImaniAm Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 2000 ms 459056 KB 
#include <bits/stdc++.h>

using namespace std;

#define pb push_back

typedef pair <int, int> pii;

const int maxn = 1e5 + 10, maxm = 2e5 + 10, sq = 320;
int n, m, q, size[maxn], h[maxn], input[maxn];
vector <pii> mx[maxn], vec;
vector <int> in[maxn];
bitset <maxn> mark;

int main(){
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n >> m >> q;
	for (int i = 0; i < n; ++i)
		mx[i].reserve(sq);
	for (int i = 0, v, u; i < m; ++i) {
		cin >> v >> u;
		in[--u].pb(--v);
	}
	vec.resize(sq + sq);
	for (int i = 0; i < n; ++i) {
		mx[i].pb({-1, i});
		for (auto j: in[i]) {
			int se = mx[i].size(), se2 = mx[j].size();
			vec.resize(se + se2);
			merge(mx[i].begin(), mx[i].end(), mx[j].begin(), mx[j].end(), vec.begin());
			if (int(vec.size()) > sq) {
				reverse(vec.begin(), vec.end());
				vec.resize(sq);
				reverse(vec.begin(), vec.end());
			}
			mx[i].swap(vec);
		}
		size[i] = mx[i].size();
		for (int j = 0; j < size[i]; ++j)
			mx[i][j].first++;
	}
	for (int i = 0, v, num; i < q; ++i) {
		cin >> v >> num; --v;
		for (int j = 0; j < num; ++j) {
			cin >> input[j];
			mark[--input[j]] = true;
		}
		int ans = -1;
		for (int j = 0; j < size[v]; ++j)
			if (!mark[mx[v][j].second])
				ans = mx[v][j].first;
		if (ans == -1) {
			memset(h, -63, sizeof(h));
			h[v] = 0;
			for (int j = v; ~j; --j) {
				if (!mark[j])
					ans = max(ans, h[j]);
				for (auto u: in[j])
					h[u] = max(h[u], h[j] + 1);
			}
		}
		cout << ans << '\n';
		for (int j = 0; j < num; ++j)
			mark[input[j]] = false;
	}
	return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5368 KB Output is correct
3 Correct 5 ms 5496 KB Output is correct
4 Correct 6 ms 5496 KB Output is correct
5 Correct 13 ms 8696 KB Output is correct
6 Correct 11 ms 8412 KB Output is correct
7 Correct 12 ms 8440 KB Output is correct
8 Correct 14 ms 9464 KB Output is correct
9 Correct 14 ms 9448 KB Output is correct
10 Correct 15 ms 9948 KB Output is correct
11 Correct 14 ms 9228 KB Output is correct
12 Correct 12 ms 8444 KB Output is correct
13 Correct 15 ms 9796 KB Output is correct
14 Correct 12 ms 8824 KB Output is correct
15 Correct 9 ms 8056 KB Output is correct
16 Correct 10 ms 8440 KB Output is correct
17 Correct 13 ms 8952 KB Output is correct
18 Correct 10 ms 8312 KB Output is correct
19 Correct 11 ms 9336 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5368 KB Output is correct
3 Correct 5 ms 5496 KB Output is correct
4 Correct 6 ms 5496 KB Output is correct
5 Correct 13 ms 8696 KB Output is correct
6 Correct 11 ms 8412 KB Output is correct
7 Correct 12 ms 8440 KB Output is correct
8 Correct 14 ms 9464 KB Output is correct
9 Correct 14 ms 9448 KB Output is correct
10 Correct 15 ms 9948 KB Output is correct
11 Correct 14 ms 9228 KB Output is correct
12 Correct 12 ms 8444 KB Output is correct
13 Correct 15 ms 9796 KB Output is correct
14 Correct 12 ms 8824 KB Output is correct
15 Correct 9 ms 8056 KB Output is correct
16 Correct 10 ms 8440 KB Output is correct
17 Correct 13 ms 8952 KB Output is correct
18 Correct 10 ms 8312 KB Output is correct
19 Correct 11 ms 9336 KB Output is correct
20 Correct 353 ms 11744 KB Output is correct
21 Correct 346 ms 11296 KB Output is correct
22 Correct 351 ms 11768 KB Output is correct
23 Correct 348 ms 11264 KB Output is correct
24 Correct 783 ms 404476 KB Output is correct
25 Correct 927 ms 404160 KB Output is correct
26 Correct 923 ms 405240 KB Output is correct
27 Correct 975 ms 458816 KB Output is correct
28 Correct 812 ms 458668 KB Output is correct
29 Correct 933 ms 459056 KB Output is correct
30 Correct 982 ms 457540 KB Output is correct
31 Correct 955 ms 441872 KB Output is correct
32 Correct 943 ms 457932 KB Output is correct
33 Correct 700 ms 363896 KB Output is correct
34 Correct 752 ms 348184 KB Output is correct
35 Correct 643 ms 363884 KB Output is correct
36 Correct 809 ms 413376 KB Output is correct
37 Correct 769 ms 394200 KB Output is correct
38 Correct 840 ms 413560 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5368 KB Output is correct
3 Correct 5 ms 5496 KB Output is correct
4 Correct 6 ms 5496 KB Output is correct
5 Correct 13 ms 8696 KB Output is correct
6 Correct 11 ms 8412 KB Output is correct
7 Correct 12 ms 8440 KB Output is correct
8 Correct 14 ms 9464 KB Output is correct
9 Correct 14 ms 9448 KB Output is correct
10 Correct 15 ms 9948 KB Output is correct
11 Correct 14 ms 9228 KB Output is correct
12 Correct 12 ms 8444 KB Output is correct
13 Correct 15 ms 9796 KB Output is correct
14 Correct 12 ms 8824 KB Output is correct
15 Correct 9 ms 8056 KB Output is correct
16 Correct 10 ms 8440 KB Output is correct
17 Correct 13 ms 8952 KB Output is correct
18 Correct 10 ms 8312 KB Output is correct
19 Correct 11 ms 9336 KB Output is correct
20 Correct 353 ms 11744 KB Output is correct
21 Correct 346 ms 11296 KB Output is correct
22 Correct 351 ms 11768 KB Output is correct
23 Correct 348 ms 11264 KB Output is correct
24 Correct 783 ms 404476 KB Output is correct
25 Correct 927 ms 404160 KB Output is correct
26 Correct 923 ms 405240 KB Output is correct
27 Correct 975 ms 458816 KB Output is correct
28 Correct 812 ms 458668 KB Output is correct
29 Correct 933 ms 459056 KB Output is correct
30 Correct 982 ms 457540 KB Output is correct
31 Correct 955 ms 441872 KB Output is correct
32 Correct 943 ms 457932 KB Output is correct
33 Correct 700 ms 363896 KB Output is correct
34 Correct 752 ms 348184 KB Output is correct
35 Correct 643 ms 363884 KB Output is correct
36 Correct 809 ms 413376 KB Output is correct
37 Correct 769 ms 394200 KB Output is correct
38 Correct 840 ms 413560 KB Output is correct
39 Correct 1113 ms 400184 KB Output is correct
40 Correct 945 ms 402648 KB Output is correct
41 Correct 947 ms 403064 KB Output is correct
42 Correct 940 ms 402048 KB Output is correct
43 Correct 936 ms 401944 KB Output is correct
44 Correct 438 ms 12536 KB Output is correct
45 Correct 372 ms 12152 KB Output is correct
46 Correct 370 ms 12040 KB Output is correct
47 Correct 356 ms 12032 KB Output is correct
48 Correct 350 ms 12120 KB Output is correct
49 Execution timed out 2092 ms 458460 KB Time limit exceeded
50 Halted 0 ms 0 KB -