# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1207746 | jasonic | The Collection Game (BOI21_swaps) | C++20 | 0 ms | 408 KiB |
#include "swaps.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fastIO cin.tie(0); ios::sync_with_stdio(false)
vector<int> a;
int jumpSort(int l, int r) {
for(int i = 1; i <= r-l+1; i <<= 1) { // jump sizes
for(int j = 0; l + j*i*2 <= r; j++) { // jump blocks
for(int k = 0; k < i && l + k + j*i*2 + i <= r; k++) { // actual jumps
schedule(l + k + (j*i*2) + 1, l + k + (j*i*2) + i + 1);
}
}
visit();
}
}
void solve(int n, int v) {
a = vector<int>(n);
for(int i = 0; i < n; i++) a[i] = i+1;
// bubble sort? N^2/2 works for st3 60%...
for(int i = 0; i < n; i++) {
jumpSort(i, n-1);
}
answer(a);
}
Compilation message (stderr)
# | 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... |
# | 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... |