| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 521828 | maks007 | Easter Eggs (info1cup17_eastereggs) | C++14 | 3 ms | 456 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;
int findEgg (int N, vector < pair < int, int > > bridges)
{
for(int i = 0; i < bridges.size(); i ++) {
vector <int> q = {bridges[i].first, bridges[i].second};
if(query(q)) {
vector <int> ff, ss;
ff.push_back(bridges[i].first);
ss.push_back(bridges[i].second);
if(query(ff)) return ff[0];
else return ss[0];
}
}
}
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... | ||||
