Submission #933827

#	Time	Username	Problem	Language	Result	Execution time	Memory
933827		AliHasanli	Table Tennis (info1cup20_tabletennis)	C++17	20 / 100	52 ms	4532 KiB

tabletennis

#include<iostream>
using namespace std;
int b[150000];
int main()
{
    int n,k;
    long long cem=0;
    cin>>n>>k;
    long long a[n+k];
    for(int i=0;i<k+n;i++)
    {
        cin>>a[i];
        cem+=a[i];
    }
    bool check=true;
    long long komdeyer=(cem-a[0])/((n+k-1)/2);
    if((cem-a[0])%((n+k-1)/2)==0)
    {
        //cout<<"AA"<<endl;
        for(int i=1;i<n+k;i++)
            if(a[i]+a[n+k-i]!=komdeyer){check=false;break;}
    }
    if(check==true && (cem-a[0])%((n+k-1)/2)==0)
    {
        for(int i=1;i<n+k;i++)cout<<a[i]<<' ';
        return 0;
    }
    check=true;
    komdeyer=(cem-a[n+k-1])/((n+k-1)/2);
    if((cem-a[n+k-1])%((n+k-1)/2)==0)
        for(int i=0;i<n+k-1;i++)
            if(a[i]+a[n+k-i-2]!=komdeyer){check=false;break;}
    if(check && (cem-a[n+k-1])%((n+k-1)/2)==0)
    {
        for(int i=0;i<n+k-1;i++)cout<<a[i]<<' ';
        return 0;
    }
    for(int i=0;i<n+k;i++)
        if(a[i]==cem-(a[0]+a[n+k-1])*n/2)
        {
            b[i]=1;break;
        }
    for(int i=0;i<n+k;i++)
        if(b[i]==0)cout<<a[i]<<" ";
    return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 9 / 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