제출 #987058

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
987058		Zbyszek99	Football (info1cup20_football)	C++17	100 / 100	34 ms	2256 KiB

football

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define size(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace std;
//mt19937 mt;void random(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll rand(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

void solve()
{
    int n,k;
    cin >> n >> k;
    vector<ll> v(n);
    rep(i,n)
    {
        cin >> v[i];
    }
    for(ll p = 1; p <= k; p *= 2)
    {
        ll pom = 0;
        rep(i,n)
        {
            pom += v[i]/p;
        }
        if(pom % 2 == 1)
        {
            cout << 1;
            return;
        }
    }
    cout << 0;
    return;
}

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
   // random();
    int t = 1;
    cin >> t;
    while(t--) solve();
}

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