제출 #926997

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
926997		blacktulip	Table Tennis (info1cup20_tabletennis)	C++17	0 / 100	3065 ms	1628 KiB

tabletennis

#include <bits/stdc++.h>

using namespace std;

#define ort ((bas+son)/2)
#define int long long
#define endl "\n"

int n,k,a[150005],ind;

inline bool check(int l,int r,int sum){
	int say=0;
	while(l<r){
		if(a[l]+a[r]==sum){
			l++;
			r--;
			say++;
		}
		else if(a[l]+a[r]<sum){
			ind=l;
			l++;
		}
		else{
			ind=r;
			r--;
		}
	}
	if(l==r)ind=l;
	if(say>=n/2)return 1;
	return 0;
}

int32_t main(void){
	ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	cin>>n>>k;
	for(int i=1;i<=n+k;i++)cin>>a[i];
	if(check(1,n+k,a[1]+a[n+k])){
		for(int i=1;i<ind;i++)cout<<a[i]<<" ";
		for(int i=ind+1;i<=n+k;i++)cout<<a[i]<<" ";
		//~ cout<<"**\n";
		//~ cout<<ind<<endl;
		return 0;
	}
	if(check(1,n+k-1,a[1]+a[n+k-1])){
		for(int i=1;i<n+k;i++)cout<<a[i]<<" ";
		return 0;
	}
	if(check(2,n,a[2]+a[n+k])){
		for(int i=2;i<=n+k;i++)cout<<a[i]<<" ";
		return 0;
	}
	while(1){}
	return 0;
}

• 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