# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
447488 | 2021-07-26T14:54:06 Z | LucaIlie | Table Tennis (info1cup20_tabletennis) | C++17 | 85 ms | 5412 KB |
#include <stdio.h> #include <algorithm> #include <map> #define MAX_N 150000 #define MAX_K 400 int v[MAX_N + MAX_K], sume[(2 * MAX_K + 1) * (2 * MAX_K + 1)], ans[MAX_N]; int main() { int n, k, m, suma, apMax, s, f, i, j; scanf( "%d%d", &n, &k ); for ( i = 0; i < n + k; i++ ) scanf( "%d", &v[i] ); m = 0; for ( i = 0; i < 2 * k + 1 && i < n + k; i++ ) { for ( j = n + k - (2 * k + 1) > 0 ? n + k - (2 * k + 1) : 0; j < n + k; j++ ) { if ( i != j ) { sume[m] = v[i] + v[j]; m++; } } } std::sort( sume, sume + m ); suma = -1; apMax = 0; i = 0; while ( i < m ) { j = i + 1; while ( sume[i] == sume[j] ) j++; if ( j - i > apMax ) { apMax = j - i; suma = sume[i]; } i = j; } s = 0; f = n + k - 1; i = 0; while ( i < n / 2 ) { if ( v[s] + v[f] == suma ) { ans[i] = v[s]; ans[n - 1 - i] = v[f]; s++; f--; i++; } else if ( v[s] + v[f] < suma ) s++; else f--; } for ( i = 0; i < n; i++ ) printf( "%d ", ans[i] ); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 3 ms | 332 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 588 KB | Output is correct |
2 | Correct | 39 ms | 2824 KB | Output is correct |
3 | Correct | 39 ms | 2872 KB | Output is correct |
4 | Correct | 38 ms | 2884 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 43 ms | 2852 KB | Output is correct |
2 | Correct | 49 ms | 2824 KB | Output is correct |
3 | Runtime error | 26 ms | 1860 KB | Execution killed with signal 11 |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 332 KB | Output is correct |
2 | Correct | 3 ms | 332 KB | Output is correct |
3 | Correct | 3 ms | 332 KB | Output is correct |
4 | Correct | 2 ms | 332 KB | Output is correct |
5 | Correct | 2 ms | 332 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Correct | 0 ms | 204 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Incorrect | 1 ms | 332 KB | Output not sorted |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 39 ms | 2852 KB | Output is correct |
3 | Correct | 39 ms | 2848 KB | Output is correct |
4 | Correct | 39 ms | 2900 KB | Output is correct |
5 | Correct | 38 ms | 2860 KB | Output is correct |
6 | Correct | 39 ms | 2844 KB | Output is correct |
7 | Correct | 39 ms | 2820 KB | Output is correct |
8 | Correct | 39 ms | 2880 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 1004 KB | Output is correct |
2 | Correct | 84 ms | 5412 KB | Output is correct |
3 | Correct | 85 ms | 5404 KB | Output is correct |
4 | Correct | 82 ms | 5320 KB | Output is correct |
5 | Correct | 67 ms | 5332 KB | Output is correct |
6 | Correct | 64 ms | 5400 KB | Output is correct |
7 | Correct | 78 ms | 5316 KB | Output is correct |
8 | Correct | 85 ms | 5324 KB | Output is correct |