Submission #502168

#TimeUsernameProblemLanguageResultExecution timeMemory
502168bigoMouse (info1cup19_mouse)C++14
6.00 / 100
135 ms284 KiB
#include <bits/stdc++.h>
#include "grader.h"

using namespace std;
void solve(int n) {
    vector<int>vec(n);
    for (int i = 0; i < n; i++)
        vec[i] = i + 1;
    do {
        if (query(vec) == n)
            return;
    } while (next_permutation(vec.begin(), vec.end()));
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...