Submission #1207735

#	Time	Username	Problem	Language	Result	Execution time	Memory
1207735		jasonic	The Collection Game (BOI21_swaps)	C++20	0 / 100	0 ms	408 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)

vector<int> a;

void swapBig(int i, int j) {
    schedule(i, j);
    visit();
    // we dont care abt output of visit since 
}

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 = N-1; i > 0; i--) {
        for(int j = 0; j < i; j++) {
            swapBig(i, j);
        }
    }

    answer(a);
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3-1: 0 / 3
• Subtask 3-2: 0 / 2
• Subtask 4-1: 0 / 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