/*
* author: NeroZein
* created: 01.02.2023 12:23:57
*/
#include <bits/stdc++.h>
using namespace std;
#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif
const int N = (int) 2e9 + 9;
bitset<N> mp;
signed main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<int> a(n + k);
for (int i = 0; i < n + k; ++i) {
cin >> a[i];
mp[a[i]] = 1;
}
sort(a.begin(), a.end());
for (int i = 0; i <= k; ++i) {
for (int j = n + k - 1; j > i; --j) {
int cnt = i + (n + k - j - 1);
if (cnt > k) {
break;
}
int tar = a[i] + a[j];
for (int x = i + 1; x < j; ++x) {
if (mp[tar - a[x]] == 0) {
cnt++;
}
}
if (cnt == k) {
vector<int> ans;
for (int x = i; x <= j; ++x) {
if (mp[tar - a[x]]) {
ans.push_back(a[x]);
}
}
for (int x : ans) {
cout << x << ' ';
}
return 0;
}
}
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
852 KB |
Output is correct |
2 |
Correct |
1 ms |
1108 KB |
Output is correct |
3 |
Correct |
1 ms |
1364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
27 ms |
49700 KB |
Output is correct |
2 |
Correct |
57 ms |
67264 KB |
Output is correct |
3 |
Correct |
59 ms |
67332 KB |
Output is correct |
4 |
Correct |
63 ms |
67620 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
59 ms |
63180 KB |
Output is correct |
2 |
Correct |
56 ms |
67476 KB |
Output is correct |
3 |
Correct |
71 ms |
72552 KB |
Output is correct |
4 |
Correct |
69 ms |
68236 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
980 KB |
Output is correct |
2 |
Correct |
2 ms |
468 KB |
Output is correct |
3 |
Correct |
3 ms |
1040 KB |
Output is correct |
4 |
Correct |
3 ms |
724 KB |
Output is correct |
5 |
Correct |
3 ms |
980 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
468 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
596 KB |
Output is correct |
2 |
Correct |
2 ms |
596 KB |
Output is correct |
3 |
Correct |
3 ms |
1492 KB |
Output is correct |
4 |
Correct |
3 ms |
1096 KB |
Output is correct |
5 |
Correct |
3 ms |
1620 KB |
Output is correct |
6 |
Correct |
12 ms |
7636 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
596 KB |
Output is correct |
2 |
Correct |
442 ms |
67332 KB |
Output is correct |
3 |
Correct |
71 ms |
65524 KB |
Output is correct |
4 |
Correct |
205 ms |
69712 KB |
Output is correct |
5 |
Correct |
66 ms |
68212 KB |
Output is correct |
6 |
Correct |
51 ms |
6588 KB |
Output is correct |
7 |
Correct |
211 ms |
90184 KB |
Output is correct |
8 |
Correct |
68 ms |
72520 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
2132 KB |
Output is correct |
2 |
Execution timed out |
3072 ms |
65424 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |