Submission #675159

#	Time	Username	Problem	Language	Result	Execution time	Memory
675159		TranGiaHuy1508	Table Tennis (info1cup20_tabletennis)	C++17	100 / 100	1833 ms	39056 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;
 
	// 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];
	// 	}
	// }

	for (int i = 0; i < k*2; i++){
		for (int j = max(i+1, n - k); j < n+k; j++){
			mp[v[i] + v[j]]++;
		}
	}
 
	// s[crr++] = 2'000'000'010;
	sort(s.begin(), s.begin() + crr);

	set<int> tmp;
	for (auto i: v) tmp.insert(i);

	for (auto [key, value]: mp){
		if (value < min(k, n/2)) continue;
		
		vector<int> res;
		
		for (auto i: tmp){
			if (i >= key - i) break;
			if (tmp.count(key - i)) res.push_back(i);
			if ((int)res.size() >= n/2) break;
		}

		if ((int)res.size() < n/2) continue;

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

• 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