Submission #524959

#	Time	Username	Problem	Language	Result	Execution time	Memory
524959		maks007	Football (info1cup20_football)	C++14	16 / 100	2088 ms	484 KiB

football

#include <bits/stdc++.h>

using namespace std;

#define int long long

int32_t main(void) {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t;
	cin >> t;
	while(t --) {
		int n, k;
		cin >> n >> k;
		vector <int> a(n);
		for(int i = 0; i < n; i ++) cin >> a[i];
		
		if(n == 1) {
			
			
			int n = a[0];
			if(n & 1) {
				cout << 1;
				continue;
			}
			for(int i = 1; i<= k; i ++) {
				if((n % i == 0 and (n/i)%2 == 1)or(n&i==0 and (n/(n/i))%2 == 0)) {
					cout << 1;
					goto end;
				}
			}
			cout << 0;
			end:;
			continue;
		}
		if(k == 1) {
			int sum = accumulate(a.begin(), a.end(), 0);
			if(sum % 2 == 1) {
				cout << 1;
			}else cout << 0;
			continue;
		}
		int sum = 0;
		for(int i = 0; i < a.size(); i ++) {
			if(a[i] % 2 == 1) sum += 1;
		}
		int move = 0;
		for(int i = 0; i < a.size(); i ++) {
			move += (int)(a[i] / 2);
		}
		if(move % 2 == 0) {
			if(sum % 2 == 1) {
				cout << 1;
			}else cout << 0;
		}else {
			if(sum % 2 == 0) cout << 1;
			else cout << 0;
		}

	}
	return false;
}

Compilation message (stderr)

football.cpp: In function 'int32_t main()':
football.cpp:27:43: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   27 |     if((n % i == 0 and (n/i)%2 == 1)or(n&i==0 and (n/(n/i))%2 == 0)) {
      |                                          ~^~~
football.cpp:44:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |   for(int i = 0; i < a.size(); i ++) {
      |                  ~~^~~~~~~~~~
football.cpp:48:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |   for(int i = 0; i < a.size(); i ++) {
      |                  ~~^~~~~~~~~~

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