oj.uz

Submission #667161

# Submission time Handle Problem Language Result Execution time Memory
667161 2022-11-30T14:50:57 Z divad Football (info1cup20_football) C++14
100 / 100
 31 ms 2064 KB 
#include <iostream>
#include <algorithm>
#include <cstring>
#define int long long
#define MAX 1000002
using namespace std;
int t,n,k,a[MAX],nrp,tmp,s,c[MAX],lst,maxi;
bool gasit;
pair<int, int> st[MAX];

bool check(){
    s = 0;
    for(int i = 1; i <= n; i++){
        s += a[i];
    }
    return (s%2);
}

void solve(){
    cin >> n >> k;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    if(check()){
        cout << "1";
        return ;
    }
    while(k > 1){
        for(int i = 1; i <= n; i++){
            a[i] /= 2;
        }
        k /= 2;
        if(check()){
            cout << "1";
            return ;
        }
    }
    cout << "0";
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}

Subtask #1
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 468 KB Output is correct
2 Correct 10 ms 496 KB Output is correct
3 Correct 9 ms 496 KB Output is correct
4 Correct 11 ms 496 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 284 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 340 KB Output is correct
2 Correct 7 ms 588 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 852 KB Output is correct
2 Correct 18 ms 980 KB Output is correct
3 Correct 17 ms 1052 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 2008 KB Output is correct
2 Correct 28 ms 2008 KB Output is correct
3 Correct 31 ms 2064 KB Output is correct

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 492 KB Output is correct
2 Correct 11 ms 1460 KB Output is correct
3 Correct 11 ms 1364 KB Output is correct

Subtask #7
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 468 KB Output is correct
2 Correct 11 ms 1368 KB Output is correct
3 Correct 13 ms 1428 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 468 KB Output is correct
2 Correct 12 ms 1364 KB Output is correct