oj.uz

Submission #387600

# Submission time Handle Problem Language Result Execution time Memory
387600 2021-04-09T03:24:24 Z casperwang Football (info1cup20_football) C++14
100 / 100
 32 ms 580 KB 
#include <bits/stdc++.h>
using namespace std;
#define debug(args) kout("[ " + string(#args) + " ]", args)
void kout() { cerr << endl; }
template <class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ',kout(b...); }
template <class T> void pary(T L, T R) { while (L != R) cerr << *L << " \n"[++L==R]; }

const int MAXN = 100000;
int T, N, K;
int a[MAXN];
string ans;

inline int lb(int a) {
	return a &- a;
}

bool solve(int k) {
	int cnt = 0;
	for (int i = 0; i < N; i++) {
		cnt += (a[i] & 1);
	}
	if (cnt % 2) return true;
	for (int i = 0; i < N; i++) {
		a[i] /= 2;
	}
	return false;
}

signed main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> T;
	while (T--) {
		cin >> N >> K;
		for (int i = 0; i < N; i++) {
			cin >> a[i];
		}
		bool flag = false;
		for (int i = 1; i <= K && !flag; i *= 2) {
			flag |= solve(i);
		}
		ans += (flag ? '1' : '0');
	}
	cout << ans << '\n';
}

Subtask #1
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 332 KB Output is correct
2 Correct 12 ms 332 KB Output is correct
3 Correct 12 ms 396 KB Output is correct
4 Correct 15 ms 332 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 332 KB Output is correct
2 Correct 8 ms 332 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 524 KB Output is correct
2 Correct 20 ms 528 KB Output is correct
3 Correct 24 ms 524 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 580 KB Output is correct
2 Correct 31 ms 552 KB Output is correct
3 Correct 31 ms 548 KB Output is correct

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 396 KB Output is correct
2 Correct 12 ms 332 KB Output is correct
3 Correct 12 ms 332 KB Output is correct

Subtask #7
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 332 KB Output is correct
2 Correct 14 ms 332 KB Output is correct
3 Correct 14 ms 332 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 392 KB Output is correct
2 Correct 13 ms 332 KB Output is correct