# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
918257 | 2024-01-29T13:52:24 Z | vjudge1 | Easter Eggs (info1cup17_eastereggs) | C++17 | 27 ms | 5928 KB |
#include <bits/stdc++.h> #include "grader.h" #define ll int #define vl vector<ll> #define fi first #define se second #define pb push_back //salam bu 100% menim yeni tahirin kod using namespace std; const int sz = 2e5+5; vl adj[sz]; vl et; void dfs(ll node, ll p){ et.pb(node); for(auto edge: adj[node]){ if(edge == p){continue;} dfs(edge, node); } } int findEgg (int N, vector < pair < int, int > > bridges) { ll i, j; for(i=0;i<sz;i++){ adj[i].clear(); } et.clear(); for(i=0;i<bridges.size();i++){ adj[bridges[i].fi].push_back(bridges[i].se); adj[bridges[i].se].push_back(bridges[i].fi); } dfs(1, 0); ll lo = 0, hi = N-1, mid, best = 0; while(lo < hi){ mid = (lo + hi) >> 1; vl t; for(i = 0; i<=mid; i++){ t.pb(et[i]); } if(query(t)){ hi = mid; } else{ lo = mid + 1; } } return et[lo]; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 4952 KB | Number of queries: 4 |
2 | Correct | 4 ms | 4952 KB | Number of queries: 4 |
3 | Correct | 4 ms | 4952 KB | Number of queries: 4 |
4 | Correct | 4 ms | 4952 KB | Number of queries: 4 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 5928 KB | Number of queries: 8 |
2 | Correct | 18 ms | 5668 KB | Number of queries: 9 |
3 | Correct | 24 ms | 5688 KB | Number of queries: 9 |
4 | Correct | 24 ms | 5680 KB | Number of queries: 9 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 25 ms | 5448 KB | Number of queries: 9 |
2 | Correct | 27 ms | 5424 KB | Number of queries: 9 |
3 | Correct | 24 ms | 5676 KB | Number of queries: 9 |
4 | Correct | 24 ms | 5680 KB | Number of queries: 9 |