oj.uz

답안 #698399

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
698399 2023-02-13T11:04:34 Z emptypringlescan Alternating Heights (CCO22_day1problem1) C++17
17 / 25
 1000 ms 4944 KB 
#include <bits/stdc++.h>
using namespace std;
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;
}
int 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

# 결과 실행 시간 메모리 Grader output
1 Correct 197 ms 3856 KB Output is correct
2 Correct 193 ms 3916 KB Output is correct
3 Correct 193 ms 3912 KB Output is correct
4 Correct 110 ms 3896 KB Output is correct
5 Correct 128 ms 4068 KB Output is correct
6 Correct 197 ms 3920 KB Output is correct
7 Correct 190 ms 3900 KB Output is correct
8 Correct 190 ms 3844 KB Output is correct
9 Correct 221 ms 3976 KB Output is correct
10 Correct 326 ms 4404 KB Output is correct
11 Correct 509 ms 4944 KB Output is correct
12 Correct 485 ms 4916 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 141 ms 3964 KB Output is correct
2 Correct 140 ms 3852 KB Output is correct
3 Correct 144 ms 3708 KB Output is correct
4 Correct 112 ms 4696 KB Output is correct
5 Correct 161 ms 3892 KB Output is correct
6 Correct 142 ms 3740 KB Output is correct
7 Correct 152 ms 3904 KB Output is correct
8 Correct 139 ms 3788 KB Output is correct
9 Correct 154 ms 4220 KB Output is correct
10 Correct 150 ms 4784 KB Output is correct
11 Correct 166 ms 4668 KB Output is correct
12 Correct 1 ms 400 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 389 ms 604 KB Output is correct
3 Correct 453 ms 484 KB Output is correct
4 Correct 41 ms 340 KB Output is correct
5 Correct 1 ms 400 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 329 ms 468 KB Output is correct
8 Correct 595 ms 604 KB Output is correct
9 Correct 845 ms 484 KB Output is correct
10 Correct 890 ms 596 KB Output is correct
11 Correct 994 ms 492 KB Output is correct
12 Correct 765 ms 476 KB Output is correct

Subtask #4
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 197 ms 3856 KB Output is correct
2 Correct 193 ms 3916 KB Output is correct
3 Correct 193 ms 3912 KB Output is correct
4 Correct 110 ms 3896 KB Output is correct
5 Correct 128 ms 4068 KB Output is correct
6 Correct 197 ms 3920 KB Output is correct
7 Correct 190 ms 3900 KB Output is correct
8 Correct 190 ms 3844 KB Output is correct
9 Correct 221 ms 3976 KB Output is correct
10 Correct 326 ms 4404 KB Output is correct
11 Correct 509 ms 4944 KB Output is correct
12 Correct 485 ms 4916 KB Output is correct
13 Correct 141 ms 3964 KB Output is correct
14 Correct 140 ms 3852 KB Output is correct
15 Correct 144 ms 3708 KB Output is correct
16 Correct 112 ms 4696 KB Output is correct
17 Correct 161 ms 3892 KB Output is correct
18 Correct 142 ms 3740 KB Output is correct
19 Correct 152 ms 3904 KB Output is correct
20 Correct 139 ms 3788 KB Output is correct
21 Correct 154 ms 4220 KB Output is correct
22 Correct 150 ms 4784 KB Output is correct
23 Correct 166 ms 4668 KB Output is correct
24 Correct 1 ms 400 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 389 ms 604 KB Output is correct
27 Correct 453 ms 484 KB Output is correct
28 Correct 41 ms 340 KB Output is correct
29 Correct 1 ms 400 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 329 ms 468 KB Output is correct
32 Correct 595 ms 604 KB Output is correct
33 Correct 845 ms 484 KB Output is correct
34 Correct 890 ms 596 KB Output is correct
35 Correct 994 ms 492 KB Output is correct
36 Correct 765 ms 476 KB Output is correct
37 Correct 696 ms 4360 KB Output is correct
38 Correct 555 ms 4136 KB Output is correct
39 Correct 188 ms 3660 KB Output is correct
40 Correct 110 ms 4572 KB Output is correct
41 Correct 127 ms 4208 KB Output is correct
42 Correct 544 ms 4180 KB Output is correct
43 Correct 881 ms 4552 KB Output is correct
44 Correct 512 ms 4364 KB Output is correct
45 Execution timed out 1012 ms 1740 KB Time limit exceeded
46 Halted 0 ms 0 KB -