Submission #912971

#TimeUsernameProblemLanguageResultExecution timeMemory
912971vjudge1Mouse (info1cup19_mouse)C++17
6.00 / 100
88 ms412 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) { // cout << queries << '\n'; exit(0); } return x; } void solve(int n) { ::n = n; vector<int> a(n); iota(a.begin(), a.end(), 1); do { ask(a); } while (next_permutation(a.begin(), a.end())); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...