#include <bits/stdc++.h>
#define int long long
void solve() {
int n, k;
std::cin >> n >> k;
std::vector<int> a(n + 1);
for(int i = 1; i <= n; i++) {
std::cin >> a[i];
}
if(k == 1) {
if(accumulate(a.begin() + 1, a.end(), 0) % 2 == 1) {
std::cout << 1;
}
else {
std::cout << 0;
}
return;
}
if(k >= *max_element(a.begin() + 1, a.end())) {
std::cout << 1;
return;
}
if(n == 1) {
if((a[1] / k) % 2 == 1) {
std::cout << 1;
}
else {
std::cout << 1;
}
return;
}
}
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int t = 1;
std::cin >> t;
while (t--) {
solve();
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |