제출 #740336

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
740336		nicky4321	The Collection Game (BOI21_swaps)	C++14	21 / 100	54 ms	340 KiB

swaps

//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
#include "swaps.h"
#define ll long long
#define ld long double
#define F first
#define S second
#define PB push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<double, double>
#define ALL(x) x.begin(), x.end()
#define SZ(x) (int)x.size()
#define vi vector<int>
#define vl vector<ll>
#define CASE int t;cin>>t;for(int ca=1;ca<=t;ca++)
#define IOS ios_base::sync_with_stdio(false); cin.tie(0);
using namespace std;
const int MAX = 1 << 20, MOD = 1e9 + 7;

void solve(int N, int V) {
	vi v;
	ll n = N;
	if(n == 1){
		answer({1});
		return;
	}
	for(int i = 1;i <= n;i++) {
		v.push_back(i);
	}
	int cl = 1;
	for(int c = 0;c < n;c++){
		int l = cl;
		while(l + 1 <= n){
			schedule(l, l + 1);
			l += 2;
		}
		visit();
		if(cl == 2){
			cl = 1;
		}
		else{
			cl = 2;
		}
	}
	answer(v);
}

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