Submission #1161846

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1161846	2025-03-05 08:19:05	Pacybwoah	The Collection Game (BOI21_swaps)	C++20	100 / 100	2 ms	472 KiB

swaps

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
// batcher's odd-even merge sort
// https://math.mit.edu/~shor/18.310/batcher.pdf
#include "swaps.h"
#include<iostream>
#include<vector>
#include<algorithm>
#include<utility>
#include<string>
using namespace std;
namespace{
    const int maxn = 512;
}
void solve(int n, int v) {
    vector<pair<int, int>> ops;
    vector<int> vec(n);
    for(int i = 0; i < n; i++) vec[i] = i + 1;
    auto add = [&](int a, int b){
        if(a >= n || b >= n) return;
        schedule(vec[a], vec[b]);
        ops.emplace_back(a, b);
        return;
    };
    auto do_ops = [&](){
        auto res = visit();
        int sz = (int)ops.size();
        for(int i = 0; i < sz; i++){
            auto &[a, b] = ops[i];
            if(res[i] == 0) swap(vec[a], vec[b]);
            // whether or not the grader swaps paintings actually doesn't matter!
            // calling comp(a, b) means that we don't know their order yet and whether a or b is bigger doesn't mess up the order
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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