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"
int a[55][55][55];
void Solve(int N)
{
int n = N;
for(int i = 0; i < n; i++)
{
for(int j = i + 1; j < n; j++)
{
bool vv = false;
for(int k = 0; k < n; k++)
{
if(i == k || j == k) continue;
int t = Query(i, j, k);
if(t != i && t != j) vv = true;
}
if(!vv) 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... |