Submission #249433

#TimeUsernameProblemLanguageResultExecution timeMemory
249433dantoh000Meetings (JOI19_meetings)C++14
17 / 100
3075 ms512 KiB
#include "meetings.h" void Solve(int N) { for (int i = 0; i < N; i++) { for (int j = i+1; 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); } } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...