#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int) (x).size()
#define all(x) (x).begin(), (x).end()
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define tern(cond, a, b) (cond ? a : b)
typedef long long lint;
typedef pair<lint,lint> ii;
int n, K;
vector<int> arr;
unordered_map<int,int> M;
int main(){
ios_base::sync_with_stdio(false); cin.tie(0);
M.reserve(4096);
M.max_load_factor(0.25);
cin >> n >> K;
n += K;
arr.resize(n);
for(int i = 0;i < n;i++) cin >> arr[i];
for(int i = K+1;i <= n-K-1;i++){
int other = n-i;
for(int j = max(other-K*2-5,0);j <= min(n-1, other+2*K+5);j++){
if(i != j) M[arr[i]+arr[j]]++;
}
}
for(int s = 0;s <= K+1;s++){
for(int e = n-1;e >= n-K-1;e--){
if(s + (n-1)-e > K) continue;
int str = arr[s]+arr[e];
deque<int> ans;
for(int i = s;i < K+1;i++){
auto it = lower_bound(all(arr), str-arr[i]);
if(it == arr.end()) continue;
if(*it == str-arr[i] and arr[i] != str-arr[i]) ans.push_back(arr[i]);
}
for(int i = n-K;i <= e;i++){
auto it = lower_bound(all(arr), str-arr[i]);
if(it == arr.end()) continue;
if(*it == str-arr[i] and arr[i] != str-arr[i]) ans.push_back(arr[i]);
}
if(sz(ans) + M[str] >= n-K){
ans.clear();
for(int i = s;i <= e;i++){
auto it = lower_bound(all(arr), str-arr[i]);
if(it == arr.end()) continue;
if(*it == str-arr[i] and arr[i] != str-arr[i]) ans.push_back(arr[i]);
}
while(sz(ans) > n-K){
ans.pop_front();
ans.pop_back();
}
for(int x : ans) cout << x << " ";
return 0;
}
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
332 KB |
Output is correct |
2 |
Correct |
2 ms |
380 KB |
Output is correct |
3 |
Correct |
2 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
11 ms |
668 KB |
Output is correct |
2 |
Correct |
144 ms |
7596 KB |
Output is correct |
3 |
Correct |
147 ms |
7548 KB |
Output is correct |
4 |
Correct |
152 ms |
7536 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
94 ms |
2976 KB |
Output is correct |
2 |
Correct |
103 ms |
6832 KB |
Output is correct |
3 |
Correct |
91 ms |
3100 KB |
Output is correct |
4 |
Correct |
102 ms |
6788 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
11 ms |
844 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
11 ms |
588 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
0 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
4 ms |
404 KB |
Output is correct |
3 |
Correct |
28 ms |
9696 KB |
Output is correct |
4 |
Correct |
7 ms |
1472 KB |
Output is correct |
5 |
Correct |
5 ms |
332 KB |
Output is correct |
6 |
Correct |
4 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
2116 ms |
39868 KB |
Output is correct |
3 |
Correct |
838 ms |
39836 KB |
Output is correct |
4 |
Correct |
363 ms |
3936 KB |
Output is correct |
5 |
Correct |
759 ms |
39820 KB |
Output is correct |
6 |
Correct |
313 ms |
2984 KB |
Output is correct |
7 |
Correct |
346 ms |
4944 KB |
Output is correct |
8 |
Correct |
313 ms |
3976 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
356 KB |
Output is correct |
2 |
Execution timed out |
3058 ms |
327772 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |