| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1350255 | dodjing | Art Collections (BOI22_art) | C++20 | 0 ms | 0 KiB |
#include <iostream>
#include <vector>
#include <numeric>
#include <unordered_map>
#include <cstdint>
#include <chrono>
//#include <art.h>
#define ll long long
using namespace std;
void solve(int n) {
vector <int> aaa(n);
for (int i = 0; i < n; i++) {
aaa[i] = i + 1;
}
vector <int> res;
int latest = -1;
for (int i = 0; i < n; i++) {
res = publish(aaa);
for (int j = 0; j < n; j++) {
if (res[j] == j - i) latest = j;
}
swap(aaa[i], aaa[latest]);
}
answer(aaa);
}
int main() {
return 0;
}