Submission #401072

#	Time	Username	Problem	Language	Result	Execution time	Memory
401072		dolphingarlic	Mouse (info1cup19_mouse)	C++14	33.41 / 100	207 ms	204 KiB

mouse

#include "grader.h"

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

void solve(int N) {
    vector<int> perm(N);
    iota(perm.begin(), perm.end(), 1);
    random_shuffle(perm.begin(), perm.end());
    vector<bool> known(N, false);
    int prv = -1;
    for (int i = 0; i < N;) {
        if (known[i]) {
            i++;
            continue;
        }
        int baseline = query(perm);
        if (baseline == N) return;

        int found = -1;
        for (int j = i + 1; j < N; j++) {
            swap(perm[i], perm[j]);
            int pot = query(perm);
            if (pot == N) return;
            if (pot > baseline) {
                found = j;
                break;
            }
            swap(perm[i], perm[j]);
        }
        if (~found) {
            if (~prv) known[prv] = true;
            prv = found;
        } else {
            known[i] = true;
            i++;
            prv = -1;
        }
    }
    query(perm);
}

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