제출 #639942

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
639942		jasmin	The Collection Game (BOI21_swaps)	C++14	21 / 100	51 ms	464 KiB

swaps

#include <swaps.h>
#include <algorithm>
#include <functional>
#include <vector>
#include <iostream>
using namespace std;


/*void schedule(int i, int j){
    cout << "schedule " << i << " " << j << "\n";
}

vector<int> visit(){
    cout << "visit\n";
    int n;
    cin >> n;
    vector<int> ans(n);
    for(int i=0; i<n; i++){
        cin >> ans[i];
    }
    return ans;
}

void answer(vector<int>& ans){
    cout << "answer: \n";
    for(auto e: ans){
        cout << e << " ";
    }
    cout << "\n";
}*/

void solve(int n, int v){
    vector<int> a(n);
    for(int i=0; i<n; i++){
        a[i]=i+1;
    }

    for(int i=0; i<n; i++){
        if(i%2==0){
            for(int j=0; j+1<n; j+=2){
                schedule(j+1, j+2);
            }
            vector<int> resp=visit();
            for(int j=0; j+1<n; j+=2){
                if(resp[j/2]==0) swap(a[j], a[j+1]);
            }
        }
        else{
            for(int j=1; j+1<n; j+=2){
                schedule(j+1, j+2);
            }
            vector<int> resp=visit();
            for(int j=1; j+1<n; j+=2){
                if(resp[j/2]==0) swap(a[j], a[j+1]);
            }
        }
    }

    answer(a);
}

/*signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, v;
    cin >> n >> v;
    solve(n, v);
}*/

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