oj.uz

Submission #66980

# Submission time Handle Problem Language Result Execution time Memory
66980 2018-08-13T06:16:57 Z szawinis Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 1299 ms 240672 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+1, INF = 1e9+1;

int n, m, q, bsz = 100;
vector<int> g[N];
vector<pair<int,int> > dp[N];
bool blocked[N];
int f[N];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> m >> q;
	for(int i = 0, s, e; i < m; i++) {
		cin >> s >> e;
		--s, --e;
		g[e].push_back(s);
	}
	dp[0].emplace_back(0, 0);
	for(int i = 1; i < n; i++) {
		dp[i].emplace_back(0, i);
		for(int j: g[i]) for(auto x: dp[j]) dp[i].emplace_back(x.first + 1, x.second);
		nth_element(dp[i].begin(), dp[i].begin() + min(bsz, (int) dp[i].size()), dp[i].end());
		dp[i].resize(min(bsz, (int) dp[i].size()));
	}
	while(q--) {
		int targ, Y;
		cin >> targ >> Y;
		--targ;
		vector<int> C(Y);
		for(int i = 0; i < Y; i++) {
			cin >> C[i];
			--C[i];
			blocked[C[i]] = true;
		}
		int res = -INF;
		if(Y < bsz) {
			for(auto p: dp[targ]) if(!blocked[p.second]) res = max(p.first, res);
		} else {
			fill(f, f+targ+1, 0);
			for(int i: C) f[i] = -INF;
			for(int i = 0; i <= targ; i++) {
				for(int j: g[i]) f[i] = max(f[j] + 1, f[i]);
				if(f[i] < 0) f[i] = -INF;
			}
			res = f[targ];
		}
		if(res == -INF) cout << -1;
		else cout << res;
		cout << '\n';
		for(int i = 0; i < Y; i++) blocked[C[i]] = false;
	}
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 7 ms 5108 KB Output is correct
3 Correct 6 ms 5380 KB Output is correct
4 Correct 6 ms 5380 KB Output is correct
5 Correct 13 ms 6668 KB Output is correct
6 Correct 12 ms 6668 KB Output is correct
7 Correct 16 ms 6668 KB Output is correct
8 Correct 17 ms 7460 KB Output is correct
9 Correct 17 ms 7588 KB Output is correct
10 Correct 16 ms 7588 KB Output is correct
11 Correct 15 ms 7588 KB Output is correct
12 Correct 15 ms 7588 KB Output is correct
13 Correct 16 ms 7588 KB Output is correct
14 Correct 12 ms 7588 KB Output is correct
15 Correct 10 ms 7588 KB Output is correct
16 Correct 14 ms 7588 KB Output is correct
17 Correct 14 ms 7588 KB Output is correct
18 Correct 13 ms 7588 KB Output is correct
19 Correct 15 ms 7588 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 7 ms 5108 KB Output is correct
3 Correct 6 ms 5380 KB Output is correct
4 Correct 6 ms 5380 KB Output is correct
5 Correct 13 ms 6668 KB Output is correct
6 Correct 12 ms 6668 KB Output is correct
7 Correct 16 ms 6668 KB Output is correct
8 Correct 17 ms 7460 KB Output is correct
9 Correct 17 ms 7588 KB Output is correct
10 Correct 16 ms 7588 KB Output is correct
11 Correct 15 ms 7588 KB Output is correct
12 Correct 15 ms 7588 KB Output is correct
13 Correct 16 ms 7588 KB Output is correct
14 Correct 12 ms 7588 KB Output is correct
15 Correct 10 ms 7588 KB Output is correct
16 Correct 14 ms 7588 KB Output is correct
17 Correct 14 ms 7588 KB Output is correct
18 Correct 13 ms 7588 KB Output is correct
19 Correct 15 ms 7588 KB Output is correct
20 Correct 556 ms 163288 KB Output is correct
21 Correct 560 ms 163428 KB Output is correct
22 Correct 505 ms 163428 KB Output is correct
23 Correct 556 ms 164068 KB Output is correct
24 Correct 1041 ms 186860 KB Output is correct
25 Correct 929 ms 187376 KB Output is correct
26 Correct 1008 ms 187500 KB Output is correct
27 Correct 1008 ms 238272 KB Output is correct
28 Correct 993 ms 238484 KB Output is correct
29 Correct 1006 ms 239868 KB Output is correct
30 Correct 989 ms 240232 KB Output is correct
31 Correct 941 ms 240232 KB Output is correct
32 Correct 985 ms 240672 KB Output is correct
33 Correct 632 ms 240672 KB Output is correct
34 Correct 615 ms 240672 KB Output is correct
35 Correct 701 ms 240672 KB Output is correct
36 Correct 946 ms 240672 KB Output is correct
37 Correct 836 ms 240672 KB Output is correct
38 Correct 962 ms 240672 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4984 KB Output is correct
2 Correct 7 ms 5108 KB Output is correct
3 Correct 6 ms 5380 KB Output is correct
4 Correct 6 ms 5380 KB Output is correct
5 Correct 13 ms 6668 KB Output is correct
6 Correct 12 ms 6668 KB Output is correct
7 Correct 16 ms 6668 KB Output is correct
8 Correct 17 ms 7460 KB Output is correct
9 Correct 17 ms 7588 KB Output is correct
10 Correct 16 ms 7588 KB Output is correct
11 Correct 15 ms 7588 KB Output is correct
12 Correct 15 ms 7588 KB Output is correct
13 Correct 16 ms 7588 KB Output is correct
14 Correct 12 ms 7588 KB Output is correct
15 Correct 10 ms 7588 KB Output is correct
16 Correct 14 ms 7588 KB Output is correct
17 Correct 14 ms 7588 KB Output is correct
18 Correct 13 ms 7588 KB Output is correct
19 Correct 15 ms 7588 KB Output is correct
20 Correct 556 ms 163288 KB Output is correct
21 Correct 560 ms 163428 KB Output is correct
22 Correct 505 ms 163428 KB Output is correct
23 Correct 556 ms 164068 KB Output is correct
24 Correct 1041 ms 186860 KB Output is correct
25 Correct 929 ms 187376 KB Output is correct
26 Correct 1008 ms 187500 KB Output is correct
27 Correct 1008 ms 238272 KB Output is correct
28 Correct 993 ms 238484 KB Output is correct
29 Correct 1006 ms 239868 KB Output is correct
30 Correct 989 ms 240232 KB Output is correct
31 Correct 941 ms 240232 KB Output is correct
32 Correct 985 ms 240672 KB Output is correct
33 Correct 632 ms 240672 KB Output is correct
34 Correct 615 ms 240672 KB Output is correct
35 Correct 701 ms 240672 KB Output is correct
36 Correct 946 ms 240672 KB Output is correct
37 Correct 836 ms 240672 KB Output is correct
38 Correct 962 ms 240672 KB Output is correct
39 Incorrect 1299 ms 240672 KB Output isn't correct
40 Halted 0 ms 0 KB -