# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
721697 | drdilyor | Event Hopping (BOI22_events) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#include"art.h"
using namespace std;
void solve(int n) {
vector<int> ans(n);
iota(ans.begin(), ans.end(), 1);
int last = publish(ans);
for (int i = 0; i < n; i++) {
auto cur = ans;
for (int j = 0; j < n-1; j++) {
swap(cur[j], cur[j+1]);
int inv = publish(cur);
if (inv < last) {
last = inv;
ans = cur;
} else cur = ans;
}
}
answer(ans);
}