Submission #687522

#	Time	Username	Problem	Language	Result	Execution time	Memory
687522		vlad_TT	Table Tennis (info1cup20_tabletennis)	C++17	20 / 100	171 ms	24076 KiB

tabletennis

///solutie rares
#include <iostream>
#include <algorithm>
#include <unordered_map>
 
using namespace std;
long long v[150405];
unordered_map <long long,long long> f;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n,k,suma;
    cin>>n>>k;
    for(int i=1;i<=n+k;i++)
    {
        cin>>v[i];
        f[v[i]]+=1;
    }
    ///cazul in care nu eliminam nici 1, nici n+k
    ///sort(v+1,v+k+n);
    suma=v[1]+v[n+k];
    int eliminat,cnteliminat=0;
    ///cout<<"suma="<<suma<<"\n";
    for(int i=2;i<n+k;i++)
    {
        if(f[suma-v[i]]==0||v[i]*2==suma)
        {
            cnteliminat++;
            ///cout<<"nu merge "<<v[i]<<"\n";
            eliminat=v[i];
        }
    }
    if(cnteliminat==1)
    {
        for(int i=1;i<=n+k;i++)
        {
            if(f[suma-v[i]]==1&&v[i]*2!=suma)
            cout<<v[i]<<" ";
        }
    }
    else
    {
        ///eliminam pe primul numar
        cnteliminat=0;
        suma=v[2]+v[n+k];
        for(int i=2;i<n+k;i++)
        {
            if(f[suma-v[i]]==0||v[i]*2==suma)
            {
                cnteliminat++;
                ///cout<<"nu merge "<<v[i]<<"\n";
                eliminat=v[i];
            }
        }
        if(cnteliminat==0)
        {
            for(int i=2;i<=n+k;i++)
                cout<<v[i]<<" ";
        }
        else
        {
            for(int i=1;i<n+k;i++)
                cout<<v[i]<<" ";
        }
    }
    return 0;
}

Compilation message (stderr)

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:24:9: warning: variable 'eliminat' set but not used [-Wunused-but-set-variable]
   24 |     int eliminat,cnteliminat=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