# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
249432 | dantoh000 | Meetings (JOI19_meetings) | C++14 | 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 "meetings.h"
void Solve(int N) {
for (int i = 0; i < N; i++) {
for (int j = i+1;s j < N; j++){
bool can = 1;
for (int k = 0; k < N; k++){
if (i == k || j == k) continue;
int Q = Query(i,j,k);
if (Q != i && Q != j){
can = 0;
break;
}
}
if (can){
Bridge(i,j);
}
}
}
}