제출 #1104767

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1104767		abushbandit_	Table Tennis (info1cup20_tabletennis)	C++17	87 / 100	3081 ms	11600 KiB

tabletennis

#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")

#include "bits/stdc++.h"

using namespace std;

//~ #ifndef ONLINE_JUDGE
//~ #include "debug.h"
//~ #else
//~ #define debug(...)
//~ #define debugArr(...)
//~ #endif

#define int long long
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define pb push_back

template<class T, class U> inline bool chmin(T& a, const U& b) { if (a > b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmax(T& a, const U& b) { if (a < b) { a = b; return true; } return false; }

const int inf = 1e9;
const int mod = 1e9 + 7;
const int N = 1e5 + 5;

void solve() {
	
	int n,k;
	cin >> n >> k;
	int m = n;
	n += k;
	int a[n + 1];
	for(int i = 1;i <= n;i++) cin >> a[i];
	sort(a + 1,a + n + 1);
	for(int l = 1;l <= k + 1;l++) {
		int rem = (k + 1) - l;
		for(int r = n;r >= n - rem;r--) {
			if(r - l + 1 < m) {
				continue;
			}
			int cnt = 0;
			int nl = l,nr = r;
			int sum = a[r] + a[l];
			while(l < r) {
				if(a[r] + a[l] == sum) {
					r--;
					l++;
					cnt += 2;
				} else if(a[r] + a[l] > sum) {
					r--;
				} else {
					l++;
				}
			}
			l = nl,r = nr;
			if(cnt == m) {
				set<int> ans;
				while(l < r) {
					if(a[r] + a[l] == sum) {
						ans.insert(a[r]);
						ans.insert(a[l]);
						r--;
						l++;
					} else if(a[r] + a[l] > sum) {
						r--;
					} else {
						l++;
					}
				}
				for(auto i : ans) cout << i << " ";
				return;
			}
		}
	}
	
}

signed main() {
	
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);cout.tie(nullptr);
	
	int t = 1;
	//~ cin >> t;
	while(t--) {
		solve();
	}
	
	
}

• 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: 0 / 13