Submission #534703

#	Time	Username	Problem	Language	Result	Execution time	Memory
534703		NhatMinh0208	The Collection Game (BOI21_swaps)	C++14	35 / 100	17 ms	408 KiB

swaps

#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
// template<typename T>
// __attribute__((always_inline)) void chkmin(T& a, const T& b) {
//     a=(a<b)?a:b;
// }

// template<typename T>
// __attribute__((always_inline)) void chkmax(T& a, const T& b) {
//     a=(a>b)?a:b;
// }
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif

#include "swaps.h"

void solve(int n, int v) {
	vector<int> sus;
	vector<int> res;
	for (int i=1;i<=n;i++) sus.push_back(i);
	for (int t=0;t<ceil(log2(v));t++) for (int k=t;k>=0;k--) {
		{
			for (int i=0;i<n;i++) if ((((i>>k)&1)==0) && (i+(1<<k)<n) && (((i+(1<<k))>>t)==(i>>t))) {
				schedule(sus[i],sus[i+(1<<k)]);
			}
			res=visit();
			int j=0;
			for (int i=0;i<n;i++) if ((((i>>k)&1)==0) && (i+(1<<k)<n) && (((i+(1<<k))>>t)==(i>>t))) {
				if (res[j]==0) swap(sus[i],sus[i+(1<<k)]);
				j++;
			}
			
			for (int i=0;i<n;i++) if ((((i>>k)&1)==1) && (i+(1<<k)<n) && (((i+(1<<k))>>t)==(i>>t))) {
				schedule(sus[i],sus[i+(1<<k)]);
			}
			res=visit();
			j=0;
			for (int i=0;i<n;i++) if ((((i>>k)&1)==1) && (i+(1<<k)<n) && (((i+(1<<k))>>t)==(i>>t))) {
				if (res[j]==0) swap(sus[i],sus[i+(1<<k)]);
				j++;
			}
		}
	}
	answer(sus);
}
/*
1
./swaps
13 50

*/

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