Submission #524592

#	Time	Username	Problem	Language	Result	Execution time	Memory
524592		maks007	Table Tennis (info1cup20_tabletennis)	C++14	0 / 100	29 ms	3136 KiB

tabletennis

#include <bits/stdc++.h>
 
using namespace std;
 #define break_it assert(false)
int main(void) {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n, k;
	cin >> n >> k;
	vector <int> a(n+k);
	function <int(vector <int>)> check=[&](vector <int> s) {
		for(int i = 0; i < n; i ++) {
			int j = i + 1;
			if(j >= n or n - i - 1 < 0 or n - j - 1 < 0) break;
			if(s[i] + s[n-i-1] == s[j]+s[n-j-1]) continue;
			return 0;
		}
		return 1;
	};
	function <void(int, int)> solve=[&](int start, int end) {
		vector <int> fors;
		
		int sum = a[start] + a[end];
		int none = -1;
		for(int i = 0; i <= n+k-1; i ++) {
			if(i + 1 > end or n - i - 1 < start) break;
			if(a[i] + a[n-i-1] > sum) {
				none = n - i - 1;
				break;
			}else if(a[i] + a[n-i-1] < sum) {
				none = i;
				break;
			}
		}
		if(none == -1) {
			none = (n+k)/2+1;
		}
		for(int i = 0; i <= n+k-1; i ++) {
			if(none == i) continue;
			fors.push_back(a[i]);
		}
		if(check(fors)) {
		//	cout << start << " " << end << endl;
			for(auto i : fors) cout << i << " ";
			exit(0);
		}
	};	
	for(int i = 0; i < n+k; i ++) cin >> a[i];
	solve(0, n+k-1);
	solve(0, n+k-2);
	solve(1, n+k-1);
	break_it;
	return false;
}  

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