# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
710417 | emptypringlescan | Stray Cat (JOI20_stray) | C++17 | 58 ms | 16916 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;
vector<pair<int,int> > adj[20005],tadj[20005];
int ans[20005];
bool start=false;
int turn=0;
string s="101001";
void dfs(int x, int p, int c, int e){
int child=0;
for(auto i:tadj[x]){
if(i.first==p) continue;
child++;
}
if(child>1){
start=false;
turn=0;
for(auto i:tadj[x]){
if(i.first==p) continue;
ans[i.second]=1-c;
dfs(i.first,x,1-c,i.second);
}
}
else if(child==1){
if(!start){
start=true;
turn=1;
if(e!=-1&&ans[e]==1) turn=0;
else turn=2;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |