# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
791344 | jamezzz | Easter Eggs (info1cup17_eastereggs) | C++17 | 20 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;
#define maxn 520
#define pb push_back
#define sz(x) ((int)x.size())
typedef pair<int,int> ii;
int mark[maxn],take[maxn];
vector<int> AL[maxn];
void dfs(int u,int p,vector<int> &s,int &t){
if(mark[u])s.pb(u);
else if(t>0)s.pb(u),--t;
else return;
for(int v:AL[u]){
if(v==p)continue;
dfs(v,u,s,t);
}
}
int findEgg(int N,vector<ii> bridges){
memset(mark,0,sizeof mark);
for(int i=1;i<=N;++i)AL[i].clear();
for(auto[u,v]:bridges){
AL[u].pb(v);
AL[v].pb(u);
}
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... |