제출 #365639

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
365639		amunduzbaev	Table Tennis (info1cup20_tabletennis)	C++14	29 / 100	47 ms	4480 KiB

tabletennis

/** made by amunduzbaev **/
#include <bits/stdc++.h>
using namespace std;
 
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define NeedForSpeed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vv vector
#define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii; 
typedef pair<ll, ll> pll; 
typedef vector<ll> vll;
typedef vector<int> vii;
typedef vector<pll> vpll;
typedef vector<pii> vpii;
typedef pair<int, pii> ipii;
typedef pair<pii, int> piii;
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
 
const int N = 2e5+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
 
#define MULTI 0
 
int n, m, k, ans, res, a[N];

void solve(int t_case){
	cin>>n>>k;
	for(int i=0;i<n+k;i++) cin>>a[i];
	sort(a, a+n+k);
	int cur = -1, ok = 1;;
	for(int i=1;i<=n/2 && ok;i++){
		if(cur == -1) cur = a[i] + a[n-i+1];
		else if(a[i] + a[n-i+1] != cur) ok = 0;
	}
	if(ok){
		for(int i=1;i<=n;i++) cout<<a[i]<<" ";
		cout<<"\n";
		return;
	}
	ok = 1, cur=-1;
	for(int i=0;i<n/2 && ok;i++){
		if(cur == -1) cur = a[i] + a[n-i-1];
		else if(a[i] + a[n-i-1] != cur){ ok = 0; }
	}
	if(ok){
		for(int i=0;i<n;i++) cout<<a[i]<<" ";
		cout<<"\n";
		return;
	}
	ok = 1, cur = a[0] + a[n];
	int bad = n/2;
	for(int i=1;i<n/2;i++){
		//cout<<a[i] + a[n-i]<<" "<<cur<<"\n";
		if(a[i] + a[n-i] != cur){
			if(a[i] + a[n-i-1] == cur) { bad = n-i; break; }
			else if(a[i+1] + a[n-i] == cur) { bad = i; break; }
		}
	}
	for(int i=0;i<=n;i++){
		if(i == bad) continue;
		cout<<a[i]<<" ";
	}cout<<"\n";
}
	
signed main(){
	NeedForSpeed
	if(!MULTI) {
		solve(1);
	} else {
		int t; cin>>t;
		for(int t_case = 1; t_case <= t; t_case++) solve(t_case);
	}
	return 0;
}

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