# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
358251 | blue | ICC (CEOI16_icc) | 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 "icc.h"
#include <set>
using namespace std;
void run(int N)
{
set<int> edge[N+1];
for(int i = 1; i <= N-1; i++)
{
bool flag = 0;
for(int p = 1; p <= N; p++)
{
for(int q = p+1; q <= N; q++)
{
if(edge[p].find(q) != edge[p].end()) continue;
if(query(1, 1, {p}, {q}) == 0) continue;
edge[p].insert(q);
edge[q].insert(p);
setRoad(p, q);
flag = 1;
break;
}
if(flag) break;
}
}
}