Submission #1110589

#TimeUsernameProblemLanguageResultExecution timeMemory
1110589_callmelucianFootball (info1cup20_football)C++14
66 / 100
22 ms1360 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; typedef pair<ll,ll> pl; typedef pair<int,int> pii; typedef tuple<int,int,int> tt; #define all(a) a.begin(), a.end() #define filter(a) a.erase(unique(all(a)), a.end()) const int mn = 1e5 + 5; int n, k, a[mn]; bool solve() { cin >> n >> k; int xorSum = 0; for (int i = 0; i < n; i++) { cin >> a[i]; xorSum ^= a[i]; } return k >= (xorSum & -xorSum); } int main() { ios::sync_with_stdio(0); cin.tie(0); int TC; cin >> TC; while (TC--) cout << solve(); 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...