# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1001099 | kachim2 | Table Tennis (info1cup20_tabletennis) | C++17 | 3089 ms | 10112 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 <algorithm>
#include <bits/stdc++.h>
#include <cstdint>
#include <vector>
using namespace std;
vector<pair<int, int>> check_balanced(vector<int> in, int val) {
set<int> s;
for (int i : in){
s.insert(i);
}
vector<pair<int, int>> res;
for (int i : in){
if(s.count(val-i) && s.count(i) && i!=val-i){
s.erase(i);
s.erase(val-i);
res.emplace_back(i, val-i);
}
}
return res;
}
int main() {
int N, K;
cin >> N >> K;
vector<int> input(N+K);
for(int i = 0; i < N+K; i++){
cin >> input[i];
}
sort(input.begin(), input.end());
for(int i = 0; i < K; i++){
for(int j = 0; j + i < K; j++){
const int sp = N+K-j-1;
auto a = check_balanced(input, input[i]+input[j]);
if(a.size()>=N/2){
vector<int> out;
for(auto i : a){
out.push_back(i.first);
out.push_back(i.second);
}
sort(out.begin(), out.end());
for(int i : out){
cout << i <<' ';
}
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... |