# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67633 | cdemirer | Easter Eggs (info1cup17_eastereggs) | C++17 | 42 ms | 564 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>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef pair<double, double> dodo;
#define mp(x, y) make_pair(x, y)
#define pb(x) push_back(x)
#include "grader.h"
bool poss[512];
vvi edges;
vi queryVector;
int parent[512];
int expand(int x, int rem) {
queryVector.pb(x);
if (poss[x]) {
rem -= 1;
}
for (int i = 0; i < edges[x].size(); i++) {
if (!rem) break;
int y = edges[x][i];
if (y == parent[x]) continue;
parent[y] = x;
rem = expand(y, rem);
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... |