# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1146053 | martin | Easter Eggs (info1cup17_eastereggs) | C++20 | 8 ms | 516 KiB |
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
vector<int> ts,pmo[1024]; //path, e
int used[1024];
int n;
bool check(int x)
{
vector<int> p;
for(int i=0; i<=x; i++)
{
p.push_back(ts[i]);
}
return query(p);
}
int dnc()
{
int l=0,r=ts.size()-1;
while(l<r)
{
int mid=(l+r)/2;
if(check(mid))
{
r=mid;
}
else
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |