# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
373006 | sam571128 | Magenta (COCI21_magenta) | C++14 | 95 ms | 11244 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>
#define int long long
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int N = 1e5+5;
vector<pair<int,int>> adj[N]; //u -> {v,0/1/2} => 0->blue, 1->red, 2-> magenta
int dis[N][2], can[N][2], cnt = 0, ok = 0, hunter;
bool blue,red;
int a,b, len;
void dfs(int u, int c, int par){
for(auto [v,cc] : adj[u]){
if(v==par) continue;
if(v==b) len = dis[u][c] + 1;
if(cc==(c^1)) continue;
dis[v][c] = dis[u][c]+1;
dfs(v,c,u);
}
}
void dfs2(int u, int par){
for(auto [v,cc] : adj[u]){
if(v==par||cc==hunter||(dis[v][hunter]!=-1&&dis[v][hunter] <= dis[v][hunter^1])) continue;
if(dis[u][hunter]==-1&&dis[v][hunter]==-1) ok = 1;
dfs2(v,u);
}
}
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... |