oj.uz

답안 #364054

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
364054 2021-02-08T06:57:31 Z stefdasca Football (info1cup20_football) C++14
100 / 100
 45 ms 2156 KB 
#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.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 1388 KB Output is correct
2 Correct 12 ms 1388 KB Output is correct
3 Correct 12 ms 1388 KB Output is correct
4 Correct 13 ms 1388 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 620 KB Output is correct
2 Correct 9 ms 620 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 1132 KB Output is correct
2 Correct 30 ms 1132 KB Output is correct
3 Correct 26 ms 1132 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 2156 KB Output is correct
2 Correct 42 ms 2156 KB Output is correct
3 Correct 40 ms 2156 KB Output is correct

Subtask #6
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 1376 KB Output is correct
2 Correct 13 ms 1388 KB Output is correct
3 Correct 15 ms 1388 KB Output is correct

Subtask #7
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 1388 KB Output is correct
2 Correct 13 ms 1388 KB Output is correct
3 Correct 18 ms 1388 KB Output is correct

Subtask #8
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 1516 KB Output is correct
2 Correct 14 ms 1644 KB Output is correct