# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1146539 | crispxx | Easter Eggs (info1cup17_eastereggs) | C++20 | 1 ms | 428 KiB |
#include <bits/stdc++.h>
#include "grader.h"
// #include "grader.cpp"
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
#define nl '\n'
int findEgg(int n, vector <pair<int, int>> edges) {
for(int i = 1; i <= n; i++) {
if(query(vector<int>{i})) {
return i;
}
}
// vector<set<int>> adj(n);
// for(auto &[u, v] : edges) {
// u--, v--;
// adj[u].emplace(v);
// adj[v].emplace(u);
// }
// vector<int> isl;
// auto dfs = [&](auto &&dfs, int v, int p) -> void {
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... |