Submission #921399

#	Time	Username	Problem	Language	Result	Execution time	Memory
921399		maxFedorchuk	Table Tennis (info1cup20_tabletennis)	C++17	0 / 100	14 ms	3160 KiB

tabletennis

#include "bits/stdc++.h"
using namespace std;

const long long MX=2e5+10;

long long vis[MX];
long long a[MX];

long long n,k;

bool ok=0;

void solve(long long sum,long long nm)
{
    long long l=1,r=n+k,kpr=0,kg=0;

    while(l<r)
    {
        if((a[l]+a[r])<sum)
        {
            l++;
            kpr++;
        }
        else
        {
            if((a[l]+a[r])==sum)
            {
                vis[l]=vis[r]=nm;
                l++;
                r--;
                kg+=2;
            }
            else
            {
                if((a[l]+a[r])>sum)
                {
                    r--;
                    kpr++;
                }
            }
        }

        if(kpr>k)
        {
            return;
        }

        if(kg==n)
        {
            /*
            for(long long i=1;i<=n;i++)
            {
                if(vis[i]==nm)
                {
                    cout<<a[i]<<" ";
                }
            }
             */
            
            cout<<2<<"\n";

            ok=1;
            return;
        }
    }
}

int main()
{
    cin.tie(0);
    ios_base::sync_with_stdio(0);

    cin>>n>>k;

    for(long long i=1;i<=n+k;i++)
    {
        cin>>a[i];
    }

    for(long long i=1,uk=1;(i<=(k+1) && (!ok));i++,uk++)
    {
        for(long long j=max(n,i+1);(j<=n+k && (!ok));j++,uk++)
        {
            solve(a[i]+a[j],uk);
        }
    }

    return 0;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 9
• Subtask 3: 0 / 14
• Subtask 4: 0 / 15
• Subtask 5: 0 / 9
• Subtask 6: 0 / 14
• Subtask 7: 0 / 15
• Subtask 8: 0 / 13