Submission #1344119

#	Time	Username	Problem	Language	Result	Execution time	Memory
1344119		Jakub_Wozniak	The Collection Game (BOI21_swaps)	C++20	0 / 100	634 ms	589824 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;
typedef long long ll;
typedef pair<int,int> pii;
#define st first
#define nd second

void solve(int N, int V) 
{
    for(int j = 1 ; j <= N*N/4 ; j++)
    {
        for(int i = 1; i+1 <= N ; i += 2)schedule(i,i+1);
        visit();
        for(int i = 2; i+1 <= N ; i += 2)schedule(i,i+1);
        visit();
    }

    vector <int> r;
    for(int i = 1; i <= N ; i--)r.push_back(i);
    answer(r);

}

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