# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
972241 | 2024-04-30T09:22:37 Z | penguin133 | Football (info1cup20_football) | C++17 | 29 ms | 1500 KB |
#include <bits/stdc++.h> using namespace std; #define int long long #define pi pair<int, int> #define pii pair<int, pi> #define fi first #define se second #ifdef _WIN32 #define getchar_unlocked _getchar_nolock #endif mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); int n, k, A[300005]; void solve(){ cin >> n >> k; for(int i = 1; i <= n; i++)cin >> A[i]; for(int i = 0; (1ll << i) <= k; i++){ int x = (1ll << i); int ans = 0, ans2 = 0; for(int j = 1; j <= n; j++)ans += (A[j] + x - 1) / x, ans2 += A[j] / x; if(ans2 % 2){ cout << 1; return; } } cout << 0; } main(){ ios::sync_with_stdio(0);cin.tie(0); int tc = 1; cin >> tc; for(int tc1=1;tc1<=tc;tc1++){ // cout << "Case #" << tc1 << ": "; solve(); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 604 KB | Output is correct |
2 | Correct | 9 ms | 596 KB | Output is correct |
3 | Correct | 9 ms | 604 KB | Output is correct |
4 | Correct | 9 ms | 604 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 344 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 348 KB | Output is correct |
2 | Correct | 6 ms | 604 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 17 ms | 524 KB | Output is correct |
2 | Correct | 16 ms | 348 KB | Output is correct |
3 | Correct | 16 ms | 508 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 29 ms | 344 KB | Output is correct |
2 | Correct | 29 ms | 520 KB | Output is correct |
3 | Correct | 28 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 604 KB | Output is correct |
2 | Correct | 10 ms | 604 KB | Output is correct |
3 | Correct | 10 ms | 604 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 18 ms | 620 KB | Output is correct |
2 | Correct | 12 ms | 1372 KB | Output is correct |
3 | Correct | 20 ms | 1496 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 14 ms | 620 KB | Output is correct |
2 | Correct | 17 ms | 1500 KB | Output is correct |