# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
920904 | DON_F | Easter Eggs (info1cup17_eastereggs) | C++14 | 2 ms | 752 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;
using ll = long long;
#define F first
#define S second
vector < vector < int > > g;
set < int > cur, sp;
vector < int > all, vis;
int p;
void dfs(int u){
vis[u] = 1;
if ((int) sp.size() == p){
return;
}
all.push_back(u);
if (cur.count(u)){
sp.insert(u);
}
for (auto &i : g[u]){
if (!vis[i]){
dfs(i);
}
}
}
int findEgg (int n, vector < pair < int, int > > z){
for (int i = 1; i <= n; ++i){
cur.insert(i);
}
g = vector < vector < int > > (n + 1);
vector < int > come(n + 10);
int par = -1;
for (int i = 0; i < n - 1; ++i){
g[z[i].F].push_back(z[i].S);
g[z[i].F].push_back(z[i].S);
}
while (cur.size() > 1){
p = cur.size() / 2;
vis = vector < int > (n + 1);
dfs(*cur.begin());
ll tmp = query(all);
if (tmp){
cur.clear();
for (auto &i : sp){
cur.insert(i);
}
}else{
for (auto &i : sp){
cur.erase(i);
}
}
sp.clear();
all.clear();
}
return *cur.begin();
}
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... |