제출 #1151303

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1151303		asdasd	Table Tennis (info1cup20_tabletennis)	C++20	100 / 100	51 ms	4284 KiB

tabletennis

#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define pb push_back
#define pf push_front
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define tm (tl+tr)/2
#define TL v+v, tl, tm
#define TR v+v+1, tm+1, tr
#define DA l <= tl && tr <= r
#define NE r < tl || tr < l
#define double long double
#define int long long
using namespace std;

const int N=2e5+7;
const int mod=998244353;
const int inf=2e9;

int a[N];
int n, k;

bool can(int l, int r){
	if(l+1 > r)return 0;
	int cnt=n/2;
	int sum=a[l]+a[r];
	vector<int>v;
	int cnt2=l-1+n+k-r;
	while(cnt && l < r){
		if(sum == a[l]+a[r]){
			v.pb(a[l]);
			v.pb(a[r]);
			cnt--;
			l++;
			r--;
		}
		else if(sum < a[l]+a[r])r--, cnt2++;
		else if(a[l]+a[r] < sum)l++, cnt2++;
		if(cnt2 > k)break;
	}
	if(cnt==0){
		sort(all(v));
		for(int i : v){
			cout << i << ' ';
		}
		return 1;
	}
	return 0;
}
void solve(){
	cin >> n >> k;
	for(int i=1; i <= n+k; i++){
		cin >> a[i];
	}
	for(int i=0; i <= k; i++){
		for(int j=0; i+j <= k; j++){
			if(can(1+i, n+k-j))return;
		}
	}
}
signed main(){

	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int asd=1;
	// cin >> asd;

	while(asd--)
		solve();
	
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