Submission #366188

#	Time	Username	Problem	Language	Result	Execution time	Memory
366188		Ahmad_Hasan	Table Tennis (info1cup20_tabletennis)	C++17	0 / 100	3106 ms	423404 KiB

tabletennis

#include <bits/stdc++.h>
#define int long long
/**
     ||||||||||       |||||     |||||    ||||||||||
    |||||||||||||     |||||     |||||  |||||
   ||||     ||||||    |||||     |||||  |||||
  |||||||||||||||||   |||||||||||||||    ||||||||||
 |||||||||||||||||||  |||||||||||||||           |||||
 |||||         |||||  |||||     |||||           |||||
 |||||         |||||  |||||     |||||    ||||||||||
AHMED;HASSAN;SAEED;
*/

using namespace std;

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);      cout.tie(0);
    int n,k;
    cin>>n>>k;
    vector<int>v(n+k);

    int nn=n+k;
    for(int i=0;i<nn;i++){
        cin>>v[i];
    }

    map<int,int >mp,mp2;
    vector<vector<pair<int,int> > >pos((k+5)*(k+5));
    int cr=1;
    for(int i=0;i<nn&&i<k+5;i++){
        mp2[v[i]]=i+1;
        for(int j=nn-1;j>=0&&(n-1-j)<=k+5;j--){
            if(!mp[v[i]+v[j]])mp[v[i]+v[j]]=cr++;
        }
    }
    int mxi=0;
    for(map<int,int>::iterator it=mp.begin();it!=mp.end();it++){
        for(int i=0;i<nn;i++){
            int vl=mp2[(it->first)-v[i]];
            if(vl>i+1){
                pos[it->second].push_back({i,vl-1});
                if(pos[it->second].size()>pos[mxi].size())
                    mxi=it->second;
            }

        }
    }
    vector<int>ans;
    for(int i=0;i<pos[mxi].size()&&i<n/2;i++){
        ans.push_back(v[pos[mxi][i].first]);
        ans.push_back(v[pos[mxi][i].second]);
    }

    sort(ans.begin(),ans.end());
    for(int i=0;i<n;i++)
        cout<<ans[i]<<' ';

    return 0;
}

Compilation message (stderr)

tabletennis.cpp: In function 'int32_t main()':
tabletennis.cpp:51:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |     for(int i=0;i<pos[mxi].size()&&i<n/2;i++){
      |                 ~^~~~~~~~~~~~~~~~

• 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