# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
858812 | iskhakkutbilim | Joker (BOI20_joker) | C++17 | 2092 ms | 24144 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;
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
const int N = 2e5;
vector<pair<int, int> > g[N+1];
int n, m, q, timer = 1;
int used[N+1], lens[N+1];
int Left, Right, ok;
vector< pair<int, int> > query;
void dfs(int v, int par){
if(ok) return;
used[v] = timer;
for(auto [to, idx] : g[v]){
if(used[to] == timer && (idx < Left or idx > Right) && to != par){
int len = lens[v] - lens[to] + 1;
if(len % 2 == 1){
ok = 1;
return;
}
}else if(used[to] < timer && (idx < Left or idx > Right)){
lens[to] = lens[v] + 1;
dfs(to, v);
}
}
used[v] = timer+1;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |