제출 #930686

#제출 시각아이디문제언어결과실행 시간메모리
930686bachhoangxuanMouse (info1cup19_mouse)C++17
31.85 / 100
103 ms596 KiB
#include<bits/stdc++.h>
#include "grader.h"
 
using namespace std;
 
void solve(int n) {
    vector<int> x(n);
    iota(x.begin(),x.end(),1);
  	random_shuffle(x.begin(),x.end());
    int S = query(x);
    for(int i=0;i<n;i++) for(int j=0;j<n;j++){
        swap(x[i],x[j]);
        int d=query(x);
        if(d==n) return;
        else if(d<=S) swap(x[i],x[j]);
        S=max(S,d);
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...