# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1145963 | bozho | Easter Eggs (info1cup17_eastereggs) | C++20 | 1 ms | 488 KiB |
#include <bits/stdc++.h>
#include "grader.h"
#define endl '\n'
using namespace std;
const int MAX = 550;
vector<int> v[MAX], order;
bool used[MAX];
int Binary()
{
vector<int> c;
for (int i = 0; i < order.size(); i++)
{
c.push_back(order[i]);
if (query(c))
return order[i];
}
}
void Dfs(int g)
{
used[g] = 1;
order.push_back(g);
for (int i = 0; i < v[g].size(); i++)
{
if (!used[v[g][i]])
Dfs(v[g][i]);
}
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... |