제출 #1105849

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1105849		abushbandit_	Football (info1cup20_football)	C++17	0 / 100	2060 ms	1048576 KiB

football

#include "bits/stdc++.h"

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

using namespace std;

//~ #ifndef ONLINE_JUDGE
//~ #include "debug.h"
//~ #else
//~ #define debug(...)
//~ #define debugArr(...)
//~ #endif

#define int long long
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define ff first
#define ss second
#define pb push_back

template<class T, class U> inline bool chmin(T& a, const U& b) { if (a > b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmax(T& a, const U& b) { if (a < b) { a = b; return true; } return false; }



const int inf = 2e18;
const int mod = 1e9 + 7;
const int N = 2e5 + 1;

void solve(){
	
	int n,k;
	cin >> n >> k;
	vector<int> a(n + 1);
	int mx = 0;
	for(int i = 1;i <= n;i++) cin >> a[i],mx = max(mx,a[i]);
	int M = min(mx,k);
	vector<vector<int>> dp(mx + 1,vector<int> (M + 1));
	//~ set<int> MEX;
	//~ for(int i = 0;i <= M + 1;i++) {
		//~ MEX.insert(i);
	//~ }
	int X = 0;
	for(int i = 1;i <= mx;i++) {
		set<int> v;
		for(int j = 0;j <= min(i,k);j++) {
			v.insert(j);
		}
		for(int j = 1;j <= M;j++) {
			if(v.find(dp[max(i - j,0ll)][j]) != v.end())
				v.erase(dp[max(i - j,0ll)][j]);
			dp[i][j] = *v.begin();
		}
	}
	for(int i = 1;i <= n;i++) {
		X = X ^ dp[a[i]][k];
	}
	if(X) cout << 1;
	else  cout << 0;
	
}


signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);cout.tie(nullptr);
	int T = 1;
	cin >> T;
	while(T--) {
		solve();
	}
	
}
	

• Subtask 1: 0 / 26
• Subtask 2: 0 / 8
• Subtask 3: 0 / 11
• Subtask 4: 0 / 8
• Subtask 5: 0 / 16
• Subtask 6: 0 / 16
• Subtask 7: 0 / 7
• Subtask 8: 0 / 8