oj.uz

Submission #679409

# Submission time Handle Problem Language Result Execution time Memory
679409 2023-01-08T08:42:33 Z alexdd Football (info1cup20_football) C++17
100 / 100
 37 ms 2032 KB 
#pragma GCC optimize("O3,unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1000000007
int n,k;
int a[100001];
bool verif1()
{
    int sum=0;
    for(int i=1;i<=n;i++)
        sum+=a[i];
    if(sum%2==1)
        return 1;
    return 0;
}
bool isput2(int x)
{
    int put=1;
    while(put<x)
        put=put*2;
    if(put==x)
        return 1;
    return 0;
}
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);

    int t;
    cin>>t;
    while(t--)
    {
        cin>>n>>k;
        for(int i=1;i<=n;i++)
            cin>>a[i];
        sort(a+1,a+1+n);
        k = min(k,a[n]);
        if(verif1())
        {
            cout<<1;
            continue;
        }
        ///suma elementelor este para
        if(k==1)
        {
            cout<<0;
            continue;
        }
        if(k==2 || k==3)
        {
            ///la o runda pot sa ia doar 2 elevi din oricare gramada
            int sum2=0;
            for(int i=1;i<=n;i++)
                sum2+=a[i] - (a[i]%2);
            sum2/=2;
            if(sum2%2==1)
            {
                cout<<1;
                continue;
            }
            cout<<0;
            continue;
        }
        if(n==1)
        {
            ///a[1]%2==0
            if(k>=a[1])
            {
                cout<<1;
                continue;
            }
            int cv=2;
            bool bl=0;
            while(cv<=min(k,a[1]))
            {
                if((a[1]/cv)%2==1)
                {
                    bl=1;
                    break;
                }
                cv=cv*2;
            }
            if(bl)
            {
                cout<<1;
                continue;
            }
            cout<<0;
            continue;
        }
        if(a[n]<=5)
        {
            int fr[6];
            for(int i=0;i<6;i++)
                fr[i]=0;
            int sum2=0;
            for(int i=1;i<=n;i++)
            {
                fr[a[i]]++;
                sum2+=a[i]-a[i]%2;
            }
            if((fr[2]+fr[3]+2*fr[4]+2*fr[5])%2==1)///daca punem 2 prima oara
            {
                cout<<1;
                continue;
            }
            if((fr[4]+fr[5])%2==1)
            {
                cout<<1;
                continue;
            }
            cout<<0;
            continue;
        }
        else
        {
            bool bl=0;
            while(k>0)
            {
                int aux=0;
                k/=2;
                if(k==0)
                    break;
                for(int i=1;i<=n;i++)
                {
                    a[i]/=2;
                    aux+=a[i];
                }
                if(aux%2==1)
                {
                    bl=1;
                    break;
                }
            }
            if(bl)
                cout<<1;
            else
                cout<<0;
        }
    }

    return 0;
}
/**

*/

Subtask #1
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 1364 KB Output is correct
2 Correct 15 ms 1424 KB Output is correct
3 Correct 14 ms 1364 KB Output is correct
4 Correct 15 ms 1368 KB Output is correct

Subtask #2
8.0 / 8.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 996 KB Output is correct
2 Correct 19 ms 980 KB Output is correct
3 Correct 19 ms 976 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 1996 KB Output is correct
2 Correct 37 ms 2008 KB Output is correct
3 Correct 32 ms 2032 KB Output is correct

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 1364 KB Output is correct
2 Correct 18 ms 1432 KB Output is correct
3 Correct 14 ms 1356 KB Output is correct

Subtask #7
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 1364 KB Output is correct
2 Correct 14 ms 1416 KB Output is correct
3 Correct 16 ms 1344 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 1444 KB Output is correct
2 Correct 16 ms 1372 KB Output is correct