제출 #402476

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
402476		doowey	The Collection Game (BOI21_swaps)	C++14	50 / 100	67 ms	500 KiB

swaps

#include <bits/stdc++.h>
#include "swaps.h"

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

void solve(int n, int q) {
    vector<int> ord;
    for(int i = 0 ; i < n; i ++ )
        ord.push_back(i + 1);
    int cc;
    for(int go = 0; go < n; go ++ ){
        if(go % 2 == 0){
            for(int i = 0 ; i + 1 < n; i += 2){
                schedule(ord[i], ord[i + 1]);
            }
            vector<int> cha = visit();
            cc = 0;
            for(int i = 0; i + 1 < n; i += 2){
                if(cha[cc] == 0) swap(ord[i], ord[i + 1]);
                cc ++ ;
            }
        }
        else{
            for(int i = 1 ; i + 1 < n; i += 2){
                schedule(ord[i], ord[i + 1]);
            }
            vector<int> cha = visit();
            cc = 0;
            for(int i = 1; i + 1 < n; i += 2){
                if(cha[cc] == 0) swap(ord[i], ord[i + 1]);
                cc ++ ;
            }
        }
    }
    answer(ord);
}

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