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 <vector>
#include <unordered_set>
using namespace std;
vector<int> v,u;
unordered_set<int> al[105];
void run(int n) {
u.push_back(0);
int a,b;
for (int x=1;x<=n;x++) al[x].insert(x);
for (int _x=1;_x<n;_x++){
a=-1,b=-1;
while (b==-1){
for (int x=1;x<=n;x++){
u[0]=x;
v.clear();
for (int y=1;y<=n;y++){
if (al[x].count(y)==0) v.push_back(y);
}
int _u[]={u[0]};
int _v[v.size()];
for (int x=0;x<(int)v.size();x++) _v[x]=v[x];
if(query(1,v.size(),_u,_v)==1){
if (a==-1) a=x;
else b=x;
}
}
}
printf("%d %d\n",a,b);
al[a].insert(b);
al[b].insert(a);
int aa[]={a},bb[]={b};
if (query(1,1,aa,bb))setRoad(a,b);
else exit(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... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |