# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
521987 | iskhakkutbilim | Easter Eggs (info1cup17_eastereggs) | C++14 | 2 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;
int findEgg (int N, vector < pair < int, int > > bridges)
{
vector<int> g[N+1];
vector<int> used(N +1, 0);
vector<int> island;
queue<int> q;
queue<int> jp;
for(int i = 0;i < N-1; i++){
int a = bridges[i].first;
int b = bridges[i].second;
g[a].push_back(b);
g[b].push_back(a);
}
int ans = 1;
q.push(1);
used[1] = 1;
island.push_back(1);
jp.push(1);
while(!q.empty()){
int v = q.front();
q.pop();
for(auto to : g[v]){
if(used[to] == 0){
used[to] = 1;
q.push(to);
island.push_back(to);
jp.push(to);
}
if(jp.size() >= N / 2){
if(query(island) == 1){
while(!jp.empty()){
if(query({jp.front()}) == 1){
return jp.front();
}
jp.pop();
}
}
while(!jp.empty()){
jp.pop();
}
// cout << "\n" << "------" << "\n";
}
}
}
while(!jp.empty()){
if(query({jp.front()}) == 1){
return jp.front();
}
jp.pop();
}
for(auto x : island){
if(query({x})){
return x;
}
}
return 0;
}
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... |