# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
61759 | Vinhspm | Easter Eggs (info1cup17_eastereggs) | C++14 | 44 ms | 628 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#include "grader.h"
using namespace std;
#define FOR(a, b, c) for(int a = b; a <= c; ++a)
#define pb push_back
#define fi first
#define se second
typedef pair<double, double> iid;
typedef pair<int, int> ii;
const int N = 600;
const int oo = 1e9;
int n, cnt;
int pos[N];
vector<int> vi[N];
void dfs(int pre, int u) {
pos[++cnt] = u;
for(int v: vi[u]) if(v != pre)
dfs(u, v);
}
int findEgg(int num, vector< pair<int, int> > bridges){
cnt = 0; n = num;
for(int i = 1; i <= n; ++i) vi[i].clear();
for(auto v: bridges) {
vi[v.fi].pb(v.se); vi[v.se].pb(v.fi);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |