oj.uz

Submission #972752

# Submission time Handle Problem Language Result Execution time Memory
972752 2024-05-01T05:49:30 Z tamir1 Game (APIO22_game) C++17
30 / 100
 15 ms 2960 KB 
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
bitset<1001> vis[30001];
vector<int> v[30001];
int N,K;
void init(int n, int k) {
	N=n;
	K=k;
	for(int i=0;i<k-1;i++){
		v[i].push_back(i+1);
		vis[i][i]=1;
	}
	vis[k-1][k-1]=1;
}
queue<int> q;
int add_teleporter(int x, int y) {
	v[x].push_back(y);
	for(int i=K-1;i>=0;i--){
		if(!vis[i][x]) continue;
		q.push(x);
		vis[i][x]=1;
		while(!q.empty()){
			int a=q.front();
			q.pop();
			for(int j:v[a]){
				if(j<=i) return 1;
				if(!vis[i][j]){
					vis[i][j]=1;
					q.push(j);
				}
			}
		}
	}
	return 0;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2648 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct
6 Correct 1 ms 2648 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2648 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct
6 Correct 1 ms 2648 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2648 KB Output is correct
9 Correct 1 ms 2648 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2900 KB Output is correct
12 Correct 1 ms 2648 KB Output is correct
13 Correct 1 ms 2648 KB Output is correct
14 Correct 1 ms 2648 KB Output is correct
15 Correct 1 ms 2648 KB Output is correct
16 Correct 1 ms 2648 KB Output is correct
17 Correct 1 ms 2648 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 2 ms 2908 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 1 ms 2808 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 9 ms 2648 KB Output is correct
25 Correct 7 ms 2908 KB Output is correct
26 Correct 4 ms 2908 KB Output is correct
27 Correct 15 ms 2960 KB Output is correct
28 Correct 3 ms 2652 KB Output is correct
29 Correct 9 ms 2712 KB Output is correct

Subtask #4
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2648 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct
6 Correct 1 ms 2648 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2648 KB Output is correct
9 Correct 1 ms 2648 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2900 KB Output is correct
12 Correct 1 ms 2648 KB Output is correct
13 Correct 1 ms 2648 KB Output is correct
14 Correct 1 ms 2648 KB Output is correct
15 Correct 1 ms 2648 KB Output is correct
16 Correct 1 ms 2648 KB Output is correct
17 Correct 1 ms 2648 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 2 ms 2908 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 1 ms 2808 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 9 ms 2648 KB Output is correct
25 Correct 7 ms 2908 KB Output is correct
26 Correct 4 ms 2908 KB Output is correct
27 Correct 15 ms 2960 KB Output is correct
28 Correct 3 ms 2652 KB Output is correct
29 Correct 9 ms 2712 KB Output is correct
30 Incorrect 3 ms 2908 KB Wrong Answer[1]
31 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 1 ms 2648 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct
6 Correct 1 ms 2648 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2648 KB Output is correct
9 Correct 1 ms 2648 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2900 KB Output is correct
12 Correct 1 ms 2648 KB Output is correct
13 Correct 1 ms 2648 KB Output is correct
14 Correct 1 ms 2648 KB Output is correct
15 Correct 1 ms 2648 KB Output is correct
16 Correct 1 ms 2648 KB Output is correct
17 Correct 1 ms 2648 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 2 ms 2908 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 1 ms 2808 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 9 ms 2648 KB Output is correct
25 Correct 7 ms 2908 KB Output is correct
26 Correct 4 ms 2908 KB Output is correct
27 Correct 15 ms 2960 KB Output is correct
28 Correct 3 ms 2652 KB Output is correct
29 Correct 9 ms 2712 KB Output is correct
30 Incorrect 3 ms 2908 KB Wrong Answer[1]
31 Halted 0 ms 0 KB -