제출 #913049

#제출 시각아이디문제언어결과실행 시간메모리
913049vjudge1Mouse (info1cup19_mouse)C++17
34 / 100
113 ms596 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; int n; int ask(const vector<int> &q) { int x = query(q); if (x == n) { exit(0); } return x; } mt19937 rng(123123); void solve(int n) { ::n = n; vector<int> a(n); iota(a.begin(), a.end(), 1); shuffle(a.begin(), a.end(), rng); int cur = ask(a); for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { swap(a[i], a[j]); int tmp = ask(a); if (tmp > cur) { cur = tmp; } else { swap(a[i], a[j]); } } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...