oj.uz

Submission #383395

# Submission time Handle Problem Language Result Execution time Memory
383395 2021-03-29T19:54:03 Z Leonardo_Paes Bitaro’s Party (JOI18_bitaro) C++17
14 / 100
 79 ms 6636 KB 
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5+10;
int ans[maxn];
bool chegay[maxn];
vector<int> grafo[maxn];

int main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	int n, m, q;
	cin >> n >> m >> q;
	for(int i=1; i<=m; i++){
		int u, v;
		cin >> u >> v;
		grafo[u].push_back(v);
	}
	int t, y;
	cin >> t >> y;
	vector<bool> mark(n+1, 1);
	for(int i=0; i<y; i++){
		int x;
		cin >> x;
		mark[x] = 0;
	}
	memset(ans, -1, sizeof ans);
	ans[t] = 0;
	chegay[t] = 1;
	for(int u=t-1; u>=1; u--){
		for(int v : grafo[u]){
			if(v > t) continue;
			chegay[u] |= chegay[v];
			if(chegay[v]) ans[u] = max(ans[u], ans[v]);
		}
		if(chegay[u]) ++ans[u];
	}
	int tfg = -1;
	for(int i=1; i<=n; i++){
		if(mark[i]) tfg = max(tfg, ans[i]);
	}
	cout << tfg << "\n";
	return 0;
}

Subtask #1
7.0 / 7.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3052 KB Output is correct
2 Correct 3 ms 3052 KB Output is correct
3 Correct 3 ms 3052 KB Output is correct
4 Correct 3 ms 3052 KB Output is correct
5 Correct 3 ms 3052 KB Output is correct
6 Correct 3 ms 3052 KB Output is correct
7 Correct 3 ms 3052 KB Output is correct
8 Correct 3 ms 3052 KB Output is correct
9 Correct 3 ms 3052 KB Output is correct
10 Correct 3 ms 3052 KB Output is correct
11 Correct 3 ms 3052 KB Output is correct
12 Correct 3 ms 3052 KB Output is correct
13 Correct 3 ms 3052 KB Output is correct
14 Correct 3 ms 3052 KB Output is correct
15 Correct 3 ms 3052 KB Output is correct
16 Correct 3 ms 3052 KB Output is correct
17 Correct 3 ms 3052 KB Output is correct
18 Correct 3 ms 3052 KB Output is correct
19 Correct 3 ms 3052 KB Output is correct
20 Correct 36 ms 4272 KB Output is correct
21 Correct 35 ms 4332 KB Output is correct
22 Correct 35 ms 4352 KB Output is correct
23 Correct 45 ms 4332 KB Output is correct
24 Correct 68 ms 5580 KB Output is correct
25 Correct 62 ms 5484 KB Output is correct
26 Correct 61 ms 5484 KB Output is correct
27 Correct 60 ms 6508 KB Output is correct
28 Correct 61 ms 6508 KB Output is correct
29 Correct 64 ms 6636 KB Output is correct
30 Correct 59 ms 5868 KB Output is correct
31 Correct 64 ms 5868 KB Output is correct
32 Correct 62 ms 5868 KB Output is correct
33 Correct 65 ms 6252 KB Output is correct
34 Correct 79 ms 6380 KB Output is correct
35 Correct 61 ms 6380 KB Output is correct
36 Correct 60 ms 6636 KB Output is correct
37 Correct 64 ms 6508 KB Output is correct
38 Correct 70 ms 6508 KB Output is correct

Subtask #3
0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3052 KB Output is correct
2 Correct 3 ms 3052 KB Output is correct
3 Correct 3 ms 3052 KB Output is correct
4 Correct 3 ms 3052 KB Output is correct
5 Correct 3 ms 3052 KB Output is correct
6 Correct 3 ms 3052 KB Output is correct
7 Correct 3 ms 3052 KB Output is correct
8 Correct 3 ms 3052 KB Output is correct
9 Correct 3 ms 3052 KB Output is correct
10 Correct 3 ms 3052 KB Output is correct
11 Correct 3 ms 3052 KB Output is correct
12 Correct 3 ms 3052 KB Output is correct
13 Correct 3 ms 3052 KB Output is correct
14 Correct 3 ms 3052 KB Output is correct
15 Correct 3 ms 3052 KB Output is correct
16 Correct 3 ms 3052 KB Output is correct
17 Correct 3 ms 3052 KB Output is correct
18 Correct 3 ms 3052 KB Output is correct
19 Correct 3 ms 3052 KB Output is correct
20 Correct 36 ms 4272 KB Output is correct
21 Correct 35 ms 4332 KB Output is correct
22 Correct 35 ms 4352 KB Output is correct
23 Correct 45 ms 4332 KB Output is correct
24 Correct 68 ms 5580 KB Output is correct
25 Correct 62 ms 5484 KB Output is correct
26 Correct 61 ms 5484 KB Output is correct
27 Correct 60 ms 6508 KB Output is correct
28 Correct 61 ms 6508 KB Output is correct
29 Correct 64 ms 6636 KB Output is correct
30 Correct 59 ms 5868 KB Output is correct
31 Correct 64 ms 5868 KB Output is correct
32 Correct 62 ms 5868 KB Output is correct
33 Correct 65 ms 6252 KB Output is correct
34 Correct 79 ms 6380 KB Output is correct
35 Correct 61 ms 6380 KB Output is correct
36 Correct 60 ms 6636 KB Output is correct
37 Correct 64 ms 6508 KB Output is correct
38 Correct 70 ms 6508 KB Output is correct
39 Incorrect 62 ms 5612 KB Output isn't correct
40 Halted 0 ms 0 KB -