Submission #1220372

#TimeUsernameProblemLanguageResultExecution timeMemory
1220372takoshanavaEaster Eggs (info1cup17_eastereggs)C++20
0 / 100
292 ms196608 KiB
#include <bits/stdc++.h> #include "grader.h" #define pb push_back #define fs first #define sc second using namespace std; const int N = 520; int t; vector<int> in; vector<int> adj[N]; void dfs(int v, int par){ in.pb(v); for(auto u:adj[v]){ if(u != par){ dfs(u, v); } } } int findEgg(int N, vector<pair<int, int>> bridges){ for(auto v : bridges){ adj[v.fs].pb(v.sc); adj[v.sc].pb(v.fs); } dfs(1, 0); int l = 0, r = N - 1; while(l <= r){ int mid = (l + r) / 2; vector<int> vec; for(int i = 0; i < mid; i++){ vec.pb(in[i]); } bool res = query(vec); if(res){ r = mid - 1; }else{ l = mid + 1; } } return r; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...