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"
using namespace std;
void Solve(int N)
{
for(int i = 0; i < N; ++i)
{
for(int j = i + 1; j < N; ++j)
{
bool flag = true;
for(int k = 0; k < N; ++k) if(k != i && k != j)
{
int t = Query(i, j, k);
if(i != t && j != t)
{
flag = false;
break;
}
}
if(flag) Bridge(i, j);
}
}
}
# | 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... |