# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
243013 | nnnnnnnnnnnnnnnn | Easter Eggs (info1cup17_eastereggs) | C++14 | 26 ms | 384 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;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int,int> ii;
int n,cnt,mid;
vector<vi> graph;
vi node;
vi no,yes;
void dfs(int start,int pa)
{
int i,j;
if(cnt==mid) return;
node.push_back(start);
if(no[start]) ++cnt;
for(i=0;i<graph[start].size();++i)
{
j = graph[start][i];
if(j!=pa)
{
dfs(j,start);
}
}
}
int findEgg(int n,vector<ii> edge)
{
int i,j;
graph.assign(n+1,vi());
no.assign(n+1,1);
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... |