#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define all(m) (m).begin(), (m).end()
#define rall(m) (m).rbegin(), (m).rend()
#define vec vector
#define sz(a) (int) (a).size()
#define mpp make_pair
#define mtt make_tuple
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair <int, int> pii;
typedef tuple <int, int, int> tui;
template <typename T> bool umin(T &a, T b) { return a > b ? a = b, 1 : 0; }
template <typename T> bool umax(T &a, T b) { return a < b ? a = b, 1 : 0; }
mt19937 rng((uint64_t) new char);
int solve(){
int n, k;
cin >> n >> k;
int z = n + k;
vec <int> a(z);
for (auto &i: a) cin >> i;
set <int> s(all(a));
auto get_ans = [&](int x){
vec <int> ans;
for (int i = 0; i < z; ++i){
if (s.find(x - a[i]) != s.end() && n){
ans.push_back(a[i]);
ans.push_back(x - a[i]);
s.erase(a[i]), n -= 2;
}
}
assert(sz(ans) == z - k);
sort(all(ans));
for (auto &i: ans) cout << i << " ";
exit(0);
};
if (n <= k){
for (int i = 0; i < z; ++i){
for (int j = i + 1; j < z; ++j){
int x = a[i] + a[j];
int cnt = 0;
for (int l = 0; l < z; ++l){
cnt += s.find(x - a[l]) != s.end();
}
if (cnt >= n) get_ans(x);
}
}
return 0;
}
shuffle(all(a), rng);
while(true){
int ai = a[rng() % n];
for (auto &aj: a){
int x = ai + aj;
int cnt = 0;
for (int i = 0; i < min(z, 3 * k); ++i){
cnt += s.find(x - a[i]) != s.end();
}
if (cnt * 2 > k) get_ans(x);
}
}
return 0;
}
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int tst = 1; //cin >> tst;
while(tst--) solve();
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
724 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
10 ms |
2880 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
112 ms |
16496 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
27 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
15 ms |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
468 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Runtime error |
2 ms |
724 KB |
Execution killed with signal 6 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
568 ms |
10116 KB |
Output is correct |
3 |
Correct |
1976 ms |
10120 KB |
Output is correct |
4 |
Correct |
197 ms |
10116 KB |
Output is correct |
5 |
Correct |
1891 ms |
10260 KB |
Output is correct |
6 |
Runtime error |
106 ms |
17060 KB |
Execution killed with signal 6 |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Execution timed out |
3070 ms |
7868 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |