# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
522171 | 2022-02-04T03:28:40 Z | blue | Easter Eggs (info1cup17_eastereggs) | C++17 | 1 ms | 456 KB |
#include <vector> #include "grader.h" using namespace std; using vi = vector<int>; using pii = pair<int, int>; const int mx = 512; vi edge[1+mx]; // vi ord(1, 0); void dfs(int u, int p) { // ord.push_back(u); for(int v : edge[u]) { if(v != p) dfs(v, u); } } int findEgg (int N, vector < pair < int, int > > bridges) { for(pii b: bridges) { edge[b.first].push_back(b.second); edge[b.second].push_back(b.first); } dfs(1, 0); // int lo = 1, hi = N; // while(lo != hi) // { // int mid = (lo+hi)/2; // vi qr; // for(int i = 1; i <= mid; i++) // qr.push_back(ord[i]); // if(query(qr)) // hi = mid; // else // lo = mid+1; // } // return ord[lo]; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 328 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 456 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 456 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |