# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
144108 | Flying_dragon_02 | Easter Eggs (info1cup17_eastereggs) | C++14 | 20 ms | 412 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 fi first
#define se second
#define pb push_back
#define mp make_pair
typedef pair<int, int> ii;
vector<int> graph[600];
int child[600], m, root, par[600], ok = 0, arr[600], num = 1;
bool vis1[600], vis2[600];
vector<int> ask;
void dfs(int u, int p){
arr[num] = u; num++;
for(int i = 0; i < graph[u].size(); i++){
int v = graph[u][i];
if(v == p) continue;
dfs(v, u);
}
}
int findEgg(int N, vector<ii> bridges){
for(int i = 1; i <= N; i++)
graph[i].clear();
num = 1;
for(int i = 0; i < bridges.size(); i++){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |