제출 #1317715

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1317715		Johan	Table Tennis (info1cup20_tabletennis)	C++20	43 / 100	948 ms	178292 KiB

tabletennis

#include <bits/stdc++.h>
using namespace std;
const int B = 1e3 + 5;
signed main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, k;
  cin >> n >> k;
  int m = n + k;
  vector < int > a(m + 1);
  map < int , int > is;
  for(int i = 1; i <= m; i++){
    cin >> a[i];
    is[a[i]]++;
  }
  k += (k == 1);
  vector < int > v;
  map < int, int > mp;
  for(int i = 1; i <= min(k + 4, m); i++){  
    for(int j = m; j >= max(m - k - 4, 1); j--){
      v.push_back(a[i] + a[j]);
    }
  }
  for(auto i : v)mp[i] += 2;
  int mx = 0;
  vector < int > sums;
  for(auto [x, cnt] : mp){
    if(cnt >= mx){
      if(cnt == mx)
        sums.push_back(x);
      else sums = {x};
      mx = cnt;
    }
  }
  sort(sums.rbegin(), sums.rend());
  while(sums.size() > 30)sums.pop_back();
  for(int sum : sums){
    deque < int > rs;
    for(int i = 1; i <= m; i++){
      if(is[sum - a[i]] > 0 && sum - a[i] != a[i] || is[sum - a[i]] > 1){
        rs.push_back(a[i]);
      }
    }
    if(rs.size() > n){
      rs.pop_front();
      rs.pop_back();
    }
    if(rs.size() == n){
      for(auto i : rs)
        cout << i << ' ';
      return 0;
    }
  }
}

• Subtask 1: 11 / 11
• Subtask 2: 9 / 9
• Subtask 3: 14 / 14
• Subtask 4: 0 / 15
• Subtask 5: 9 / 9
• Subtask 6: 0 / 14
• Subtask 7: 0 / 15
• Subtask 8: 0 / 13