Submission #919071

#TimeUsernameProblemLanguageResultExecution timeMemory
919071penguin133Easter Eggs (info1cup17_eastereggs)C++17
0 / 100
2 ms664 KiB
#include <bits/stdc++.h> using namespace std; #include "grader.h" //#define int long long #define pi pair<int, int> #define pii pair<int, pi> #define fi first #define se second #ifdef _WIN32 #define getchar_unlocked _getchar_nolock #endif mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); int S[1005], back[1005], c = 1; vector <int> adj[1005]; void dfs(int x, int par){ S[x] = c++; for(auto i : adj[x])if(i != par)dfs(i, x); } int findEgg (int N, vector < pair < int, int > > bridges) { c = 1; for(int i = 1; i <= N; i++)adj[i].clear(); for(auto [i, j] : bridges)adj[i].push_back(j), adj[j].push_back(i); dfs(1, -1); for(int i = 1; i <= N; i++)back[S[i]] = i; int lo = 1, hi = N, ans = hi; while(lo < hi){ int mid = (lo + hi) >> 1; vector <int> v; for(int i = 1; i <= mid; i++)v.push_back(back[i]); if(query(v))ans = mid, hi = mid - 1; else lo = mid + 1; } return back[ans]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...