# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
128612 | E869120 | Easter Eggs (info1cup17_eastereggs) | C++14 | 21 ms | 760 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 <iostream>
#include <vector>
#include <algorithm>
#include "grader.h"
using namespace std;
vector<int> X[1 << 12], G;
bool used[1 << 12]; int N;
void dfs(int pos) {
used[pos] = true; G.push_back(pos);
for (int i = 0; i < X[pos].size(); i++) {
if (used[X[pos][i]] == false) dfs(X[pos][i]);
}
}
int solve(int cr) {
cr = min(cr, N);
vector<int>vec;
for (int i = 0; i < cr; i++) vec.push_back(G[i]);
return query(vec);
}
int findEgg(int NN, vector<pair<int, int>> bridges) {
N = NN;
for (int i = 0; i < bridges.size(); i++) {
X[bridges[i].first].push_back(bridges[i].second);
X[bridges[i].second].push_back(bridges[i].first);
}
dfs(1);
int cx = 0, P = 8;
if (NN <= 16) P = 3;
for (int i = P; i >= 0; i--) {
int v = solve(cx + (1 << i));
if (v == 0) cx += (1 << i);
}
return G[cx];
}
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... |