# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
369156 | 2021-02-20T15:32:29 Z | doowey | Table Tennis (info1cup20_tabletennis) | C++14 | 3000 ms | 4728 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; #define fi first #define se second #define mp make_pair #define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); int main(){ fastIO; int n, k; cin >> n >> k; int m = (n + k); vector<int> q(m); for(int i = 0; i < m ; i ++) cin >> q[i]; sort(q.begin(), q.end()); int pari = 0; int rem = n/2; vector<int> soln; int ci, cj; int pi, pj; bool brok; for(int i = 0 ; i < m ; i ++ ){ for(int j = 1; j <= k + 1; j ++ ){ if(i + j < m){ if(i + 1 >= n/2 && m-(i+j) >= n/2){ rem = n/2-1; pi = i; pj = i+j; soln.clear(); soln.push_back(i); soln.push_back(i + j); ci = i-1; cj = j+1; while(rem > 0){ if(ci < 0 || cj >= m) break; if(q[pi]+q[pj] == q[ci]+q[cj]){ soln.push_back(ci); soln.push_back(cj); pi = ci; pj = cj; ci -- ; cj ++ ; rem -- ; } else{ if(q[ci]+q[cj] > q[pi]+q[pj]){ ci--; } else{ cj++; } } } if(rem == 0){ sort(soln.begin(), soln.end()); for(auto x : soln) cout << q[x] << " "; cout << "\n"; return 0; } } } } } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 492 KB | Output is correct |
3 | Correct | 1 ms | 364 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 876 KB | Output is correct |
2 | Correct | 44 ms | 3176 KB | Output is correct |
3 | Correct | 43 ms | 4584 KB | Output is correct |
4 | Correct | 43 ms | 4584 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 44 ms | 3176 KB | Output is correct |
2 | Correct | 45 ms | 4584 KB | Output is correct |
3 | Correct | 46 ms | 4584 KB | Output is correct |
4 | Correct | 45 ms | 4576 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 364 KB | Output is correct |
2 | Correct | 4 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 364 KB | Output is correct |
4 | Correct | 2 ms | 364 KB | Output is correct |
5 | Correct | 1 ms | 364 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 364 KB | Output is correct |
2 | Correct | 0 ms | 364 KB | Output is correct |
3 | Correct | 0 ms | 364 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 3 ms | 364 KB | Output is correct |
3 | Correct | 2 ms | 364 KB | Output is correct |
4 | Correct | 2 ms | 364 KB | Output is correct |
5 | Correct | 1 ms | 364 KB | Output is correct |
6 | Correct | 2 ms | 364 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 291 ms | 3176 KB | Output is correct |
3 | Correct | 63 ms | 4584 KB | Output is correct |
4 | Correct | 148 ms | 4584 KB | Output is correct |
5 | Correct | 120 ms | 4584 KB | Output is correct |
6 | Correct | 94 ms | 4728 KB | Output is correct |
7 | Correct | 133 ms | 4632 KB | Output is correct |
8 | Correct | 152 ms | 4584 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Execution timed out | 3076 ms | 876 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |