oj.uz

Submission #698404

# Submission time Handle Problem Language Result Execution time Memory
698404 2023-02-13T11:17:21 Z emptypringlescan Alternating Heights (CCO22_day1problem1) C++17
17 / 25
 1000 ms 4432 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
vector<int> adj[3005];
bool cyc=false,v[3005],isdoing[3005];
void dfs(int x){
	v[x]=1;
	isdoing[x]=1;
	for(int i:adj[x]){
		if(isdoing[i]) cyc=true;
		else if(!v[i]) dfs(i);
	}
	isdoing[x]=0;
}
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n,k,q;
	cin >> n >> k >> q;
	int arr[n];
	for(int i=0; i<n; i++) cin >> arr[i];
	int prec[n];
	for(int i=0; i<n; i++){
		int lo=i,hi=n-1,mid;
		while(lo<hi){
			mid=(lo+hi+1)/2;
			int ev=0;
			for(int j=0; j<=k; j++){
				adj[j].clear();
				v[j]=0;
				isdoing[j]=0;
			}
			for(int j=i+1; j<=mid; j++){
				if(ev){
					adj[arr[j]].push_back(arr[j-1]);
				}
				else{
					adj[arr[j-1]].push_back(arr[j]);
				}
				ev^=1;
			}
			cyc=false;
			for(int j=i; j<=mid; j++){
				if(!v[arr[j]]) dfs(arr[j]);
			}
			//cout << i << ' ' << mid << ' ' << cyc << ' ' << found << '\n';
			if(cyc){
				hi=mid-1;
			}
			else lo=mid;
		}
		prec[i]=lo;
		//cout << lo << ' ';
	}
	for(int i=0; i<q; i++){
		int a,b;
		cin >> a >> b;
		a--; b--;
		if(b<=prec[a]) cout << "YES\n";
		else cout << "NO\n";
	}
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 187 ms 3368 KB Output is correct
2 Correct 186 ms 3320 KB Output is correct
3 Correct 188 ms 3368 KB Output is correct
4 Correct 112 ms 3308 KB Output is correct
5 Correct 133 ms 3488 KB Output is correct
6 Correct 187 ms 3316 KB Output is correct
7 Correct 207 ms 3412 KB Output is correct
8 Correct 187 ms 3460 KB Output is correct
9 Correct 206 ms 3492 KB Output is correct
10 Correct 338 ms 3916 KB Output is correct
11 Correct 532 ms 4348 KB Output is correct
12 Correct 505 ms 4300 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 3408 KB Output is correct
2 Correct 139 ms 3396 KB Output is correct
3 Correct 140 ms 3324 KB Output is correct
4 Correct 114 ms 4308 KB Output is correct
5 Correct 131 ms 3564 KB Output is correct
6 Correct 141 ms 3568 KB Output is correct
7 Correct 138 ms 3404 KB Output is correct
8 Correct 138 ms 3412 KB Output is correct
9 Correct 150 ms 3736 KB Output is correct
10 Correct 151 ms 4312 KB Output is correct
11 Correct 149 ms 4300 KB Output is correct
12 Correct 0 ms 340 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 359 ms 460 KB Output is correct
3 Correct 418 ms 432 KB Output is correct
4 Correct 41 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 292 ms 340 KB Output is correct
8 Correct 534 ms 452 KB Output is correct
9 Correct 745 ms 448 KB Output is correct
10 Correct 771 ms 560 KB Output is correct
11 Correct 885 ms 588 KB Output is correct
12 Correct 685 ms 444 KB Output is correct

Subtask #4
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 187 ms 3368 KB Output is correct
2 Correct 186 ms 3320 KB Output is correct
3 Correct 188 ms 3368 KB Output is correct
4 Correct 112 ms 3308 KB Output is correct
5 Correct 133 ms 3488 KB Output is correct
6 Correct 187 ms 3316 KB Output is correct
7 Correct 207 ms 3412 KB Output is correct
8 Correct 187 ms 3460 KB Output is correct
9 Correct 206 ms 3492 KB Output is correct
10 Correct 338 ms 3916 KB Output is correct
11 Correct 532 ms 4348 KB Output is correct
12 Correct 505 ms 4300 KB Output is correct
13 Correct 143 ms 3408 KB Output is correct
14 Correct 139 ms 3396 KB Output is correct
15 Correct 140 ms 3324 KB Output is correct
16 Correct 114 ms 4308 KB Output is correct
17 Correct 131 ms 3564 KB Output is correct
18 Correct 141 ms 3568 KB Output is correct
19 Correct 138 ms 3404 KB Output is correct
20 Correct 138 ms 3412 KB Output is correct
21 Correct 150 ms 3736 KB Output is correct
22 Correct 151 ms 4312 KB Output is correct
23 Correct 149 ms 4300 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 359 ms 460 KB Output is correct
27 Correct 418 ms 432 KB Output is correct
28 Correct 41 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 292 ms 340 KB Output is correct
32 Correct 534 ms 452 KB Output is correct
33 Correct 745 ms 448 KB Output is correct
34 Correct 771 ms 560 KB Output is correct
35 Correct 885 ms 588 KB Output is correct
36 Correct 685 ms 444 KB Output is correct
37 Correct 652 ms 4044 KB Output is correct
38 Correct 518 ms 3888 KB Output is correct
39 Correct 191 ms 3320 KB Output is correct
40 Correct 109 ms 4356 KB Output is correct
41 Correct 137 ms 3888 KB Output is correct
42 Correct 530 ms 3888 KB Output is correct
43 Correct 794 ms 4432 KB Output is correct
44 Correct 469 ms 4044 KB Output is correct
45 Execution timed out 1014 ms 4384 KB Time limit exceeded
46 Halted 0 ms 0 KB -