Submission #475221

#	Time	Username	Problem	Language	Result	Execution time	Memory
475221		bigo	Table Tennis (info1cup20_tabletennis)	C++14	20 / 100	3076 ms	4556 KiB

tabletennis

#include <iostream>
#include <vector>		
#include <cmath>
#include <set>
using namespace std;
#define pii pair<int, int>
vector<vector<int>>vec;
vector<bool>visit;
int main() {
	int n, k;
	cin >> n >> k;
	vector<int>vec(n+k);
	for (int i = 0; i < n + k; i++) {
		cin >> vec[i];
	}
	for (int i = 0; i < n + k; i++) {
		vector<int>tmp(0);
		for (int j = 0; j < n + k; j++) {
			if (j != i) {
				tmp.push_back(vec[j]);
			}
		}
		int tmp2 = tmp[0]+tmp[n-1];
		bool flag = true;
		for (int j = 1; j <=n/2-1; j++) {
			if (tmp[j]+tmp[n-1-j] != tmp2) {
				flag = false;
				break;
			}
		}
		if (flag) {
			for (int j = 0; j < n; j++)
				cout << tmp[j] << " ";
			break;
		}
	}
}

• Subtask 1: 11 / 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