Submission #364054

#	Time	Username	Problem	Language	Result	Execution time	Memory
364054		stefdasca	Football (info1cup20_football)	C++14	100 / 100	45 ms	2156 KiB

football

#include<bits/stdc++.h>
#define god dimasi5eks
#pragma GCC optimize("O3")
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mod 1000000007
#define dancila 3.14159265359
#define eps 1e-9

// #define fisier 1

using namespace std;

typedef long long ll;


int add(int a, int b)
{
    ll x = a+b;
    if(x >= mod)
        x -= mod;
    if(x < 0)
        x += mod;
    return x;
}
ll mul(ll a, ll b)
{
    return (a*b) % mod;
}

ll pw(ll a, ll b)
{
    ll ans = 1;
    while(b)
    {
        if(b & 1)
            ans = (ans * a) % mod;
        a = (a * a) % mod;
        b >>= 1;
    }
    return ans;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long rand_seed()
{
    long long a = rng();
    return a;
}

int t, n, v[100002], k;

ll sum;

int main()
{

    #ifdef fisier
        ifstream f("input.in");
        ofstream g("output.out");
    #endif

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> t;
    for(; t; --t)
    {
        cin >> n >> k;
        for(int i = 1; i <= n; ++i)
            cin >> v[i];
        bool ans = 0;
        for(int i = 0; (1<<i) <= k; ++i)
        {
            sum = 0;
            for(int i = 1; i <= n; ++i)
                sum += v[i];
            if(sum % 2 == 1)
            {
                ans = 1;
                break;
            }
            for(int i = 1; i <= n; ++i)
                v[i] /= 2;
        }
        cout << ans;
    }
    return 0;
}

• 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