# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
834796 | 2023-08-22T19:37:05 Z | alex_2008 | Table Tennis (info1cup20_tabletennis) | C++14 | 3000 ms | 5816 KB |
#include <iostream> #include <algorithm> #include <vector> #define int long long using namespace std; const int N = 15e4 + 410; int a[N]; int randd() { srand(time(0)); int x = 0; for (int i = 0; i < 8; i++) { x = x * 10 + (rand() % 10); } return x; } signed main() { int n, k; cin >> n >> k; for (int i = 1; i <= n + k; i++) { cin >> a[i]; } sort(a + 1, a + n + k + 1); for (int i = 1; i <= k + 1; i++) { for (int j = n + k; j >= i + n - 1; j--) { int sm = a[i] + a[j], cnt = 0; int k1 = i, k2 = j; while (k1 < k2) { if (a[k1] + a[k2] == sm) { cnt++; k1++; k2--; } else if (a[k1] + a[k2] > sm) { k2--; } else k1++; } if (cnt >= (n / 2)) { k1 = i; k2 = j; vector <int> v; while (k1 < k2) { if (a[k1] + a[k2] == sm) { if (v.size() != n) { v.push_back(a[k1]); v.push_back(a[k2]); } cnt++; k1++; k2--; } else if (a[k1] + a[k2] > sm) { k2--; } else k1++; } sort(v.begin(), v.end()); for (auto it : v) { cout << it << " "; } cout << "\n"; return 0; } } } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 316 KB | Output is correct |
2 | Correct | 1 ms | 464 KB | Output is correct |
3 | Correct | 2 ms | 340 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 1104 KB | Output is correct |
2 | Correct | 60 ms | 5728 KB | Output is correct |
3 | Correct | 64 ms | 5688 KB | Output is correct |
4 | Correct | 60 ms | 5636 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 58 ms | 5588 KB | Output is correct |
2 | Correct | 61 ms | 5712 KB | Output is correct |
3 | Correct | 59 ms | 5692 KB | Output is correct |
4 | Correct | 59 ms | 5692 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 1 ms | 212 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 2 ms | 340 KB | Output is correct |
3 | Correct | 1 ms | 340 KB | Output is correct |
4 | Correct | 1 ms | 340 KB | Output is correct |
5 | Correct | 2 ms | 340 KB | Output is correct |
6 | Correct | 2 ms | 340 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 169 ms | 5656 KB | Output is correct |
3 | Correct | 62 ms | 5692 KB | Output is correct |
4 | Correct | 89 ms | 5568 KB | Output is correct |
5 | Correct | 60 ms | 5672 KB | Output is correct |
6 | Correct | 70 ms | 5816 KB | Output is correct |
7 | Correct | 76 ms | 5628 KB | Output is correct |
8 | Correct | 60 ms | 5692 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 336 KB | Output is correct |
2 | Execution timed out | 3035 ms | 2852 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |