Submission #1250520

#TimeUsernameProblemLanguageResultExecution timeMemory
1250520SoMotThanhXuanEaster Eggs (info1cup17_eastereggs)C++20
87 / 100
8 ms508 KiB
#include "grader.h" #include <bits/stdc++.h> using namespace std; #define F first #define S second #define FOR(i, a, b) for(int i = (a), _b = (b); i <= _b; ++i) #define REP(i, a, b) for(int i = (a), _b = (b); i >= _b; --i) #define mp make_pair #define all(v) v.begin(), v.end() #define uni(v) v.erase(unique(all(v)), v.end()) #define Bit(x, i) ((x >> (i)) & 1) #define Mask(i) (1 << (i)) #define Cnt(x) __builtin_popcount(x) #define Cntll(x) __builtin_popcountll(x) #define Ctz(x) __builtin_ctz(x) // so luong so 0 tinh tu ben phai #define Ctzll(x) __builtin_ctzll(x) #define Clz(x) __builtin_clz(x) // so luong so 0 tinh tu ben trai #define Clzll(x) __builtin_clzll(x) inline bool maximize(int &u, int v){ return v > u ? u = v, true : false; } inline bool minimize(int &u, int v){ return v < u ? u = v, true : false; } inline bool maximizell(long long &u, long long v){ return v > u ? u = v, true : false; } inline bool minimizell(long long &u, long long v){ return v < u ? u = v, true : false; } const int mod = 1e9 + 7; inline int fastPow(int a, int n){ if(n == 0) return 1; int t = fastPow(a, n >> 1); t = 1ll * t * t % mod; if(n & 1) t = 1ll * t * a % mod; return t; } inline void add(int &u, int v){ u += v; if(u >= mod) u -= mod; } inline void sub(int &u, int v){ u -= v; if(u < 0) u += mod; } const int maxN = 2e5 + 5; const int inf = 1e9; const long long infll = 1e18; vector<int> adj[513]; vector<int> order; void dfs(int u = 1, int p = 0){ order.emplace_back(u); for(int v : adj[u]){ if(v != p) dfs(v, u); } } int findEgg(int n, vector<pair<int, int>> bridges){ FOR(i, 1, n)adj[i].clear(); order.clear(); for(auto[u, v] : bridges){ adj[u].emplace_back(v); adj[v].emplace_back(u); } dfs(); int l = 1, r = n; int res = 0; while(l <= r){ int mid = l + r >> 1; if(query(vector<int> (order.begin(), order.begin() + mid))){ res = mid - 1; r = mid - 1; }else l = mid + 1; } return order[res]; } //void process(){ // //} //#define LOVE "" //int main(){ // if(fopen(LOVE".inp", "r")){ // freopen(LOVE".inp", "r", stdin); // freopen(LOVE".out", "w", stdout); // } // ios_base::sync_with_stdio(false); // cin.tie(0); // cout.tie(0); // // int t = 1; //// cin >> t; // while(t--) // process(); //// cerr << '\n' << "Time elapsed: " << (1.0 * clock() / CLOCKS_PER_SEC) << " s\n" ; // return 0; //}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...