# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
476280 | lovrot | Easter Eggs (info1cup17_eastereggs) | C++11 | 0 ms | 0 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>
#include "grader.h"
#define X first
#define Y second
using namespace std;
vector<int> g[1010];
vector<int> half;
vector<int> all;
vector<int> help;
int have;
bool took[1010];
/*
int egg;
bool query(vector< int > v){
for(int x : v)
if(x == egg)
return true;
return false;
}*/
void findHalf(int x){
if(have == 0)
return;