Submission #1136063

#	Time	Username	Problem	Language	Result	Execution time	Memory
1136063		bpptidp	Table Tennis (info1cup20_tabletennis)	C++20	100 / 100	83 ms	3260 KiB

tabletennis

#include<bits/stdc++.h>
using namespace std;
using ll=long long;

//JEBAO ME OJUZ VEC 15 MINUTA POKUSAVAM DA POSALJEM

const int N=1.5e5,K=405;
int a[N+K],n,k;

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
 	
    cin>>n>>k;
    for(int i=0;i<n+k;++i)
    	cin>>a[i];

    for(int i=0;i<=k;++i){
    	for(int j=i+n-1;j<n+k;++j){
    		int x=a[i]+a[j],l=i+1,r=j-1,br=1,losi=0;
    		while(l<r&&losi<=k&&br<n/2){
    			if(a[l]+a[r]==x)++l,--r,++br;
    			else if(a[l]+a[r]<x)++l,++losi;
    			else --r,++losi;
    		}
    		if(br>=n/2){
    			vector<int>v={a[i],a[j]};
    			l=i+1,r=j-1;
    			while(l<r){
    				if(a[l]+a[r]==x){
    					v.push_back(a[l]);
    					v.push_back(a[r]);
    					++l,--r;
    				}else if(a[l]+a[r]<x)++l;
    				else --r;
    			}
    			sort(v.begin(),v.end());
    			for(int i=0;i<n;++i)cout<<v[i]<<' ';
    			return 0;
    		}
    	}
    }
}

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