| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 521896 | maks007 | Easter Eggs (info1cup17_eastereggs) | C++14 | 2 ms | 652 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>
#include "grader.h"
using namespace std;
vector <int> used;
vector <vector <int>> g;
int ans = 0;
int flag = 0;
void dfs(int v, int depth, int p){
if(flag) return;
used[v] = 1;
int f = 0;
for(int u : g[v]) {
if(!used[u]) {
dfs(u, depth^1, v);
f = 1;
}
if(flag) return;
}
if(!f or depth == 1) {
vector <int> q = {v, p};
if(query(q)) {
q.pop_back();
if(query(q)) {
ans = v;
}else ans = p;
flag = 1;
}
return;
}
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
used.resize(N, 0);
g.resize(N);
vector<int> deg(N, 0);
for(int i = 0; i < bridges.size(); i ++) {
int a = bridges[i].first;
int b = bridges[i].second;
g[a-1].push_back(b-1);
g[b-1].push_back(a-1);
deg[a]++;
deg[b]++;
}
flag = 0;
ans = 0;
for(int i= 0; i < used.size(); i ++) used[i] = 0;
dfs(0, 0, -1);
return ans;
}
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... | ||||
