Submission #444305

#	Time	Username	Problem	Language	Result	Execution time	Memory
444305		blue	The Collection Game (BOI21_swaps)	C++17	0 / 100	1 ms	200 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 = 1; i+1 <= N; i += 2) schedule(r[i -1], r[i+1 -1]);
            vector<int> C = visit();
            for(int i = 1; i+1 <= N; i += 2)
                if(C[i/2 -1] == 1) swap(r[i -1], r[i+1 -1]);
        }
        else
        {
            for(int i = 2; i+1 <= N; i += 2) schedule(r[i -1], r[i+1 -1]);
            vector<int> C = visit();
            for(int i = 2; i+1 <= N; i += 2)
                if(C[i/2 -1] == 1) swap(r[i -1], r[i+1 -1]);
        }
    }
    answer(r);
}

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