oj.uz

답안 #807504

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
807504 2023-08-04T18:23:05 Z SorahISA Football (info1cup20_football) C++17
100 / 100
 34 ms 2016 KB 
#ifndef SorahISA
#define SorahISA
#include SorahISA __FILE__ SorahISA

int solve() {
    int N, K; cin >> N >> K;
    
    vector<int> A(N);
    for (int &x : A) cin >> x;
    
    vector<int> cnt(30, 0);
    for (int x : A) {
        for (int bit = 0; bit < 30; ++bit) cnt[bit] += (x >> bit & 1);
    }
    
    for (int i = __lg(K); i >= 0; --i) {
        if (cnt[i] & 1) return 1;
    }
    return 0;
}

int32_t main() {
    fastIO();
    
    int t = 1; cin >> t;
    for (int _ = 1; _ <= t; ++_) {
        cout << solve();
    }
    cout << "\n";
    
    return 0;
}

#else

#ifdef local
#define _GLIBCXX_DEBUG 1
#endif
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;

#define int int64_t
// #define double __float80
using pii = pair<int, int>;
template <typename T> using Prior = std::priority_queue<T>;
template <typename T> using prior = std::priority_queue<T, vector<T>, greater<T>>;

// #define X first
// #define Y second
#define eb emplace_back
#define ef emplace_front
#define ee emplace
#define pb pop_back
#define pf pop_front
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define SZ(x) ((int)(x).size())

#ifdef local
#define fastIO() void()
#define debug(...) \
    fprintf(stderr, "%sAt [%s], line %d: (%s) = ", "\u001b[33m", __FUNCTION__, __LINE__, #__VA_ARGS__), \
    _do(__VA_ARGS__), fprintf(stderr, "%s", "\u001b[0m")
template <typename T> void _do(T &&_t) {cerr << _t << "\n";}
template <typename T, typename ...U> void _do(T &&_t, U &&..._u) {cerr << _t << ", ", _do(_u...);}
#else
#define fastIO() ios_base::sync_with_stdio(0), cin.tie(0)
#define debug(...) void()
#endif

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

template <typename T, typename U> bool chmin(T &lhs, U rhs) {return lhs > rhs ? lhs = rhs, 1 : 0;}
template <typename T, typename U> bool chmax(T &lhs, U rhs) {return lhs < rhs ? lhs = rhs, 1 : 0;}

#endif

Subtask #1
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1460 KB Output is correct
2 Correct 9 ms 1376 KB Output is correct
3 Correct 9 ms 1348 KB Output is correct
4 Correct 10 ms 1460 KB Output is correct

Subtask #2
8.0 / 8.0

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

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 468 KB Output is correct
2 Correct 7 ms 568 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 992 KB Output is correct
2 Correct 23 ms 972 KB Output is correct
3 Correct 25 ms 1108 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 2016 KB Output is correct
2 Correct 30 ms 1996 KB Output is correct
3 Correct 34 ms 1996 KB Output is correct

Subtask #6
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 1348 KB Output is correct
2 Correct 9 ms 1452 KB Output is correct
3 Correct 9 ms 1344 KB Output is correct

Subtask #7
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1460 KB Output is correct
2 Correct 10 ms 1472 KB Output is correct
3 Correct 9 ms 1376 KB Output is correct

Subtask #8
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 1364 KB Output is correct
2 Correct 9 ms 1348 KB Output is correct