| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1351775 | azul_safiro | Art Collections (BOI22_art) | C++20 | 542 ms | 492 KiB |
#include "art.h"
#include <bits/stdc++.h>
// #define int long long
using namespace std;
void solve(int N) {
int n = N;
vector <int> v;
for (int i = 1; i <= n; i ++) v.push_back(i);
int cur = publish(v);
for (int i = 1; i < n; i ++) {
vector <int> v1;
v1.push_back(v[i]);
for (int i1 = 0; i1 < i; i1 ++) v1.push_back(v[i1]);
for (int i1 = i + 1; i1 < n; i1 ++) v1.push_back(v[i1]);
int cur1 = publish(v1);
int a = (cur1 - cur + i) / 2;
v.clear();
for (int i1 = 1; i1 <= a; i1 ++) v.push_back(v1[i1]);
v.push_back(v1[0]);
for (int i1 = a + 1; i1 < n; i1 ++) v.push_back(v1[i1]);
cur = cur1 - a;
}
answer(v);
return ;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
