# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
156095 | HungAnhGoldIBO2020 | 전압 (JOI14_voltage) | C++14 | 144 ms | 18808 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<iostream>
#include<vector>
#include<algorithm>
const int N=2e5+2;
using namespace std;
vector<int> adj[N],lis1;
int cnt[N][3],color[N],level[N],numno=0,ans=0;
vector<pair<int,int> > lis;
bool used[N];
bool dfs(int x,bool valid){
bool scare=valid,cac;
for(int i=0;i<adj[x].size();i++){
if(!color[adj[x][i]]){
color[adj[x][i]]=3-color[x];
if(scare){
scare=dfs(adj[x][i],scare);
}
else{
cac=dfs(adj[x][i],scare);
}
}
else{
if(color[adj[x][i]]!=3-color[x]){
scare=false;
}
}
}
return scare;
}
void dfs1(int x,int p){
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... |