| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 521889 | maks007 | Easter Eggs (info1cup17_eastereggs) | C++14 | 1 ms | 456 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> listt;
vector <int> used;
vector <vector <int> > g;
int f = 0;
int ans = 0;
void dfs(int v) {
if(f) return;
listt.push_back(v+1);
if(query(listt)) {
ans = listt.back();
f = 1;
return;
}
for(auto u : g[v]) {
if(f) return;
if(!used[u]) {
dfs(u);
}
}
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
used.resize(N);
g.resize(N);
for(int i = 0; i < bridges.size(); i ++) {
g[bridges[i].first - 1].push_back(bridges[i].second - 1);
g[bridges[i].second - 1].push_back(bridges[i].first - 1);
}
ans = 0;
f = 0;
dfs(0);
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... | ||||
