# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1093519 | 2024-09-27T02:01:01 Z | duyhoanho | Joker (BOI20_joker) | C++14 | 2000 ms | 15700 KB |
#include<bits/stdc++.h> #define int long long #define forinc(i,a,b) for(int i=a;i<=b;i++) #define fi first #define se second #define pii pair<int,int> #define pb push_back using namespace std; const int N = 2e5+10; int n,m,q,fre[N]; pii a[N]; vector<int> ad[N]; bool qu(int l,int r) { bool ok = 0; forinc(i,1,m) ad[i].clear(); forinc(i,1,m) { if(l<=i && i<=r) continue; int x,y; tie(x,y) = a[i]; ad[x].pb(y); ad[y].pb(x); } for(int i=1; i<=n; i++) fre[i] = -1; for(int i=1; i<=n; i++) { if(fre[i] == -1) { queue<int> q; q.push(i); fre[i] = 0; while(q.size()) { int u = q.front();q.pop(); for(int v:ad[u]) { if(fre[v] == fre[u]) return true; if(fre[v] != -1) continue; fre[v] = 1 - fre[u]; q.push(v); } } //if(ok == 1) return true; } } return false; } int32_t main() { if(fopen("task.inp","r")) { freopen("task.inp","r",stdin); freopen("task.out","w",stdout); } ios_base::sync_with_stdio(false); cin.tie(0); cin>>n>>m>>q; forinc(i,1,m) { int x,y; cin>>x>>y; a[i] = {x,y}; } while(q--) { int l,r; cin>>l>>r; cout<< (qu(l,r) ? "YES\n" : "NO\n"); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 4956 KB | Output is correct |
2 | Correct | 2 ms | 4956 KB | Output is correct |
3 | Correct | 2 ms | 4956 KB | Output is correct |
4 | Correct | 2 ms | 4956 KB | Output is correct |
5 | Correct | 3 ms | 4956 KB | Output is correct |
6 | Correct | 2 ms | 4956 KB | Output is correct |
7 | Incorrect | 4 ms | 5212 KB | Output isn't correct |
8 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 4956 KB | Output is correct |
2 | Correct | 2 ms | 4956 KB | Output is correct |
3 | Correct | 2 ms | 4956 KB | Output is correct |
4 | Correct | 2 ms | 4956 KB | Output is correct |
5 | Correct | 3 ms | 4956 KB | Output is correct |
6 | Correct | 2 ms | 4956 KB | Output is correct |
7 | Incorrect | 4 ms | 5212 KB | Output isn't correct |
8 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 4956 KB | Output is correct |
2 | Correct | 2 ms | 4956 KB | Output is correct |
3 | Execution timed out | 2015 ms | 15700 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 4956 KB | Output is correct |
2 | Correct | 2 ms | 4956 KB | Output is correct |
3 | Correct | 2 ms | 4956 KB | Output is correct |
4 | Correct | 2 ms | 4956 KB | Output is correct |
5 | Correct | 3 ms | 4956 KB | Output is correct |
6 | Correct | 2 ms | 4956 KB | Output is correct |
7 | Incorrect | 4 ms | 5212 KB | Output isn't correct |
8 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 4956 KB | Output is correct |
2 | Correct | 2 ms | 4956 KB | Output is correct |
3 | Correct | 2 ms | 4956 KB | Output is correct |
4 | Correct | 2 ms | 4956 KB | Output is correct |
5 | Correct | 3 ms | 4956 KB | Output is correct |
6 | Correct | 2 ms | 4956 KB | Output is correct |
7 | Incorrect | 4 ms | 5212 KB | Output isn't correct |
8 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 4956 KB | Output is correct |
2 | Correct | 2 ms | 4956 KB | Output is correct |
3 | Correct | 2 ms | 4956 KB | Output is correct |
4 | Correct | 2 ms | 4956 KB | Output is correct |
5 | Correct | 3 ms | 4956 KB | Output is correct |
6 | Correct | 2 ms | 4956 KB | Output is correct |
7 | Incorrect | 4 ms | 5212 KB | Output isn't correct |
8 | Halted | 0 ms | 0 KB | - |