# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
141359 | Ruxandra985 | Easter Eggs (info1cup17_eastereggs) | C++14 | 20 ms | 380 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 <cstdio>
#include <vector>
#include <algorithm>
#include "grader.h"
using namespace std;
vector <int> w[600];
vector <int> eul,isl;
int poz;
void euler (int nod ,int tata){
int vecin;
eul.push_back(nod);
for (int i = 0 ; i < w[nod].size() ; i++){
vecin = w[nod][i];
if (vecin!=tata){
euler (vecin,nod);
}
}
}
int findEgg (int n , vector <pair <int,int> > v){
int st,dr,mid,sol,x,y;
for (int i=1;i<=n;i++)
w[i].clear();
for (int i=0;i<v.size();i++){
x = v[i].first;
y = v[i].second;
w[x].push_back(y);
w[y].push_back(x);
}
eul.clear();
euler(1,0); /// eul e un vector cu parc euler , dim 2*n
st = 0;
dr = eul.size()-1;
while (st<dr){
mid = (st + dr)/2;
/// iei de la st la mid
isl.clear();
for (int i=0;i<=mid;i++)
isl.push_back(eul[i]);
sol = query(isl);
if (sol == 0)
st = mid + 1;
else dr = mid;
}
return eul[st];
}
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... |