# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
283234 | dsjong | Easter Eggs (info1cup17_eastereggs) | C++14 | 22 ms | 416 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;
vector<int>adj[600];
vector<int>tour, cur;
void dfs(int x, int p){
tour.push_back(x);
for(int y:adj[x]){
if(y==p) continue;
dfs(y, x);
}
}
bool ask(int x){
cur.clear();
for(int i=0;i<=x;i++){
cur.push_back(tour[i]);
}
return query(cur);
}
int findEgg (int N, vector<pair<int, int>> bridges){
for(int i=1;i<=N;i++){
adj[i].clear();
}
for(auto p: bridges){
int x=p.first, y=p.second;
adj[x].push_back(y);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |