oj.uz

답안 #339170

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
339170 2020-12-24T18:28:33 Z cheissmart Football (info1cup20_football) C++14
100 / 100
 46 ms 1388 KB 
#include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()
#define debug(x) cerr << "Line(" << __LINE__ << ") -> " << #x << " is " << x << endl

using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;

const int INF = 1e9 + 7;

signed main()
{
	IO_OP;

	int t;
	cin >> t;
	while(t--) {
		int n, k;
		cin >> n >> k;
		vi x(n);
		for(int i = 0; i < n; i++)
			cin >> x[i];
		bool ans = 0;
		while(true) {
			int tt = 0;
			for(int i = 0; i < n; i++)
				tt ^= x[i] & 1;
			if(tt == 1) {
				ans = 1;
				break;
			}
			if(k == 1) break;
			k /= 2;
			for(int i = 0; i < n; i++) x[i] /= 2;
		}
		cout << ans;
		/*if(k == 1) {
			int sg = 0;
			for(int i = 0; i < n; i++) {
				int x;
				cin >> x;
				sg ^= x & 1;
			}
			if(sg) cout << 1;
			else cout << 0;
		} else if(n == 1) {
			int x;
			cin >> x;
			function<bool(int, int)> win = [&] (int x, int k) -> bool {
				if(x & 1) return 1;
				if(k == 1) return 0;
				x /= 2;
				k /= 2;
				return win(x, k);
			};	
			cout << win(x, k);	
		} else if(k == 2) {
			vi x(n);
			int sg = 0;
			for(int i = 0; i < n; i++) {
				cin >> x[i];
				sg ^= x[i] & 1;
			}
			if(sg) cout << 1;
			else {
				int tt = 0;
				for(int i = 0; i < n; i++)
					tt ^= (x[i] / 2) & 1;
				cout << tt;
			}
		}*/
	}
	cout << endl;

}

Subtask #1
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 364 KB Output is correct
2 Correct 12 ms 364 KB Output is correct
3 Correct 12 ms 364 KB Output is correct
4 Correct 12 ms 364 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 364 KB Output is correct
2 Correct 10 ms 620 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 364 KB Output is correct
2 Correct 26 ms 364 KB Output is correct
3 Correct 27 ms 364 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 492 KB Output is correct
2 Correct 39 ms 492 KB Output is correct
3 Correct 46 ms 492 KB Output is correct

Subtask #6
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 364 KB Output is correct
2 Correct 13 ms 492 KB Output is correct
3 Correct 12 ms 384 KB Output is correct

Subtask #7
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 1132 KB Output is correct
2 Correct 13 ms 1388 KB Output is correct
3 Correct 15 ms 1388 KB Output is correct

Subtask #8
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 1132 KB Output is correct
2 Correct 14 ms 1356 KB Output is correct