#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;
auto check = [&](int x){
int pl = 0, pr = z - 1;
vec <int> ans;
while(pl < pr && sz(ans) < n){
if (a[pl] + a[pr] == x){
ans.push_back(a[pl]);
ans.push_back(a[pr]);
++pl, --pr;
}
else if (a[pl] + a[pr] < x) ++pl;
else --pr;
}
if (sz(ans) == n){
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){
check(a[i] + a[j]);
}
}
}
int j = rng() % z;
int l = max(0, z - j - k - 2), r = min(z, z - j + k + 2);
for (int i = l; i < r; ++i){
check(a[i] + a[j]);
}
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 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
352 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
948 KB |
Output is correct |
2 |
Correct |
35 ms |
4648 KB |
Output is correct |
3 |
Correct |
36 ms |
4424 KB |
Output is correct |
4 |
Correct |
33 ms |
4548 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
37 ms |
4480 KB |
Output is correct |
2 |
Correct |
32 ms |
4552 KB |
Output is correct |
3 |
Correct |
33 ms |
4540 KB |
Output is correct |
4 |
Correct |
32 ms |
4552 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
324 KB |
Output is correct |
2 |
Incorrect |
1 ms |
212 KB |
Unexpected end of file - int32 expected |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Incorrect |
1 ms |
212 KB |
Unexpected end of file - int32 expected |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
324 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
336 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
56 ms |
4556 KB |
Output is correct |
3 |
Correct |
32 ms |
4440 KB |
Output is correct |
4 |
Correct |
39 ms |
4476 KB |
Output is correct |
5 |
Correct |
35 ms |
4480 KB |
Output is correct |
6 |
Correct |
45 ms |
5416 KB |
Output is correct |
7 |
Correct |
36 ms |
4472 KB |
Output is correct |
8 |
Correct |
35 ms |
4528 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
677 ms |
4524 KB |
Output is correct |
3 |
Correct |
38 ms |
4484 KB |
Output is correct |
4 |
Correct |
159 ms |
4524 KB |
Output is correct |
5 |
Correct |
87 ms |
4408 KB |
Output is correct |
6 |
Correct |
37 ms |
5416 KB |
Output is correct |
7 |
Correct |
164 ms |
4528 KB |
Output is correct |
8 |
Correct |
158 ms |
4424 KB |
Output is correct |