제출 #387753

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
387753		8e7	Football (info1cup20_football)	C++14	100 / 100	39 ms	404 KiB

football

//Challenge: Accepted
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#define ll long long
#define maxn 100005
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
//#include <bits/extc++.h>
//using namespace __gnu_pbds;
//template<class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//find by order, order of key
int a[maxn];
int main() {
	io
	int t;
	cin >> t;
	while (t--) {
		int n, k;
		cin >> n >> k;
		ll sum = 0;
		for (int i = 0;i < n;i++) {
			cin >> a[i];
			sum += a[i];
		}
		while (sum % 2 == 0 && k != 1) {
			k /= 2;
			sum = 0;
			for (int i = 0;i < n;i++) {
				a[i] /= 2;
				sum += a[i];
			}
		}
		if (k == 1) {
			cout << (sum % 2 ? 1 : 0);
		} else {
			cout << 1;
		}
	}
}
/*
3
3 1
3 1 1
5 2
2 1 1 1 1
1 2
3
 */

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