oj.uz

Submission #933827

# Submission time Handle Problem Language Result Execution time Memory
933827 2024-02-26T11:28:26 Z AliHasanli Table Tennis (info1cup20_tabletennis) C++17
20 / 100
 52 ms 4532 KB 
#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.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 600 KB Output is correct
2 Correct 52 ms 4532 KB Output is correct
3 Correct 50 ms 4384 KB Output is correct
4 Correct 51 ms 4436 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 50 ms 2944 KB Output does not have symmetry property
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Extra information in the output file
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Extra information in the output file
2 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Extra information in the output file
2 Halted 0 ms 0 KB -

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Extra information in the output file
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Extra information in the output file
2 Halted 0 ms 0 KB -