Submission #524416

#	Time	Username	Problem	Language	Result	Execution time	Memory
524416		maks007	Table Tennis (info1cup20_tabletennis)	C++14	9 / 100	27 ms	2616 KiB

tabletennis

#include <bits/stdc++.h>
 
using namespace std;
 #define break_it (1/0)
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;
	};
	for(int i = 0; i < n+k; i ++) cin >> a[i];
/*	if(k == 1) { 
		for(int i = 0; i < n + k; i ++) {
			vector <int> v;
			for(int j = 0; j < n + k; j ++) {
				if(i == j) continue;
				v.push_back(a[j]);
			}
			if(check(v)){
				for(auto i : v) cout << i << " ";
				return false;
			}
		}
	}else if(n+k<=18) {
		for(int mask = 0; mask < (1 << (n+k)); mask ++) {	
			if(__builtin_popcount(mask) == n) {
				vector <int> v;
				for(int i = 0; i < n+k; i ++) {
					if((mask & (1 << i))!=0) {
						v.push_back(a[i]);
					}
				}
				if(check(v)) {
					for(int i = 0; i < v.size(); i ++) cout << v[i] << " ";
					return false;
				}
			}
		}
	}else {
		int l = 0, r = n+k-1;
		while(1) {
			if(a[l] + a[r] == a[l+1]+a[r-1]) {

			}
		}
	}*/
	for(int i = 0; i < n; i ++) cout << a[i] << " ";
	return false;
}  

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