oj.uz

Submission #95081

# Submission time Handle Problem Language Result Execution time Memory
95081 2019-01-27T07:52:29 Z ImaniAm Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 2000 ms 458204 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);
	}
	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 (se + se2 > sq) {
				for (int j = 0, t = se + se2 - sq; j < sq; ++j)
					vec[j] = vec[j + t];
				vec.resize(sq);
			}
			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 6 ms 5368 KB Output is correct
4 Correct 6 ms 5468 KB Output is correct
5 Correct 12 ms 8440 KB Output is correct
6 Correct 10 ms 8568 KB Output is correct
7 Correct 11 ms 8440 KB Output is correct
8 Correct 11 ms 9464 KB Output is correct
9 Correct 13 ms 9464 KB Output is correct
10 Correct 14 ms 9976 KB Output is correct
11 Correct 12 ms 9336 KB Output is correct
12 Correct 11 ms 8440 KB Output is correct
13 Correct 13 ms 9720 KB Output is correct
14 Correct 5 ms 8824 KB Output is correct
15 Correct 10 ms 8056 KB Output is correct
16 Correct 11 ms 8440 KB Output is correct
17 Correct 12 ms 8952 KB Output is correct
18 Correct 11 ms 8312 KB Output is correct
19 Correct 12 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 6 ms 5368 KB Output is correct
4 Correct 6 ms 5468 KB Output is correct
5 Correct 12 ms 8440 KB Output is correct
6 Correct 10 ms 8568 KB Output is correct
7 Correct 11 ms 8440 KB Output is correct
8 Correct 11 ms 9464 KB Output is correct
9 Correct 13 ms 9464 KB Output is correct
10 Correct 14 ms 9976 KB Output is correct
11 Correct 12 ms 9336 KB Output is correct
12 Correct 11 ms 8440 KB Output is correct
13 Correct 13 ms 9720 KB Output is correct
14 Correct 5 ms 8824 KB Output is correct
15 Correct 10 ms 8056 KB Output is correct
16 Correct 11 ms 8440 KB Output is correct
17 Correct 12 ms 8952 KB Output is correct
18 Correct 11 ms 8312 KB Output is correct
19 Correct 12 ms 9336 KB Output is correct
20 Correct 261 ms 11792 KB Output is correct
21 Correct 264 ms 11272 KB Output is correct
22 Correct 262 ms 11768 KB Output is correct
23 Correct 257 ms 11256 KB Output is correct
24 Correct 935 ms 403980 KB Output is correct
25 Correct 919 ms 403324 KB Output is correct
26 Correct 863 ms 404436 KB Output is correct
27 Correct 934 ms 458204 KB Output is correct
28 Correct 905 ms 457824 KB Output is correct
29 Correct 931 ms 458036 KB Output is correct
30 Correct 785 ms 456692 KB Output is correct
31 Correct 775 ms 441316 KB Output is correct
32 Correct 759 ms 457648 KB Output is correct
33 Correct 608 ms 363640 KB Output is correct
34 Correct 580 ms 347724 KB Output is correct
35 Correct 583 ms 363256 KB Output is correct
36 Correct 677 ms 412816 KB Output is correct
37 Correct 680 ms 393544 KB Output is correct
38 Correct 712 ms 412824 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 6 ms 5368 KB Output is correct
4 Correct 6 ms 5468 KB Output is correct
5 Correct 12 ms 8440 KB Output is correct
6 Correct 10 ms 8568 KB Output is correct
7 Correct 11 ms 8440 KB Output is correct
8 Correct 11 ms 9464 KB Output is correct
9 Correct 13 ms 9464 KB Output is correct
10 Correct 14 ms 9976 KB Output is correct
11 Correct 12 ms 9336 KB Output is correct
12 Correct 11 ms 8440 KB Output is correct
13 Correct 13 ms 9720 KB Output is correct
14 Correct 5 ms 8824 KB Output is correct
15 Correct 10 ms 8056 KB Output is correct
16 Correct 11 ms 8440 KB Output is correct
17 Correct 12 ms 8952 KB Output is correct
18 Correct 11 ms 8312 KB Output is correct
19 Correct 12 ms 9336 KB Output is correct
20 Correct 261 ms 11792 KB Output is correct
21 Correct 264 ms 11272 KB Output is correct
22 Correct 262 ms 11768 KB Output is correct
23 Correct 257 ms 11256 KB Output is correct
24 Correct 935 ms 403980 KB Output is correct
25 Correct 919 ms 403324 KB Output is correct
26 Correct 863 ms 404436 KB Output is correct
27 Correct 934 ms 458204 KB Output is correct
28 Correct 905 ms 457824 KB Output is correct
29 Correct 931 ms 458036 KB Output is correct
30 Correct 785 ms 456692 KB Output is correct
31 Correct 775 ms 441316 KB Output is correct
32 Correct 759 ms 457648 KB Output is correct
33 Correct 608 ms 363640 KB Output is correct
34 Correct 580 ms 347724 KB Output is correct
35 Correct 583 ms 363256 KB Output is correct
36 Correct 677 ms 412816 KB Output is correct
37 Correct 680 ms 393544 KB Output is correct
38 Correct 712 ms 412824 KB Output is correct
39 Correct 873 ms 399616 KB Output is correct
40 Correct 798 ms 402176 KB Output is correct
41 Correct 789 ms 402424 KB Output is correct
42 Correct 837 ms 401732 KB Output is correct
43 Correct 719 ms 401684 KB Output is correct
44 Correct 344 ms 12124 KB Output is correct
45 Correct 287 ms 11896 KB Output is correct
46 Correct 276 ms 11768 KB Output is correct
47 Correct 275 ms 11640 KB Output is correct
48 Correct 260 ms 11664 KB Output is correct
49 Execution timed out 2082 ms 457916 KB Time limit exceeded
50 Halted 0 ms 0 KB -