Submission #518295

#	Time	Username	Problem	Language	Result	Execution time	Memory
518295		Ronin13	Table Tennis (info1cup20_tabletennis)	C++14	24 / 100	3082 ms	674288 KiB

tabletennis

#include<bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pb push_back
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define epb emplace_back
#define inf 1e9+1
#define linf 1e18+11
using namespace std;

unordered_map<int,pii>used;
int dp[1001][150001];
int main(){
    int n;cin>>n;
    int k;cin>>k;
    int a[n+k+1];
    for(int i=1;i<=n+k;i++){
        cin>>a[i];
    }
    for(int i=0;i<=min(n+k,2*k);i++){
        for(int j=0;j<=n+k;j++)dp[i][j]=-inf;
    }
    dp[0][0]=0;
    sort(a+1,a+1+n+k);
    for(int i=min(2*k,k+n);i>=1;i--){
        for(int j=i+1;j<=n+k;j++){
            int x=a[i]+a[j];
            dp[i][j]=dp[used[x].f][used[x].s]+2;
        }
        for(int j=i+1;j<=n+k;j++){
            int x=a[i]+a[j];
            used[x]={i,j};
        }
    }
    int val=0;
    for(int i=1;i<=min(2*k,n+k);i++){
        for(int j=1;j<=n+k;j++){
           // cout<<dp[i][j]<<' ';
            if(dp[i][j]>=n){
                val=a[i]+a[j];
                break;
            }
        }
        if(val)break;
        //cout<<"\n";
    }
    int l=1,r=n+k;
    vector<int>vec;
    while(l<r){
        if(vec.size()==n)break;
        int ss=a[l]+a[r];
        if(ss==val){
            vec.pb(a[l]);
            vec.pb(a[r]);
            l++;
            r--;
            continue;
        }
        if(ss>val){
            r--;
            continue;
        }
        l++;
        continue;
    }
    sort(vec.begin(),vec.end());
    for(int to:vec)cout<<to<<' ';
}

Compilation message (stderr)

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:53:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   53 |         if(vec.size()==n)break;
      |            ~~~~~~~~~~^~~

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