Submission #119817

#TimeUsernameProblemLanguageResultExecution timeMemory
119817keko37Meetings (JOI19_meetings)C++14
17 / 100
3029 ms512 KiB
#include <bits/stdc++.h> #include "meetings.h" using namespace std; int n; void Solve (int N) { n = N; for (int a = 0; a < n; a++) { for (int b = a + 1; b < n; b++) { int cnt = 0; for (int c = 0; c < n; c++) { if (c == a || c == b) continue; int res = Query(a, b, c); if (res == a || res == b) cnt++; } if (cnt == n-2) Bridge(a, b); } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...