# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
773766 | 2023-07-05T08:15:55 Z | khshg | Easter Eggs (info1cup17_eastereggs) | C++14 | 1 ms | 464 KB |
#include "grader.h" #include<bits/stdc++.h> using namespace std; int findEgg(int N, vector<pair<int, int>> bridges) { vector<vector<int>> adj(N); for(auto& u : bridges) { --u.first; --u.second; adj[u.first].push_back(u.second); adj[u.second].push_back(u.first); } vector<bool> good(N, 1); int sum = N; while(sum > 1) { vector<int> ask; vector<pair<int, int>> q; int goal = sum / 2; q.push_back({0, -1}); while(true) { pair<int, int> s = q.back(); q.pop_back(); ask.push_back(s.first); goal -= good[s.first]; if(goal == 0) break; for(int& u : adj[s.first]) { if(u != s.second) { q.push_back({u, s.first}); } } } bool f = query(ask); vector<bool> ch(N); for(auto& u : ask) ch[u] = 1; sum = 0; for(int i = 0; i < N; ++i) { if(good[i]) good[i] = (f ? ch[i] : !ch[i]); sum += good[i]; } } for(int i = 0; i < N; ++i) if(good[i]) return i + 1; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 464 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 464 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 464 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |