| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 288908 | andreiomd | Easter Eggs (info1cup17_eastereggs) | C++11 | 2 ms | 544 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 <vector>
#include "grader.h"
using namespace std;
typedef pair < int, int > PII;
int findEgg (int n, vector < PII > edges)
{
for(int i = 1; i < n; ++i)
{
vector < int > V;
V.push_back(i);
if(query(V))
return i;
}
return n;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
