제출 #549741

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
549741		SlyGaleeb	Table Tennis (info1cup20_tabletennis)	C++17	11 / 100	1376 ms	1048576 KiB

tabletennis

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ld long double
#define vf v[i].first
#define vs v[i].second
const ll MOD = 1e9 + 7;
 
void print(vector<ll> &v) {
	for (auto c:v)
		cout << c << " ";
}
 
vector<ll>e[2005];
 
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
 
	int n,k;
	cin >> n >> k;
	vector<ll>v(n+k);
	for (int i = 0; i < n+k; ++i)
		cin >> v[i];
	for (int i = 0; i < n+k; ++i) {
		for (int j = 0; j < n+k; ++j) {
			if (i!=j)
				e[i].push_back(v[j]);
		}
	}
	for (int i = 0; i < n+k; ++i) {
		bool flag = true;
		ll sum = e[i][0]+e[i][n-1];
		for (int j = 1; j < n-1; ++j) {
			if (e[i][j]+e[i][n-1-j]!=sum) {
				flag = false;
				break;
			}
		}
		if (flag) {
			print(e[i]);
			break;
		}
	}
}

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