| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1139559 | tkm_algorithms | Easter Eggs (info1cup17_eastereggs) | C++20 | 0 ms | 428 KiB |
#include <bits/stdc++.h>
#include "grader.h"
//#include "grader.cpp"
using namespace std;
int findEgg (int N, vector < pair < int, int > > bridges)
{
int x = 0;
int ans = 1;
//for (int i = 1; i <= N; ++i) {
x = query({1});
//ans += x;
//}
return ans;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
