Submission #1362415

#	Time	Username	Problem	Language	Result	Execution time	Memory
1362415		mariaclara	The Collection Game (BOI21_swaps)	C++20	0 / 100	0 ms	344 KiB

swaps

//g++ swaps_sample.cpp sample_grader.cpp
#include "swaps.h"
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mk make_pair
#define pb push_back
#define fr first
#define sc second

void solve(int N, int V) {
    for(int b = 8; b >= 0; b--) {
        int pot = (1<<b);
        if(pot >= N) continue;

        for(int i = pot+1; i <= N; i++) 
            if(i%(2*pot) < pot) schedule(i-pot, i);

        visit();
            
        for(int i = pot+1; i <= N; i++) 
            if(i%(2*pot) >= pot) schedule(i-pot, i);
   
        visit();
    }

    vi ans;
    for(int i = 1; i <= N; i++) ans.pb(i);

    answer(ans);
}

• 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