# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
299644 | 2020-09-15T11:25:51 Z | E869120 | Table Tennis (info1cup20_tabletennis) | C++14 | 73 ms | 3952 KB |
#include <bits/stdc++.h> using namespace std; int N, K; int A[1 << 18]; bool used[1 << 18]; bool solve(int border) { for (int i = 0; i < N + K; i++) used[i] = false; int cl = 0, cr = N + K - 1, cnt = 0; while (cl < cr && cnt < (N / 2)) { if (A[cl] + A[cr] > border) cr--; else if (A[cl] + A[cr] < border) cl++; else { used[cl] = true; used[cr] = true; cl += 1; cr -= 1; cnt += 1; } } if (cnt == (N / 2)) return true; return false; } int main() { // Step #1. Input scanf("%d%d", &N, &K); for (int i = 0; i < N + K; i++) scanf("%d", &A[i]); sort(A, A + (N + K)); // Step #2. BruteForce map<long long, int> Map; vector<long long> Cand, Cand2; for (int i = 0; i < (K + 2) * 50; i++) { int t1 = 1000000, t2 = 1000000; while (t2 < 0 || t2 >= N + K) { t1 = rand() % (N + K); t2 = (N - 1 - t1) + (rand() % (2 * K + 1)); } int val = A[t1] + A[t2]; Map[val] += 1; Cand2.push_back(val); } sort(Cand2.begin(), Cand2.end()); Cand2.erase(unique(Cand2.begin(), Cand2.end()), Cand2.end()); for (int i = 0; i < Cand2.size(); i++) { //cout << Cand2[i] << " " << Map[Cand2[i]] << endl; if (Map[Cand2[i]] >= 6) Cand.push_back(Cand2[i]); } // Step #3. Tansaku for (int i = 0; i < Cand.size(); i++) { bool I = solve(Cand[i]); if (I == false) continue; vector<int> vec; for (int j = 0; j < N + K; j++) { if (used[j] == true) vec.push_back(A[j]); } for (int j = 0; j < vec.size(); j++) { if (j) printf(" "); printf("%d", vec[j]); } printf("\n"); return 0; } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 384 KB | Output is correct |
2 | Correct | 1 ms | 384 KB | Output is correct |
3 | Correct | 2 ms | 384 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 1024 KB | Output is correct |
2 | Correct | 61 ms | 3820 KB | Output is correct |
3 | Correct | 72 ms | 3304 KB | Output is correct |
4 | Correct | 55 ms | 3308 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 56 ms | 3308 KB | Output is correct |
2 | Correct | 55 ms | 3308 KB | Output is correct |
3 | Correct | 57 ms | 3304 KB | Output is correct |
4 | Correct | 54 ms | 3308 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 640 KB | Output is correct |
2 | Correct | 3 ms | 640 KB | Output is correct |
3 | Correct | 5 ms | 640 KB | Output is correct |
4 | Correct | 2 ms | 640 KB | Output is correct |
5 | Correct | 2 ms | 544 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 1 ms | 384 KB | Output is correct |
3 | Correct | 1 ms | 384 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 2 ms | 384 KB | Output is correct |
3 | Correct | 2 ms | 512 KB | Output is correct |
4 | Correct | 2 ms | 384 KB | Output is correct |
5 | Correct | 1 ms | 384 KB | Output is correct |
6 | Correct | 2 ms | 384 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 58 ms | 3920 KB | Output is correct |
3 | Correct | 54 ms | 3952 KB | Output is correct |
4 | Correct | 66 ms | 3816 KB | Output is correct |
5 | Correct | 73 ms | 3824 KB | Output is correct |
6 | Correct | 57 ms | 3816 KB | Output is correct |
7 | Correct | 66 ms | 3884 KB | Output is correct |
8 | Correct | 64 ms | 3948 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 11 ms | 1660 KB | Unexpected end of file - int32 expected |
2 | Halted | 0 ms | 0 KB | - |