oj.uz

Submission #387753

# Submission time Handle Problem Language Result Execution time Memory
387753 2021-04-09T07:21:28 Z 8e7 Football (info1cup20_football) C++14
100 / 100
 39 ms 404 KB 
//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.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 13 ms 404 KB Output is correct

Subtask #2
8.0 / 8.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 356 KB Output is correct
2 Correct 25 ms 400 KB Output is correct
3 Correct 25 ms 368 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 352 KB Output is correct
2 Correct 39 ms 332 KB Output is correct
3 Correct 36 ms 332 KB Output is correct

Subtask #6
16.0 / 16.0

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

Subtask #7
7.0 / 7.0

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

Subtask #8
8.0 / 8.0

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