# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
690925 | vladilius | Table Tennis (info1cup20_tabletennis) | C++17 | 3088 ms | 29608 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;
using ll = long long;
bool check(vector<ll> a){
int n = a.size();
ll k = a[0] + a.back();
for (int i = 1; i < n - i - 1; i++){
if (a[i] + a[n - i - 1] != k){
return false;
}
}
return true;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k; cin>>n>>k;
vector<ll> a(n + k);
map<ll, int> cnt;
for (int i = 0; i < n + k; i++){
cin>>a[i];
cnt[a[i]]++;
}
int len = n + k;
for (int i = 0; i < len; i++){
for (int j = i + 1; j < len; j++){
ll s = a[i] + a[j];
map<ll, int> cp = cnt;
vector<ll> ans;
for (int x = 0; x < len; x++){
if (cp[x] > 0){
cp[x]--;
if (cp[s - x] > 0){
cp[s - x]--;
ans.push_back(x);
ans.push_back(s - x);
}
}
}
if (ans.size() >= n){
for (int x = 0; 2*x < n; x++){
cout<<ans[2*x]<<" ";
}
for (int x = 0; 2*x < n; x++){
cout<<ans[n - 2*x - 1]<<" ";
}
return 0;
}
}
}
}
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... |