Submission #247354

#TimeUsernameProblemLanguageResultExecution timeMemory
247354dwscMouse (info1cup19_mouse)C++14
6.00 / 100
3032 ms256 KiB
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
void solve(int N){
    vector<int> v;
    for (int i = 1; i <= N; i++) v.push_back(i);
    do{
        int val = query(v);
        if (val == N) return;
        else if (val == 5){
            for (int i = 0; i < N; i++){
                for (int j = i+1; j < N; j++){
                    swap(v[i],v[j]);
                    if (query(v) == N) return;
                    swap(v[i],v[j]);
                }
            }
        }
    }while(next_permutation(v.begin(),v.end()));
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...