제출 #675101

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
675101		TranGiaHuy1508	Table Tennis (info1cup20_tabletennis)	C++17	15 / 100	955 ms	770940 KiB

tabletennis

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

void main_program();

signed main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
	main_program();
}

int n, k;
vector<int> v;
// map<int, int> mp;
vector<int> s;

void main_program(){
	cin >> n >> k;
	v.resize(n + k); for (auto &i: v) cin >> i;

	s.resize((n+k) * k * 2 + 100);
	int crr = 0;
	int lim = n/2;

	if (n + k < 4 * k){
		for (int i = 0; i < n+k; i++){
			// X = (n+k-1) - j
			// i-k <= X <= i+k
			// i-k <= (n+k-1) - j <= i+k
			// j <= (n+k-1) + k - i
			// j >= (n+k-1) - k - i

			int lb = max(i+1, (n+k-1) - k - i), rb = min(n+k-1, (n+k-1) + k - i);
			for (int j = lb; j <= rb; j++){
				// cout << ":: " << i << " " << j << "\n";
				// mp[v[i] + v[j]]++;
				s[crr++] = v[i] + v[j];
			}
		}
	}
	else{
		lim = k;
		for (int i = 0; i < k * 2; i++){
			for (int j = n+k - 1; j >= n-k; j++){
				s[crr++] = v[i] + v[j];
			}
		}
	}

	s[crr++] = 2'000'000'010;
	sort(s.begin(), s.begin() + crr);

	int ttcnt = 0;
	int prev = -1;

	for (int _i = 0; _i < crr; _i++){
		if (s[_i] != prev){
			prev = s[_i]; ttcnt = 0;
		}
		if (s[_i] == prev) ttcnt++;

		if (ttcnt >= lim){
			set<int> tmp;
			for (auto i: v) tmp.insert(i);

			vector<int> res;

			for (auto i: tmp){
				if (tmp.count(prev - i)) res.push_back(i);
				if ((int)res.size() >= n/2) break;
			}

			for (int i = 0; i < n/2; i++) cout << res[i] << " ";
			for (int i = n/2 - 1; i >= 0; i--) cout << prev - res[i] << " ";
			cout << "\n";
			return;
		}
	}
}

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