#include <iostream>
#include <vector>
#include <cmath>
#include <set>
using namespace std;
#define pii pair<int, int>
vector<vector<int>>vec;
vector<bool>visit;
int main() {
int n, k;
cin >> n >> k;
vector<int>vec(n+k);
for (int i = 0; i < n + k; i++) {
cin >> vec[i];
}
for (int i = 0; i < n + k; i++) {
vector<int>tmp(0);
for (int j = 0; j < n + k; j++) {
if (j != i) {
tmp.push_back(vec[j]);
}
}
int tmp2 = tmp[0]+tmp[n-1];
bool flag = true;
for (int j = 1; j <=n/2-1; j++) {
if (tmp[j]+tmp[n-1-j] != tmp2) {
flag = false;
break;
}
}
if (flag) {
for (int j = 0; j < n; j++)
cout << tmp[j] << " ";
break;
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
332 KB |
Output is correct |
2 |
Correct |
19 ms |
328 KB |
Output is correct |
3 |
Correct |
18 ms |
328 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1117 ms |
1048 KB |
Output is correct |
2 |
Correct |
91 ms |
4556 KB |
Output is correct |
3 |
Execution timed out |
3058 ms |
4116 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
88 ms |
4536 KB |
Output is correct |
2 |
Execution timed out |
3066 ms |
4220 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Incorrect |
1 ms |
204 KB |
Unexpected end of file - int32 expected |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
288 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Incorrect |
18 ms |
204 KB |
Unexpected end of file - int32 expected |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Execution timed out |
3068 ms |
4412 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Execution timed out |
3076 ms |
4176 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |