Submission #444321

#	Time	Username	Problem	Language	Result	Execution time	Memory
444321		blue	The Collection Game (BOI21_swaps)	C++17	50 / 100	67 ms	448 KiB

swaps

#include "swaps.h"
#include <vector>
using namespace std;


void solve(int N, int V)
{
    vector<int> r(N);
    for(int i = 1; i <= N; i++) r[i - 1] = i;

    for(int v = 1; v <= min(V, N); v++)
    {
        if(v % 2 == 0)
        {
            for(int i = 0; i+1 < N; i += 2) schedule(r[i], r[i+1]);
            vector<int> C = visit();

            for(int i = 0; i+1 < N; i += 2)
                if(C[i/2] == 0)
                    swap(r[i+1], r[i]);
        }
        else
        {
            for(int i = 1; i+1 < N; i += 2) schedule(r[i], r[i+1]);
            vector<int> C = visit();

            for(int i = 1; i+1 < N; i += 2)
                if(C[i/2] == 0)
                    swap(r[i+1], r[i]);
        }
    }

    answer(r);
}

• 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