Submission #491836

#	Time	Username	Problem	Language	Result	Execution time	Memory
491836		n3rm1n	Football (info1cup20_football)	C++17	26 / 100	10 ms	844 KiB

football

#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
const int MAXN=1e5+10;
void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}
int n,k;
int a[11];
short used[3][3][3][3][3][3][3][3][3][3][3];
/// 0 - not used
/// 1 - yes
/// 2 - no
void read()
{
    for(int i=1; i<=n; i++)
        cin>>a[i];
}
long long sum=0;
void read2()
{
    long long x;
    for(int i=1;i<=n;i++)
    {
        cin>>x;
        sum+=x;
    }
}
short wins(int s[11],int maxmove)
{
    maxmove=min(maxmove,3);
    //cout<<s[1]<<" "<<s[2]<<" "<<s[3]<<" "<<s[4]<<" "<<s[5]<<" "<<s[6]<<" "<<s[7]<<" "<<s[8]<<" "<<s[9]<<" "<<s[10]<<", moves: "<<maxmove<<":  "<<used[s[1]][s[2]][s[3]][s[4]][s[5]][s[6]][s[7]][s[8]][s[9]][s[10]][maxmove]<<endl;
    if(used[s[1]][s[2]][s[3]][s[4]][s[5]][s[6]][s[7]][s[8]][s[9]][s[10]][maxmove]!=0)
    {
        //cout<<s[1]<<" "<<s[2]<<" "<<s[3]<<" "<<s[4]<<" "<<s[5]<<" "<<s[6]<<" "<<s[7]<<" "<<s[8]<<" "<<s[9]<<" "<<s[10]<<", moves: "<<maxmove<<":  "<<used[s[1]][s[2]][s[3]][s[4]][s[5]][s[6]][s[7]][s[8]][s[9]][s[10]][maxmove]<<endl;
        return used[s[1]][s[2]][s[3]][s[4]][s[5]][s[6]][s[7]][s[8]][s[9]][s[10]][maxmove];
    }
    bool emptyy=true;
    for(int i=1; i<=n; i++)
    {
        if(s[i]!=0)emptyy=false;
    }
    if(emptyy==true)
    {
        used[0][0][0][0][0][0][0][0][0][0][maxmove]=2;
        return 2;
    }
    for(int i=1; i<=n; i++)
    {
        int old=s[i];
        for(int take=1; take<=min(s[i],maxmove); take++)
        {
            s[i]-=take;
            if(wins(s,take)==2)
            {
                s[i]=old;
                used[s[1]][s[2]][s[3]][s[4]][s[5]][s[6]][s[7]][s[8]][s[9]][s[10]][maxmove]=1;
                return used[s[1]][s[2]][s[3]][s[4]][s[5]][s[6]][s[7]][s[8]][s[9]][s[10]][maxmove];
            }
            s[i]=old;
        }
    }
    used[s[1]][s[2]][s[3]][s[4]][s[5]][s[6]][s[7]][s[8]][s[9]][s[10]][min(maxmove,3)]=2;
    return used[s[1]][s[2]][s[3]][s[4]][s[5]][s[6]][s[7]][s[8]][s[9]][s[10]][min(maxmove,3)];
}
int main()
{
    speed();
    int t;
    cin>>t;
    while(t--)
    {

        cin>>n>>k;
        if(k==1)
        {
            sum=0;
            read2();
            cout<<sum%2;
        }
        else
        {
            read();
            if(wins(a,k)==true)cout<<1;
            else cout<<0;
        }

    }
    cout<<endl;
    return 0;
}

• Subtask 1: 26 / 26
• Subtask 2: 0 / 8
• Subtask 3: 0 / 11
• Subtask 4: 0 / 8
• Subtask 5: 0 / 16
• Subtask 6: 0 / 16
• Subtask 7: 0 / 7
• Subtask 8: 0 / 8