| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 45403 | bogdan10bos | Easter Eggs (info1cup17_eastereggs) | C++14 | 21 ms | 652 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>
using namespace std;
#include "grader.h"
typedef pair<int, int> pii;
int I, ord[1005];
vector<int> edg[1005];
void DFS(int nod, int fth)
{
ord[++I] = nod;
for(auto nxt: edg[nod])
{
if(nxt == fth) continue;
DFS(nxt, nod);
}
}
int myQuery(int pos)
{
vector<int> v;
for(int i = 1; i <= pos; i++)
v.push_back(ord[i]);
return query(v);
}
int findEgg(int N, vector<pii> edges)
{
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||