# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
773768 | khshg | Easter Eggs (info1cup17_eastereggs) | C++14 | 24 ms | 448 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 "grader.h"
#include<bits/stdc++.h>
using namespace std;
int findEgg(int N, vector<pair<int, int>> bridges) {
vector<vector<int>> adj(N);
for(auto& u : bridges) {
--u.first; --u.second;
adj[u.first].push_back(u.second);
adj[u.second].push_back(u.first);
}
vector<bool> good(N, 1);
int sum = N;
while(sum > 1) {
vector<int> ask;
vector<pair<int, int>> q;
int goal = sum / 2;
q.push_back({0, -1});
while(true) {
pair<int, int> s = q.back(); q.pop_back();
ask.push_back(s.first + 1);
goal -= good[s.first];
if(goal == 0) break;
for(int& u : adj[s.first]) {
if(u != s.second) {
q.push_back({u, s.first});
}
}
}
bool f = query(ask);
vector<bool> ch(N);
for(auto& u : ask) ch[u - 1] = 1;
sum = 0;
for(int i = 0; i < N; ++i) {
if(good[i]) good[i] = (f ? ch[i] : !ch[i]);
sum += good[i];
}
}
for(int i = 0; i < N; ++i) if(good[i]) return i + 1;
}
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... |