#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], r = N + K - j, cnt = 0;
for (int k = i + 1; k < r; k++) {
while (k < r && A[k] + A[r] > S) r--;
if (A[k] + A[r] == S) cnt += 2;
}
if (cnt >= N) {
r = N + K - j;
vector<int> tmp;
for (int k = i + 1; k < r; k++) {
while (k < r && A[k] + A[r] > S) r--;
if (A[k] + A[r] == S) {
tmp.pb(A[k]);
tmp.pb(A[r]);
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 |
1 ms |
460 KB |
Output is correct |
2 |
Correct |
2 ms |
460 KB |
Output is correct |
3 |
Correct |
1 ms |
460 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
1740 KB |
Output is correct |
2 |
Correct |
82 ms |
10108 KB |
Output is correct |
3 |
Correct |
95 ms |
10104 KB |
Output is correct |
4 |
Correct |
72 ms |
10108 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
74 ms |
10028 KB |
Output is correct |
2 |
Correct |
73 ms |
10160 KB |
Output is correct |
3 |
Correct |
72 ms |
10164 KB |
Output is correct |
4 |
Correct |
71 ms |
10040 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
2 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 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 |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
2 ms |
460 KB |
Output is correct |
3 |
Correct |
1 ms |
460 KB |
Output is correct |
4 |
Correct |
2 ms |
460 KB |
Output is correct |
5 |
Correct |
2 ms |
460 KB |
Output is correct |
6 |
Correct |
2 ms |
460 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
234 ms |
10100 KB |
Output is correct |
3 |
Correct |
76 ms |
10104 KB |
Output is correct |
4 |
Correct |
108 ms |
10156 KB |
Output is correct |
5 |
Correct |
75 ms |
10032 KB |
Output is correct |
6 |
Correct |
104 ms |
10168 KB |
Output is correct |
7 |
Correct |
101 ms |
10104 KB |
Output is correct |
8 |
Correct |
76 ms |
10184 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Execution timed out |
3086 ms |
7860 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |