# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
973908 | SeenSiravit | Alternating Heights (CCO22_day1problem1) | C++14 | 1072 ms | 12116 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
const int mxN = 3e3 + 5;
int n,k,q;
int a[mxN];
int ans[mxN];
vector<int> g[mxN];
int vis[mxN];
bool valid;
void dfs(int u){
vis[u] = 1;
for(auto v : g[u]){
if(vis[v] == 2) continue;
else if(vis[v] == 1){
valid = false;
return ;
}else{
dfs(v);
if(!valid) return ;
}
}
vis[u] = 2;
}
int main(){
scanf("%d %d %d",&n,&k,&q);
for(int i=1;i<=n;i++) scanf("%d",a+i);
for(int i=1;i<=n;i++) ans[i] = n + 1;
for(int l=1;l<=n;l++){
for(int r=l+1;r<=n;r++){
// clear edge and reset vis value
for(int i=1;i<=k;i++) g[i].clear() , vis[i] = 0;
// add edge
int t = 1;
for(int i=l;i<r;i++){
if(t == 1) g[a[i]].push_back(a[i+1]);
else g[a[i+1]].push_back(a[i]);
t ^= 1;
}
valid = true;
for(int i=l;i<=r;i++){
if(vis[a[i]] == 0){
dfs(a[i]);
if(!valid) break;
}
}
if(!valid){
ans[l] = r;
break;
}
}
}
// for(int i=1;i<=n;i++) printf("%d " , ans[i]);
// printf("\n");
while(q--){
int l,r;
scanf("%d %d" , &l , &r);
cout<< (ans[l]<=r ? "NO" : "YES") << "\n";
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |