oj.uz

Submission #58435

# Submission time Handle Problem Language Result Execution time Memory
58435 2018-07-17T20:14:35 Z ksun48 Bitaro’s Party (JOI18_bitaro) C++14
14 / 100
 2000 ms 13052 KB 
#include <bits/stdc++.h>
using namespace std;

const int SIZE = 1;

int main(){
	cin.sync_with_stdio(0); cin.tie(0);
	int n, m, q;
	cin >> n >> m >> q;
	vector<int> edges[n];
	for(int i = 0; i < m; i++){
		int s, e;
		cin >> s >> e;
		s--; e--;
		edges[e].push_back(s);
	}
	vector<pair<int,int> > best[n];
	vector<int> seen(n, 0);
	for(int b = 0; b < n; b++){
		vector<pair<int,int> > cand;
		cand.push_back({0,b});
		for(int a : edges[b]){
			for(pair<int,int> x : best[a]){
				cand.push_back({x.first + 1, x.second});
			}
		}
		sort(cand.begin(), cand.end());
		reverse(cand.begin(), cand.end());
		for(pair<int,int> x : cand){
			if(seen[x.second]) continue;
			if(best[b].size() > SIZE) break;
			seen[x.second] = 1;
			best[b].push_back(x);
		}
		for(pair<int,int> x : cand){
			seen[x.second] = 0;
		}
	}
	vector<int> attend(n, 1);
	vector<int> dp(n, -1);
	for(int qq = 0; qq < q; qq++){
		int town, y;
		cin >> town >> y;
		town--;
		vector<int> bad(y);
		for(int i = 0; i < y; i++){
			cin >> bad[i];
			bad[i]--;
			attend[bad[i]] = 0;
		}
		if(y < SIZE){
			int ans = -1;
			for(pair<int,int> x : best[town]){
				if(attend[x.second]){
					ans = x.first;
					break;
				}
			}
			cout << ans << '\n';
		} else {
			for(int b = 0; b < n; b++){
				dp[b] = -1;
			}
			for(int b = 0; b < n; b++){
				if(attend[b]){
					dp[b] = 0;
				}
				for(int a : edges[b]){
					if(dp[a] >= 0){
						dp[b] = max(dp[b], dp[a] + 1);
					}
				}
			}
			cout << dp[town] << '\n';
		}
		for(int i = 0; i < y; i++){
			attend[bad[i]] = 1;
		}
	}
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 392 KB Output is correct
4 Correct 2 ms 392 KB Output is correct
5 Correct 3 ms 436 KB Output is correct
6 Correct 4 ms 564 KB Output is correct
7 Correct 3 ms 612 KB Output is correct
8 Correct 3 ms 612 KB Output is correct
9 Correct 3 ms 660 KB Output is correct
10 Correct 3 ms 688 KB Output is correct
11 Correct 3 ms 716 KB Output is correct
12 Correct 2 ms 716 KB Output is correct
13 Correct 3 ms 716 KB Output is correct
14 Correct 3 ms 716 KB Output is correct
15 Correct 3 ms 716 KB Output is correct
16 Correct 3 ms 716 KB Output is correct
17 Correct 4 ms 716 KB Output is correct
18 Correct 3 ms 716 KB Output is correct
19 Correct 3 ms 748 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 392 KB Output is correct
4 Correct 2 ms 392 KB Output is correct
5 Correct 3 ms 436 KB Output is correct
6 Correct 4 ms 564 KB Output is correct
7 Correct 3 ms 612 KB Output is correct
8 Correct 3 ms 612 KB Output is correct
9 Correct 3 ms 660 KB Output is correct
10 Correct 3 ms 688 KB Output is correct
11 Correct 3 ms 716 KB Output is correct
12 Correct 2 ms 716 KB Output is correct
13 Correct 3 ms 716 KB Output is correct
14 Correct 3 ms 716 KB Output is correct
15 Correct 3 ms 716 KB Output is correct
16 Correct 3 ms 716 KB Output is correct
17 Correct 4 ms 716 KB Output is correct
18 Correct 3 ms 716 KB Output is correct
19 Correct 3 ms 748 KB Output is correct
20 Correct 69 ms 1916 KB Output is correct
21 Correct 73 ms 1916 KB Output is correct
22 Correct 67 ms 1916 KB Output is correct
23 Correct 68 ms 1916 KB Output is correct
24 Correct 187 ms 12588 KB Output is correct
25 Correct 209 ms 12724 KB Output is correct
26 Correct 148 ms 12724 KB Output is correct
27 Correct 133 ms 12924 KB Output is correct
28 Correct 159 ms 12964 KB Output is correct
29 Correct 162 ms 12964 KB Output is correct
30 Correct 136 ms 12964 KB Output is correct
31 Correct 145 ms 13028 KB Output is correct
32 Correct 142 ms 13052 KB Output is correct
33 Correct 134 ms 13052 KB Output is correct
34 Correct 145 ms 13052 KB Output is correct
35 Correct 154 ms 13052 KB Output is correct
36 Correct 155 ms 13052 KB Output is correct
37 Correct 164 ms 13052 KB Output is correct
38 Correct 165 ms 13052 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 392 KB Output is correct
4 Correct 2 ms 392 KB Output is correct
5 Correct 3 ms 436 KB Output is correct
6 Correct 4 ms 564 KB Output is correct
7 Correct 3 ms 612 KB Output is correct
8 Correct 3 ms 612 KB Output is correct
9 Correct 3 ms 660 KB Output is correct
10 Correct 3 ms 688 KB Output is correct
11 Correct 3 ms 716 KB Output is correct
12 Correct 2 ms 716 KB Output is correct
13 Correct 3 ms 716 KB Output is correct
14 Correct 3 ms 716 KB Output is correct
15 Correct 3 ms 716 KB Output is correct
16 Correct 3 ms 716 KB Output is correct
17 Correct 4 ms 716 KB Output is correct
18 Correct 3 ms 716 KB Output is correct
19 Correct 3 ms 748 KB Output is correct
20 Correct 69 ms 1916 KB Output is correct
21 Correct 73 ms 1916 KB Output is correct
22 Correct 67 ms 1916 KB Output is correct
23 Correct 68 ms 1916 KB Output is correct
24 Correct 187 ms 12588 KB Output is correct
25 Correct 209 ms 12724 KB Output is correct
26 Correct 148 ms 12724 KB Output is correct
27 Correct 133 ms 12924 KB Output is correct
28 Correct 159 ms 12964 KB Output is correct
29 Correct 162 ms 12964 KB Output is correct
30 Correct 136 ms 12964 KB Output is correct
31 Correct 145 ms 13028 KB Output is correct
32 Correct 142 ms 13052 KB Output is correct
33 Correct 134 ms 13052 KB Output is correct
34 Correct 145 ms 13052 KB Output is correct
35 Correct 154 ms 13052 KB Output is correct
36 Correct 155 ms 13052 KB Output is correct
37 Correct 164 ms 13052 KB Output is correct
38 Correct 165 ms 13052 KB Output is correct
39 Execution timed out 2056 ms 13052 KB Time limit exceeded
40 Halted 0 ms 0 KB -