Submission #648351

#	Time	Username	Problem	Language	Result	Execution time	Memory
648351		berr	The Collection Game (BOI21_swaps)	C++17	12 / 100	136 ms	11588 KiB

swaps

#include <bits/stdc++.h>
#include "swaps.h"
using namespace std;


void solve(int N, int V)
{
    vector<array<int, 2>> a[V];
    vector<vector<int>> vis(V, vector<int>(N+1));

    vector<int> ans(N+1), pos(N+1);

    for(int i=1; i<=N; i++) ans[i]=i, pos[i]=i;


    for(int i=1; i<=N; i++)
    {
        for(int l=i+1; l<=N; l++)
        {
            int flag=1;
            for(int j=0; j<V&&flag; j++)
            {
                if(vis[j][i]==0&&vis[j][l]==0)
                {
                    a[j].push_back({i, l});
                    vis[j][i]=1;
                    vis[j][l]=1;
                    flag=0;
                }
            }
        }
    }

    for(int i=0; i<V; i++)
    {
        for(auto l: a[i]) schedule(l[0], l[1]);
        auto b=visit();


    }

    vector<int> s;


    for(int i=1; i<=N; i++) s.push_back(i);

    answer(s);
}

• 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: 0 / 9
• Subtask 8: 0 / 6
• Subtask 9: 0 / 21
• Subtask 10: 0 / 14
• Subtask 11: 0 / 9
• Subtask 12: 0 / 6