Submission #549736

#	Time	Username	Problem	Language	Result	Execution time	Memory
549736		SlyGaleeb	Table Tennis (info1cup20_tabletennis)	C++17	0 / 100	3089 ms	14380 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<int> &v) {
	for (auto c:v)
		cout << c << " ";
	cout << "\n";
}
 
map<pair<int,int>,int>mp1;
map<pair<int,int>,int>mp2;
 
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
 
	int n,k;
	ll a;
	cin >> n >> k;
	multiset<ll>v,temp;
	for (int i = 0; i < n+k; ++i) {
		cin >> a;
		v.insert(a);
	}
	temp = v;
	for (auto it = temp.begin(); it != temp.end(); ++it) {
		bool flag = true;
		temp.erase(it);
		auto d = (--temp.end());
		ll sum = *temp.begin()+*d;
		d--;
		int cnt = 2;
		for (auto c = ++temp.begin(); cnt <= n/2; ++c) {
			if (*c+*d!=sum) {
				flag = false;
				break;
			}
			d--;
			cnt++;
		}
		if (flag)
			break;
		temp = v;
	}
	for (auto c:temp)
		cout << c << " ";
}

• 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