제출 #581245

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
581245		alontanay	The Collection Game (BOI21_swaps)	C++14	0 / 100	2 ms	208 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>
#define f first
#define s second

using namespace std;
using pi = pair<int,int>;

void solve(int N, int V) {
    for(int i = 1; i <= N; i ++) {
        for(int j = i + 1; j <= N; j ++) {
            schedule(i,j);
            visit();
        }
    }
    vector<int> res(N);
    for(int i = 0; i < N; i ++) {
        res[i] = N-i;
    }
    answer(res);
}

/*
g++ swaps2.cpp grader.cpp -o g.exe && g.exe
5 1000
2 1 5 3 4
1
1
*/

/*
4 1 5 3 4

*/

• 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