# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
498718 | 2021-12-26T09:02:33 Z | ahmedfouadnew | Easter Eggs (info1cup17_eastereggs) | C++17 | 19 ms | 388 KB |
#include <bits/stdc++.h> #include "grader.h" //#include "grader.cpp" #define pb push_back #define f first #define s second using namespace std; vector<int>adj[606]; int n; vector<int>vv; void dfs(int u,int p) { vv.pb(u); for(int v:adj[u]) { if(v==p) continue; vv.pb(u); dfs(v,u); } vv.pb(u); } int findEgg (int N, vector < pair < int, int > > bridges) { for(int i=0;i<=N;i++) { adj[i].clear(); } vv.clear(); n=N; for(int i=0;i<bridges.size();i++) { adj[bridges[i].f].pb(bridges[i].s); adj[bridges[i].s].pb(bridges[i].f); } dfs(1,0); int s=0,e=vv.size()-1; while(s<e) { int mid=s+(e-s)/2; set<int>st; for(int ii=s;ii<=mid;ii++) st.insert(vv[ii]); vector<int>qr(st.begin(),st.end()); if(query(qr)) { e=mid; } else { s=mid+1; } } return vv[s]; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 2 ms | 280 KB | Number of queries: 6 |
2 | Partially correct | 1 ms | 200 KB | Number of queries: 6 |
3 | Partially correct | 2 ms | 200 KB | Number of queries: 6 |
4 | Partially correct | 1 ms | 200 KB | Number of queries: 6 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 6 ms | 328 KB | Number of queries: 10 |
2 | Partially correct | 8 ms | 328 KB | Number of queries: 11 |
3 | Partially correct | 14 ms | 328 KB | Number of queries: 11 |
4 | Partially correct | 12 ms | 352 KB | Number of queries: 11 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 15 ms | 388 KB | Number of queries: 11 |
2 | Partially correct | 16 ms | 328 KB | Number of queries: 11 |
3 | Partially correct | 19 ms | 360 KB | Number of queries: 11 |
4 | Partially correct | 13 ms | 328 KB | Number of queries: 11 |