#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;
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
//#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef double db;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tree<iii, null_type, greater<iii>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
int N, K, A[200005];
map<int, int> R;
main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> N >> K;
for (int i = 1; i <= N + K; i++) cin >> A[i], R[A[i]] = i;
for (int i = 0; i <= K; i++)
for (int j = 0; i + j <= K; j++) {
int S = A[i + 1] + A[N + K - j], cnt = 0;
for (int k = i + 1; k <= N + K - j; k++) {
if (S - A[k] > A[k] && R[S - A[k]] && R[S - A[k]] <= N + K - j) {
cnt += 2;
if (cnt >= N) break;
}
}
if (cnt >= N) {
vector<int> tmp;
for (int k = 1; k <= N + K; k++)
if (R[S - A[k]]) {
tmp.pb(A[k]);
tmp.pb(S - A[k]);
if (tmp.size() == N) break;
}
sort(tmp.begin(), tmp.end());
for (int k : tmp) cout << k << ' ';
cout << '\n';
return 0;
}
}
}
Compilation message
tabletennis.cpp:31:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
31 | main() {
| ^~~~
tabletennis.cpp: In function 'int main()':
tabletennis.cpp:51:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
51 | if (tmp.size() == N) break;
| ~~~~~~~~~~~^~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
460 KB |
Output is correct |
2 |
Correct |
2 ms |
460 KB |
Output is correct |
3 |
Correct |
2 ms |
460 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
1720 KB |
Output is correct |
2 |
Correct |
127 ms |
17168 KB |
Output is correct |
3 |
Correct |
140 ms |
16800 KB |
Output is correct |
4 |
Correct |
127 ms |
16732 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
178 ms |
29008 KB |
Output is correct |
2 |
Correct |
134 ms |
18356 KB |
Output is correct |
3 |
Correct |
171 ms |
26120 KB |
Output is correct |
4 |
Correct |
151 ms |
20944 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
588 KB |
Output is correct |
2 |
Correct |
98 ms |
13356 KB |
Output is correct |
3 |
Correct |
3 ms |
844 KB |
Output is correct |
4 |
Correct |
88 ms |
17632 KB |
Output is correct |
5 |
Correct |
3 ms |
844 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
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 |
36 ms |
9552 KB |
Output is correct |
3 |
Correct |
8 ms |
2252 KB |
Output is correct |
4 |
Correct |
39 ms |
11620 KB |
Output is correct |
5 |
Correct |
8 ms |
2252 KB |
Output is correct |
6 |
Correct |
2 ms |
460 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Execution timed out |
3102 ms |
307736 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
13 ms |
2764 KB |
Output is correct |
2 |
Execution timed out |
3114 ms |
292892 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |