# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
918223 | 2024-01-29T13:38:12 Z | Fikrat_Asadzadeh | Easter Eggs (info1cup17_eastereggs) | C++17 | 92 ms | 131072 KB |
#include <bits/stdc++.h> #include "grader.h" using namespace std; typedef unsigned long long ull; #define ll unsigned long long typedef vector < int > vl; typedef set < int > setl; #define F first #define S second #define all(v) v.begin(), v.end() #define pll pair < int , int > #define db double #define nll cout << "\n" #define nl endl #define sync \ ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) ; const int MAX = 1e6 + 5; const long long inf = 1e18; vl g[550], v; void dfs(ll u, ll par){ v.push_back(u); for(auto i : g[u]){ if(u == par)continue; dfs(i, u); } } int findEgg(int N, vector < pll > bridges){ for(ll i = 1; i <= N; i++){ g[i].clear(); } for(pll i : bridges)g[i.first].push_back(i.second), g[i.second].push_back(i.first); dfs(1, 0); ll l = 0, r = N - 1, mid; while(l < r){ mid = (l + r) >> 1; vl v2; for(ll i = 0; i <= mid; i++)v2.push_back(v[i]); if(query(v2))r = mid; else l = mid + 1; } return v[l]; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 77 ms | 131072 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 92 ms | 131072 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 77 ms | 131072 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |