oj.uz

Submission #845892

# Submission time Handle Problem Language Result Execution time Memory
845892 2023-09-06T17:50:27 Z samekkk Football (info1cup20_football) C++14
100 / 100
 27 ms 2140 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a,b) for (int a = 0; a < (b); ++a)
#define pb push_back
#define all(t) t.begin(), t.end()

const int max_N = 1e5+5;
int t = 0, n = 0, k = 0;
ll s = 0;
int A[max_N];

int main()
{
    // Jak suma nieparzysta to odrazu win, jak nie to dla jakies dowolnej potegi dwojki suma A[i]/2^x musi byc nieparzysta, wtedy sie da
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> t;
    while(t--)
    {
        cin >> n >> k;
        rep(i,n) cin >> A[i];
        s = 0;
        rep(i,n) s += A[i];
        if (s % 2 == 1)
        {
            cout << '1';
            continue;
        }
        int ilo = 1;
        bool czy_OK = false;
        while(ilo <= k)
        {
            ll sum = 0;
            rep(i,n) sum += A[i] / ilo;
            if (sum % 2 == 1)
            {
                czy_OK = true;
                break;
            }
            ilo *= 2;
        }
        if (czy_OK == true) cout << '1';
        else cout << '0';
    }
    return 0;
}

Subtask #1
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 8 ms 600 KB Output is correct
3 Correct 8 ms 344 KB Output is correct
4 Correct 8 ms 544 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 344 KB Output is correct
2 Correct 6 ms 600 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 344 KB Output is correct
2 Correct 15 ms 1112 KB Output is correct
3 Correct 16 ms 1116 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 344 KB Output is correct
2 Correct 27 ms 2140 KB Output is correct
3 Correct 27 ms 2128 KB Output is correct

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 10 ms 1416 KB Output is correct
3 Correct 10 ms 1372 KB Output is correct

Subtask #7
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 548 KB Output is correct
2 Correct 11 ms 1368 KB Output is correct
3 Correct 19 ms 1368 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 344 KB Output is correct
2 Correct 18 ms 1496 KB Output is correct