Submission #24607

#TimeUsernameProblemLanguageResultExecution timeMemory
24607bill_kondoICC (CEOI16_icc)C++14
7 / 100
373 ms2084 KiB
#include "icc.h" #include <bits/stdc++.h> using namespace std; typedef pair <int, int> pii; const int maxn = 1e2 + 10; int n; set <pii> e; int c[maxn]; int d[maxn]; void acha () { for (int a = 1; a <= n; ++a) for (int b = a + 1; b <= n; ++b) if (e.find (pii (a, b)) == e.end()) { c[0] = {a}; d[0] = {b}; if (query (1, 1, c, d)) { e.insert (pii (a, b)); setRoad (a, b); return; } } } void run (int N) { n = N; for (int i = 1; i <= n - 1; ++i) acha (); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...