/*
* author: NeroZein
* created: 01.02.2023 12:23:57
*/
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,fast-math,unroll-loops")
#pragma GCC target("avx2,fma")
#define int long long
using namespace std;
#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif
signed main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<int> a(n + k);
map<int, bool> mp;
for (int i = 0; i < n + k; ++i) {
cin >> a[i];
mp[a[i]] = 1;
}
sort(a.begin(), a.end());
for (int i = 0; i <= k; ++i) {
for (int j = n + k - 1; j > i; --j) {
int cnt = i + (n + k - j - 1);
if (cnt > k) {
break;
}
int tar = a[i] + a[j];
for (int x = i + 1; x < j; ++x) {
if (!mp.count(tar - a[x])) {
cnt++;
}
}
if (cnt == k) {
//deb(
vector<int> ans;
for (int x = i; x <= j; ++x) {
if (mp.count(tar - a[x])) {
ans.push_back(a[x]);
}
}
for (int x : ans) {
cout << x << ' ';
}
return 0;
}
}
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
468 KB |
Output is correct |
2 |
Correct |
2 ms |
468 KB |
Output is correct |
3 |
Correct |
2 ms |
468 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
11 ms |
2132 KB |
Output is correct |
2 |
Correct |
127 ms |
13696 KB |
Output is correct |
3 |
Correct |
109 ms |
13560 KB |
Output is correct |
4 |
Correct |
109 ms |
13572 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
158 ms |
13560 KB |
Output is correct |
2 |
Correct |
121 ms |
13644 KB |
Output is correct |
3 |
Correct |
171 ms |
13692 KB |
Output is correct |
4 |
Correct |
123 ms |
13556 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
9 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
8 ms |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
20 ms |
460 KB |
Output is correct |
3 |
Correct |
4 ms |
468 KB |
Output is correct |
4 |
Correct |
19 ms |
452 KB |
Output is correct |
5 |
Correct |
3 ms |
468 KB |
Output is correct |
6 |
Correct |
4 ms |
468 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Execution timed out |
3065 ms |
10848 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
340 KB |
Output is correct |
2 |
Execution timed out |
3077 ms |
10852 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |