# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1146227 | bozho | Easter Eggs (info1cup17_eastereggs) | C++20 | 8 ms | 508 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];
bool Checker(int x)
{
vector<int> c;
for (int i = 1; i <= x; i++)
{
c.push_back(order[i]);
}
return query(c);
}
int Binary()
{
int l = 1, r = order.size(), m;
while (r - l > 1)
{
m = l + (r - l) / 2;
if (Checker(m))
r = m;
else
l = m;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |