# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
744329 | 2023-05-18T12:24:45 Z | MON | Easter Eggs (info1cup17_eastereggs) | C++14 | 1 ms | 336 KB |
#include <vector> #include<cassert> #include "grader.h" using namespace std; vector<int> e,vecini[513]; void dfs(int a = 1,int p = -1) { e.emplace_back(a); for(auto &it : vecini[a]) if(it != p) dfs(it,a); } int findEgg (int N, vector < pair < int, int > > bridges) { for(int i = 1; i <= N ; i++) vecini[i].clear(); for(auto &it : bridges) { vecini[it.first].emplace_back(it.second); vecini[it.second].emplace_back(it.first); } return 1; dfs(1,-1); assert(e.size() == N + 1); return 2; int ans = 0,pas = 1; while(pas <= N) pas <<= 1; for(; pas ; pas >>= 1) { if(ans + pas >= N) continue; if(!query(vector<int>(e.begin() + 1,e.begin() + 1 + (ans + pas)))) ans += pas; } return ans + 1; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | The found island is incorrect |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | The found island is incorrect |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 336 KB | Execution killed with signal 13 |
2 | Halted | 0 ms | 0 KB | - |