# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
549742 | SlyGaleeb | Table Tennis (info1cup20_tabletennis) | C++17 | 788 ms | 1048576 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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<vector<ll>>subsets;
void gen(vector<ll> &subset, int i, vector<ll> &nums) {
if (i==nums.size()) {
subsets.push_back(subset);
return;
}
gen(subset,i+1,nums);
subset.push_back(nums[i]);
gen(subset,i+1,nums);
subset.pop_back();
}
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];
vector<ll>empty;
gen(empty,0,v);
for (auto c:subsets) {
if (c.size()==n) {
bool flag = true;
ll sum = c[0]+c[n-1];
for (int i = 1; i < n-1; ++i) {
if (c[i]+c[n-1-i]!=sum) {
flag = false;
break;
}
}
if (flag) {
print(c);
break;
}
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |