제출 #524373

#제출 시각아이디문제언어결과실행 시간메모리
524373maks007Table Tennis (info1cup20_tabletennis)C++14
11 / 100
3070 ms4508 KiB
#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]; 
	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;
		}
	}
	
	return false;
}  
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...