oj.uz

Submission #933561

# Submission time Handle Problem Language Result Execution time Memory
933561 2024-02-25T22:44:20 Z Sputnik123 Football (info1cup20_football) C++17
26 / 100
 28 ms 2132 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <string.h>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <functional>
#include <cstdio>
#define pb push_back
#define in insert
#define pll pair<ll,ll>
#define vpl vector<pll>
#define vll vector <ll>
#define vl vector<ll>
///#define mp make_pair
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define endl "\n"
#define ll long long 
#define ull unsigned long long
using namespace std;
using namespace __gnu_pbds;
//  #pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt,fma")
const ll sz=5e6+5;
const ll inf=1e12+7;
const ll mod=998244353;
const ll P=47;
///const double e=1e-6;
ll gcd(ll x,ll y)
{
    return (y ? gcd(y,x%y) : x);
}
ll lcm(ll x,ll y)
{
    return (x/gcd(x,y))*y;
}
ll binpow(ll a,ll b)
{
    ll ans=1;
    a%=mod;
    while(b)
    {
        ans=(b&1 ? (ans*a)%mod : ans);
        a=(a*a)%mod;
        b>>=1;
    }
    return ans;
}
ll modm(ll n,ll m,ll md=mod)
{
    if(!m)  return 1;
    ll res=modm(n,m>>1,md);
    if(m&1) return res*res%md*n%md;
    return res*res%md;
}
bool isprime(ll n){
    if(n<3)    return false;
    for(ll i=2;i<=sqrt(n);i++){
        if(n%i==0)  return  false;
    }
    return true;
}
// info1cup 20 football
void solve()
{
    ll n,k;
    cin>>n>>k;
    vll a(n);
    for(ll i=0;i<n;i++)
        cin>>a[i];
    ll sum=accumulate(all(a),0);
    if(sum &1)
    {
        cout<<1;
        return ;
    }
    for(ll i=2;i<=k;i*=2)
    {
        ll cnt=0;
        for(ll j=1;j<=n;j++)
            cnt+=a[j]/i;
        if(cnt&1)
        {
            cout<<1;
            return ;
        }
    }
    cout<<0;
}
int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    ll t=1;
    cin>>t;
    while(t--)
    {
        solve();
    }
}

Subtask #1
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1468 KB Output is correct
2 Correct 8 ms 1504 KB Output is correct
3 Correct 8 ms 1348 KB Output is correct
4 Correct 8 ms 1348 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 1148 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 28 ms 2132 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 1500 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 1468 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 1468 KB Output isn't correct
2 Halted 0 ms 0 KB -