#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 2e5 + 2;
const ll linf = 1e18;
int a[N], n, k;
void Resi(int x) {
vector<int> v;
int p = n + k - 1;
for (int i = 0; i < n + k - 1; i++) {
while (i < p && a[i] + a[p] > x) p -= 1;
if (i < p && a[i] + a[p] == x) {
v.push_back(a[i]);
v.push_back(a[p]);
p -= 1;
}
}
if (v.size() >= n) {
vector<int> ans;
for (int i = 0; i < n; i++) ans.push_back(v[i]);
sort(ans.begin(), ans.end());
for (int i : ans) cout << i << sp;
cout << en;
exit(0);
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
for (int i = 0; i < n + k; i++) cin >> a[i];
if (n <= k) for (int i = 0; i < n + k; i++) for (int j = i + 1; j < n + k; j++) Resi(a[i] + a[j]);
mt19937 mt(time(nullptr));
while (1) {
int x = mt() % (n + k);
int mn = max(0, x - k);
int mx = min(n - 1, x);
mn = n - mn - 1;
mx = n - mx - 1;
int l = mx;
int r = mn + k;
for (int i = l; i <= r; i++) if (i != x) Resi(a[i] + a[x]);
}
return 0;
}
Compilation message
tabletennis.cpp: In function 'void Resi(int)':
tabletennis.cpp:23:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
23 | if (v.size() >= n) {
| ~~~~~~~~~^~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
1024 KB |
Output is correct |
2 |
Correct |
40 ms |
3888 KB |
Output is correct |
3 |
Correct |
60 ms |
3888 KB |
Output is correct |
4 |
Correct |
39 ms |
5060 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
40 ms |
3940 KB |
Output is correct |
2 |
Correct |
50 ms |
3876 KB |
Output is correct |
3 |
Correct |
47 ms |
5140 KB |
Output is correct |
4 |
Correct |
37 ms |
5048 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
8 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
5 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
344 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
62 ms |
3960 KB |
Output is correct |
3 |
Correct |
39 ms |
3876 KB |
Output is correct |
4 |
Correct |
37 ms |
5024 KB |
Output is correct |
5 |
Correct |
58 ms |
5060 KB |
Output is correct |
6 |
Correct |
39 ms |
6040 KB |
Output is correct |
7 |
Correct |
37 ms |
5172 KB |
Output is correct |
8 |
Correct |
50 ms |
5124 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
621 ms |
3944 KB |
Output is correct |
3 |
Correct |
34 ms |
3884 KB |
Output is correct |
4 |
Correct |
158 ms |
5140 KB |
Output is correct |
5 |
Correct |
118 ms |
5020 KB |
Output is correct |
6 |
Correct |
39 ms |
6044 KB |
Output is correct |
7 |
Correct |
163 ms |
5080 KB |
Output is correct |
8 |
Correct |
153 ms |
5072 KB |
Output is correct |