제출 #1110585

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1110585		_callmelucian	Football (info1cup20_football)	C++14	24 / 100	22 ms	544 KiB

football

#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 cntOdd = 0, loLSB = INT_MAX;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        if (a[i] & 1) cntOdd++;
        loLSB = min(loLSB, (a[i] & -a[i]));
    }

    if (cntOdd & 1) return 1;
    return k >= loLSB;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    int TC; cin >> TC;
    while (TC--) cout << solve();

    return 0;
}

• Subtask 1: 0 / 26
• Subtask 2: 0 / 8
• Subtask 3: 0 / 11
• Subtask 4: 8 / 8
• Subtask 5: 16 / 16
• Subtask 6: 0 / 16
• Subtask 7: 0 / 7
• Subtask 8: 0 / 8