# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
514771 | 2022-01-18T13:08:43 Z | amukkalir | Easter Eggs (info1cup17_eastereggs) | C++17 | 17 ms | 584 KB |
//in repentance and rest is your strenght, in quietness and trust is your salvation #include <bits/stdc++.h> #include "grader.h" using namespace std; #define pb push_back const int nax = 512; vector<int> adj[nax+5]; int f[nax+5]; bool vis[nax+5]; int cr = 1; void bfs() { queue<int> q; q.push(1); while(!q.empty()) { int u = q.front(); q.pop(); vis[u] = true; f[cr++] = u; for(int v : adj[u]) { if(!vis[v]) q.push(v); } } } int findEgg (int N, vector < pair < int, int > > bridges) { if(N == 0) return 0; for(int i=1; i<=N; i++) { adj[i].clear(); f[i] = 0; vis[i] = false; } cr = 1; for(int i=0; i<bridges.size(); i++) { int u = bridges[i].first; int v = bridges[i].second; adj[u].pb(v); adj[v].pb(u); } bfs(); int lo = 2, hi = N; int ans = 1; while(lo <= hi) { int mid = (lo+hi)/2; vector<int> vec; for(int i=1; i<=mid; i++) vec.pb(f[i]); if(query(vec)) { ans = f[mid]; hi = mid-1; } else { lo = mid+1; } } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 456 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 328 KB | Number of queries: 8 |
2 | Correct | 10 ms | 340 KB | Number of queries: 9 |
3 | Correct | 16 ms | 584 KB | Number of queries: 9 |
4 | Correct | 17 ms | 360 KB | Number of queries: 9 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 16 ms | 340 KB | Number of queries: 9 |
2 | Correct | 15 ms | 328 KB | Number of queries: 9 |
3 | Runtime error | 5 ms | 500 KB | Execution killed with signal 6 |
4 | Halted | 0 ms | 0 KB | - |