Submission #675398

#TimeUsernameProblemLanguageResultExecution timeMemory
675398Hiennoob123Football (info1cup20_football)C++14
69 / 100
33 ms488 KiB
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,fma,sse4.2")
#include<bits/stdc++.h>
#define ll long long
#define int long long
#define ii __int128
#define ld long double
#define cd complex<ld>
#define pll pair<int,int>
#define pii pair<int,int>
#define pld pair<ld,ld>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
ll n, k;
ll A[100005];
void solve()
{
    cin >> n >> k;
    for(int i = 1; i<=n ; i++) cin >> A[i];
    for(int i = 0; i<= 20; i++)
    {
        ll x = (1<<i);
        if(x>k) break;
        ll sum = 0;
        for(int j = 1 ; j<= n ; j++)
        {
            sum += A[j]/x;
        }
        if(sum%2==1)
        {
            cout << 1;
            return;
        }
    }
    cout << 0;

}
signed main()
{
    ios_base::sync_with_stdio(NULL) ; cin.tie(nullptr) ; cout.tie(nullptr);
    int t = 1; cin >> t;
    //cout << -1;
    while(t--)
    {
        solve();
       // cout << "\n";
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...