#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];
gp_hash_table<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;
| ~~~~~~~~~~~^~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
460 KB |
Output is correct |
2 |
Correct |
2 ms |
460 KB |
Output is correct |
3 |
Correct |
2 ms |
588 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
9 ms |
1748 KB |
Output is correct |
2 |
Correct |
131 ms |
20936 KB |
Output is correct |
3 |
Correct |
92 ms |
20748 KB |
Output is correct |
4 |
Correct |
118 ms |
20752 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
135 ms |
39232 KB |
Output is correct |
2 |
Correct |
113 ms |
20772 KB |
Output is correct |
3 |
Correct |
137 ms |
20820 KB |
Output is correct |
4 |
Correct |
125 ms |
20784 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
716 KB |
Output is correct |
2 |
Correct |
55 ms |
18852 KB |
Output is correct |
3 |
Correct |
2 ms |
1036 KB |
Output is correct |
4 |
Correct |
57 ms |
18924 KB |
Output is correct |
5 |
Correct |
2 ms |
1036 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
19 ms |
9660 KB |
Output is correct |
3 |
Correct |
6 ms |
2756 KB |
Output is correct |
4 |
Correct |
32 ms |
9660 KB |
Output is correct |
5 |
Correct |
5 ms |
2676 KB |
Output is correct |
6 |
Correct |
2 ms |
716 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
2461 ms |
594960 KB |
Output is correct |
3 |
Correct |
385 ms |
76136 KB |
Output is correct |
4 |
Correct |
2160 ms |
594952 KB |
Output is correct |
5 |
Correct |
221 ms |
39312 KB |
Output is correct |
6 |
Correct |
149 ms |
39292 KB |
Output is correct |
7 |
Correct |
1824 ms |
594964 KB |
Output is correct |
8 |
Correct |
151 ms |
39208 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
2756 KB |
Output is correct |
2 |
Runtime error |
2555 ms |
1048580 KB |
Execution killed with signal 9 |
3 |
Halted |
0 ms |
0 KB |
- |