# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
366031 | 2021-02-12T18:50:39 Z | soba | Table Tennis (info1cup20_tabletennis) | C++14 | 3000 ms | 357052 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll n , k; cin >> n >> k ; ll teams=n/2; vector<ll>v; ll x , y ; n+=k; map<ll,int>mp; for(int i = 0 ; i < n ; i++) { cin >> x; mp[x]++; v.push_back(x); } sort(v.begin(), v.end()); vector<ll>poten; for(int i = 0 ; i< k+1 ; i++) { for( int j = n-1; j >= n-(k+1) ; j-- ) { poten.push_back(v[i]+v[j]); } } int sz=poten.size(); vector<ll>ansa; for( int i = 0 ; i < sz ; i++) { ansa.clear(); ll tmp=teams; for(int j = 0 ; v[j]<(poten[i]/2) ; j++ ) { if(poten[i]-v[j]==v[j])continue; if(mp[poten[i]-v[j]]) { tmp--; ansa.push_back(poten[i]-v[j]); ansa.push_back(v[j]); } if(tmp==0) break; } if(tmp==0) { break; } } // cout << ansa[0] << "\n"; // cout << ansa.size() << "\n"; sort( ansa.begin() , ansa.end()); for(int i = 0 ; i < teams*2 ; i++) { cout << ansa[i] << " " ; } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 620 KB | Output is correct |
2 | Correct | 2 ms | 620 KB | Output is correct |
3 | Correct | 2 ms | 620 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 11 ms | 2280 KB | Output is correct |
2 | Correct | 128 ms | 24412 KB | Output is correct |
3 | Correct | 137 ms | 23900 KB | Output is correct |
4 | Correct | 128 ms | 23644 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 185 ms | 39388 KB | Output is correct |
2 | Correct | 155 ms | 25948 KB | Output is correct |
3 | Correct | 192 ms | 40540 KB | Output is correct |
4 | Correct | 146 ms | 29404 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 876 KB | Output is correct |
2 | Correct | 503 ms | 32620 KB | Output is correct |
3 | Correct | 3 ms | 1260 KB | Output is correct |
4 | Correct | 165 ms | 30316 KB | Output is correct |
5 | Correct | 3 ms | 1260 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 492 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 52 ms | 12908 KB | Output is correct |
3 | Correct | 12 ms | 3052 KB | Output is correct |
4 | Correct | 51 ms | 16364 KB | Output is correct |
5 | Correct | 10 ms | 3052 KB | Output is correct |
6 | Correct | 3 ms | 748 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 512 KB | Output is correct |
2 | Execution timed out | 3102 ms | 357052 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 16 ms | 4960 KB | Output is correct |
2 | Execution timed out | 3114 ms | 320760 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |