#include <bits/stdc++.h>
using namespace std;
const int NMAX = 1e5 + 5e4 + 5 + 4;
const int KMAX = 404;
int N, K, M, a[NMAX + KMAX], sol[NMAX];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cin >> N >> K;
M = N + K;
for(int i = 1; i <= M; ++i)
cin >> a[i];
for(int i = 1; i <= K + 1; ++i)
for(int j = i + N - 1; j <= M; ++j) {
/// consideram i primul element al sirului solutie si j ultimul
int sum = a[i] + a[j], st = i, dr = j, cnt = 0;
while(st < dr) {
if((dr - st + 1) < (N - (cnt << 1)))
break;
int cand = a[st] + a[dr];
if(cand == sum) {
sol[++cnt] = a[st];
sol[N - cnt + 1] = a[dr];
++st, --dr;
}
else
if(cand > sum)
--dr;
else
++st;
if(cnt == N / 2)
break;
}
if(cnt == N / 2) {
for(int k = 1; k <= N; ++k)
cout << sol[k] << ' ';
cout << '\n';
return 0;
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
2 ms |
620 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
876 KB |
Output is correct |
2 |
Correct |
33 ms |
3180 KB |
Output is correct |
3 |
Correct |
35 ms |
4460 KB |
Output is correct |
4 |
Correct |
33 ms |
4460 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
35 ms |
3084 KB |
Output is correct |
2 |
Correct |
33 ms |
3180 KB |
Output is correct |
3 |
Correct |
33 ms |
3180 KB |
Output is correct |
4 |
Correct |
33 ms |
4460 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
364 KB |
Output is correct |
6 |
Correct |
1 ms |
364 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
33 ms |
3308 KB |
Output is correct |
3 |
Correct |
33 ms |
4460 KB |
Output is correct |
4 |
Correct |
34 ms |
4460 KB |
Output is correct |
5 |
Correct |
33 ms |
4460 KB |
Output is correct |
6 |
Correct |
34 ms |
4480 KB |
Output is correct |
7 |
Correct |
34 ms |
4460 KB |
Output is correct |
8 |
Correct |
33 ms |
4392 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
58 ms |
3308 KB |
Output is correct |
3 |
Correct |
35 ms |
4460 KB |
Output is correct |
4 |
Correct |
55 ms |
4460 KB |
Output is correct |
5 |
Correct |
43 ms |
4460 KB |
Output is correct |
6 |
Correct |
34 ms |
4588 KB |
Output is correct |
7 |
Correct |
82 ms |
4460 KB |
Output is correct |
8 |
Correct |
34 ms |
4460 KB |
Output is correct |