Submission #369677

#TimeUsernameProblemLanguageResultExecution timeMemory
369677CodePlatinaMeetings (JOI19_meetings)C++14
17 / 100
3043 ms492 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...