제출 #418253

#제출 시각아이디문제언어결과실행 시간메모리
418253dolphingarlicFootball (info1cup20_football)C++14
100 / 100
56 ms2040 KiB
#include <bits/stdc++.h> typedef long long ll; using namespace std; int cnt[100001]; int main() { cin.tie(0)->sync_with_stdio(0); int t; cin >> t; while (t--) { int n, k; cin >> n >> k; for (int i = 1; i <= n; i++) cin >> cnt[i]; int winner = 0; for (int kk = 1; kk <= k; kk <<= 1) { ll nimber = 0; for (int i = 1; i <= n; i++) nimber ^= cnt[i] & kk; if (nimber) winner = 1; } cout << winner; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...