#include <stdio.h>
#include <string.h>
#define N 150000
#define K 400
int main() {
static int aa[N + K];
static char used[N + K];
int n, m, l, r, i, j, s, cnt;
scanf("%d%d", &n, &m);
for (i = 0; i < n + m; i++)
scanf("%d", &aa[i]);
for (l = 0; l <= m; l++)
for (r = n + m - 1; r >= l && r >= n - 1; r--) {
memset(used, 0, (n + m) * sizeof *used);
s = aa[l] + aa[r], i = l, j = r, cnt = n;
while (i < j && cnt > 0)
if (aa[i] + aa[j] < s)
i++;
else if (aa[i] + aa[j] > s)
j--;
else
used[i] = used[j] = 1, i++, j--, cnt -= 2;
if (cnt == 0) {
for (i = 0; i < n + m; i++)
if (used[i])
printf("%d ", aa[i]);
printf("\n");
return 0;
}
}
return 0;
}
Compilation message
tabletennis.c: In function 'main':
tabletennis.c:12:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
12 | scanf("%d%d", &n, &m);
| ^~~~~~~~~~~~~~~~~~~~~
tabletennis.c:14:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
14 | scanf("%d", &aa[i]);
| ^~~~~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
552 KB |
Output is correct |
2 |
Correct |
25 ms |
3876 KB |
Output is correct |
3 |
Correct |
23 ms |
3924 KB |
Output is correct |
4 |
Correct |
31 ms |
3844 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
28 ms |
2408 KB |
Output is correct |
2 |
Correct |
24 ms |
3900 KB |
Output is correct |
3 |
Correct |
24 ms |
3912 KB |
Output is correct |
4 |
Correct |
24 ms |
3888 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
292 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
288 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
308 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
185 ms |
3880 KB |
Output is correct |
3 |
Correct |
26 ms |
3884 KB |
Output is correct |
4 |
Correct |
42 ms |
3852 KB |
Output is correct |
5 |
Correct |
25 ms |
3924 KB |
Output is correct |
6 |
Correct |
46 ms |
3964 KB |
Output is correct |
7 |
Correct |
52 ms |
3820 KB |
Output is correct |
8 |
Correct |
26 ms |
3856 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Execution timed out |
3066 ms |
2404 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |