# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
521987 | 2022-02-03T14:47:12 Z | iskhakkutbilim | Easter Eggs (info1cup17_eastereggs) | C++14 | 2 ms | 456 KB |
#include <bits/stdc++.h> #include "grader.h" using namespace std; int findEgg (int N, vector < pair < int, int > > bridges) { vector<int> g[N+1]; vector<int> used(N +1, 0); vector<int> island; queue<int> q; queue<int> jp; for(int i = 0;i < N-1; i++){ int a = bridges[i].first; int b = bridges[i].second; g[a].push_back(b); g[b].push_back(a); } int ans = 1; q.push(1); used[1] = 1; island.push_back(1); jp.push(1); while(!q.empty()){ int v = q.front(); q.pop(); for(auto to : g[v]){ if(used[to] == 0){ used[to] = 1; q.push(to); island.push_back(to); jp.push(to); } if(jp.size() >= N / 2){ if(query(island) == 1){ while(!jp.empty()){ if(query({jp.front()}) == 1){ return jp.front(); } jp.pop(); } } while(!jp.empty()){ jp.pop(); } // cout << "\n" << "------" << "\n"; } } } while(!jp.empty()){ if(query({jp.front()}) == 1){ return jp.front(); } jp.pop(); } for(auto x : island){ if(query({x})){ return x; } } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 1 ms | 200 KB | Number of queries: 10 |
2 | Partially correct | 1 ms | 200 KB | Number of queries: 10 |
3 | Partially correct | 1 ms | 200 KB | Number of queries: 10 |
4 | Partially correct | 2 ms | 200 KB | Number of queries: 10 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 436 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 2 ms | 456 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |