Submission #1295103

#	Time	Username	Problem	Language	Result	Execution time	Memory
1295103		glupan	The Collection Game (BOI21_swaps)	C++20	15 / 100	24 ms	1420 KiB

swaps

//
// --- Sample implementation for the task swaps ---
//
// To compile this program with the sample grader, place:
//     swaps.h swaps_sample.cpp sample_grader.cpp
// in a single folder and run:
//     g++ swaps_sample.cpp sample_grader.cpp
// in this folder.
//
#include "swaps.h"
#include <bits/stdc++.h>

using namespace std;

void solve(int N, int V) {
    int m[N+1][N+1];
    memset(m,0,sizeof m);
    for(int i=1; i<=N-1; i++) {
        for(int TMP=0; TMP<=1; TMP++) {
            int visited[N+1];
            vector<pair<int,int>>vec;
            memset(visited,0,sizeof visited);
            for(int j=1+TMP*i; j<=N-i; j++) {
                if(visited[j] or visited[j+i]) continue;
                schedule(j, j+i);
                vec.push_back({j,j+i});
                visited[j] = 1;
                visited[j+i] = 1;
            }
            vector<int> res = visit();
            for(int i=0; i<vec.size(); i++) {
                m[vec[i].first][vec[i].second] = res[i];
            }
        }
    }
    int ans[N];
    for(int i=1; i<=N; i++) {
        int cnt=0;
        for(int j=1; j<=N; j++) {
            if(i==j) continue;
            if(i < j) {
                if(m[i][j]) cnt++;
            } else {
                if(!m[j][i]) cnt++;
            }
        }
        ans[N-1-cnt] = i;
    }
    vector<int>Ans;
    for(int i=0; i<N; i++) Ans.push_back(ans[i]);
    answer(Ans);
}

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