제출 #1207749

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1207749		jasonic	The Collection Game (BOI21_swaps)	C++20	12 / 100	84 ms	448 KiB

swaps

#include "swaps.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define fastIO cin.tie(0); ios::sync_with_stdio(false)
#define cerr if(0) cout

vector<int> a;

// void schedule(int i, int j) {
//     cerr << i << ' ' << j << '\n';
// }

// void visit() {cerr << "called visit\n";};

void 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-1; i++) {
        jumpSort(i, n-1);
        cerr << "done\n";
    }

    answer(a);
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3-1: 3 / 3
• Subtask 3-2: 0 / 2
• Subtask 4-1: 9 / 9
• Subtask 4-2: 0 / 6
• Subtask 5-1: 0 / 9
• Subtask 5-2: 0 / 6
• Subtask 6-1: 0 / 21
• Subtask 6-2: 0 / 14
• Subtask 7-1: 0 / 9
• Subtask 7-2: 0 / 6