# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
446517 | ritul_kr_singh | Easter Eggs (info1cup17_eastereggs) | C++17 | 25 ms | 360 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> g[513];
int t[512], dfsTimer;
void dfs(int u, int p){
t[dfsTimer++] = u;
for(int v : g[u]) if(v != p) dfs(v, u);
}
int findEgg (int n, vector <pair<int, int>> e){
for(int i=0; i<n; ++i) g[i+1].clear();
dfsTimer = 0;
for(auto &[u, v] : e){
g[u].push_back(v);
g[v].push_back(u);
}
dfs(1, 1);
int x = 0;
for(int y=n > 16 ? 512 : 16; y/=2; ){
if(x + y <= n){
vector<int> q(x+y);
for(int j=0; j<x+y; ++j) q[j] = t[j];
x += y * !query(q);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |