# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
524823 | maks007 | Table Tennis (info1cup20_tabletennis) | C++14 | 3093 ms | 4288 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;
#define break_it assert(false)
#define int long long
main(void) {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector <int> a(n+k);
for(int i = 0; i < n +k; i ++) cin >> a[i];
function <void(int,int, int)> check=[&](int sum, int start, int end) {
vector <int> ans;
ans.push_back(a[start-1]);
ans.push_back(a[end+1]);
int l = start, r = end;
while(l < r) {
if(a[l] + a[r] == sum) {
ans.push_back(a[l]);
ans.push_back(a[r]);
l ++;
r --;
}else if(a[l] + a[r] > sum) {
r--;
}else l ++;
if(ans.size() == n) break;
}
if(ans.size() == n) {
sort(ans.begin(), ans.end());
for(auto i : ans) cout << i << " ";
exit(0);
}
};
map <int,int> mp;
vector <int> candidate;
for(int i = 0; i < k; i ++) {
for(int j = n-1+i; j < n+k; j ++) {
check(a[i] + a[j], i+1, j-1);
}
}
return false;
}
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... |