Submission #930684

#	Time	Username	Problem	Language	Result	Execution time	Memory
930684		bachhoangxuan	Mouse (info1cup19_mouse)	C++17	32.05 / 100	92 ms	412 KiB

mouse

#include<bits/stdc++.h>
#include "grader.h"

using namespace std;

void solve(int n) {
    vector<int> x(n);
    iota(x.begin(),x.end(),1);
    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);
    }
}

• Subtask 1: 13 / 13
• Subtask 2: 19.04598 / 38
• Subtask 3: 0 / 49