제출 #1289764

#제출 시각아이디문제언어결과실행 시간메모리
1289764gustavo_dICC (CEOI16_icc)C++17
7 / 100
194 ms608 KiB
#ifndef LOCAL #include "icc.h" #endif #include <bits/stdc++.h> using namespace std; typedef long long ll; const int MAXN = 100; int tmp[MAXN], tmp2[MAXN]; #ifdef LOCAL void setRoad(int a, int b) { cout << "report" << a << ' ' << b << endl; }; #endif int do_query(vector<int> a, vector<int> b) { #ifdef LOCAL for (int i : a) cout << i << ' '; cout << endl; for (int i : b) cout << i << ' '; cout << endl; int v; cin >> v; return v; #else for (int i=0; i<(int)a.size(); i++) tmp[i] = a[i]; for (int i=0; i<(int)b.size(); i++) tmp2[i] = b[i]; return query((int)a.size(), (int)b.size(), tmp, tmp2); #endif } void run(int N) { int n = N; for (int e=0; e<n-1; e++) { bool found = false; for (int a=1; a<=n and !found; a++) { for (int b=a+1; b<=n and !found; b++) { if (do_query(vector<int> (1, a), vector<int> (1, b))) { setRoad(a, b); found = true; } } } } } #ifdef LOCAL int main() { int n; cin >> n; run(n); return 0; } #endif
#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...