# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
973901 | 2024-05-02T12:35:48 Z | SeenSiravit | Alternating Heights (CCO22_day1problem1) | C++14 | 1000 ms | 12928 KB |
#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; dfs(a[l]); if(!valid){ ans[l] = r; break; } } } // for(int i=1;i<=n;i++) cout<< ans[i] << " "; while(q--){ int l,r; scanf("%d %d" , &l , &r); cout<< (ans[l]<=r ? "NO" : "YES") << "\n"; } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 176 ms | 8188 KB | Output is correct |
2 | Correct | 188 ms | 12928 KB | Output is correct |
3 | Correct | 193 ms | 12828 KB | Output is correct |
4 | Correct | 171 ms | 7372 KB | Output is correct |
5 | Correct | 161 ms | 9456 KB | Output is correct |
6 | Correct | 177 ms | 12888 KB | Output is correct |
7 | Correct | 183 ms | 12752 KB | Output is correct |
8 | Correct | 184 ms | 12900 KB | Output is correct |
9 | Correct | 349 ms | 12776 KB | Output is correct |
10 | Execution timed out | 1032 ms | 348 KB | Time limit exceeded |
11 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 175 ms | 3696 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Execution timed out | 1094 ms | 564 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 176 ms | 8188 KB | Output is correct |
2 | Correct | 188 ms | 12928 KB | Output is correct |
3 | Correct | 193 ms | 12828 KB | Output is correct |
4 | Correct | 171 ms | 7372 KB | Output is correct |
5 | Correct | 161 ms | 9456 KB | Output is correct |
6 | Correct | 177 ms | 12888 KB | Output is correct |
7 | Correct | 183 ms | 12752 KB | Output is correct |
8 | Correct | 184 ms | 12900 KB | Output is correct |
9 | Correct | 349 ms | 12776 KB | Output is correct |
10 | Execution timed out | 1032 ms | 348 KB | Time limit exceeded |
11 | Halted | 0 ms | 0 KB | - |