# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
745806 | vjudge1 | Table Tennis (info1cup20_tabletennis) | C++17 | 3065 ms | 65836 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;
map<int, int> m;
vector<int> scores;
int n, k;
bool possible(int a, int b){
int sum = scores[a] + scores[b];
vector<int> square;
for (int i=a; i<n+k; i++){
if (scores[i] * 2 < sum && m[sum - scores[i]]){
square.push_back(scores[i]);
}
}
if (square.size() < n/2) return false;
sort(square.begin(), square.end());
for (int i=0; i<n/2; i++){
cout << square[i] << " ";
}
for (int i=n/2-1; i>=0; i--){
cout << sum - square[i] << " ";
}
}
int main()
{
cin >> n >> k;
scores.resize(n+k);
for (int i=0; i<n+k; i++){
cin >> scores[i];
m[scores[i]]++;
}
for (int i=0; i<=k; i++){
for (int j=i+1; j<n+k; j++){
if (possible(i, j)){
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... |