# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1145967 | tolga | Easter Eggs (info1cup17_eastereggs) | C++20 | 8 ms | 508 KiB |
#include "grader.h"
#include <cstring>
#include <vector>
using namespace std;
typedef long long ll;
#define endl '\n'
const int maxv = 1e3;
vector<int> edges[maxv];
vector<int> in;
bool visited[maxv];
bool check(int mid) {
vector<int> p;
for (int i = 0; i <= mid; i++)
p.push_back(in[i]);
return query(p);
}
void dfs(int start) {
in.push_back(start);
visited[start] = true;
for (int next : edges[start])
if (!visited[next])
dfs(next);
}
int bin_search() {
dfs(1);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |