# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
319075 | NachoLibre | Easter Eggs (info1cup17_eastereggs) | C++14 | 0 ms | 0 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>
using namespace std;
// int query(vector<int> islads);
vector<int> v[513], ve;
int bo[513], c, a;
void sgd(int dg, int op) {
ve.push_back(dg);
if(bo[dg]) ++a;
if(a == c / 2) return;
for(int i = 0; i < v[dg].size(); ++i) {
if(v[dg][i] != op) {
sgd(v[dg][i], dg);
if(a == c / 2) return;
}
}
}
int findEgg(int n, vector<pair<int, int> > brd) {
for(int i = 1; i <= n; ++i) {
v[i].clear();
bo[i] = 1;
}
for(int i = 0; i < n - 1; ++i) {
v[brd[i].first].push_back(brd[i].second);
v[brd[i].second].push_back(brd[i].first);
}
c = n;
while(c > 1) {
ve.clear(); a = 0;
sgd(1, 0);
if(query(ve)) {
for(int i = 0; i < ve.size(); ++i) {
if(bo[ve[i]]) bo[ve[i]] = 2;
}
for(int i = 1; i <= n; ++i) {
if(bo[i] != 2) bo[i] = 0;
}
for(int i = 1; i <= n; ++i) {
if(bo[i] == 2) bo[i] = 1;
}
} else {
for(int i = 0; i < ve.size(); ++i) {
bo[ve[i]] = 0;
}
}
}
for(int i = 1; i <= n; ++i) {
if(bo[i]) return i;
}
}
/*
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
return 0;
}
*/