Submission #1318877

#	Time	Username	Problem	Language	Result	Execution time	Memory
1318877		husuuu	Table Tennis (info1cup20_tabletennis)	C++20	0 / 100	62 ms	14980 KiB

tabletennis

#include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////////
//#define int long long
#define endl "\n"
#define IO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define INF 0x3F3F3F3F3F3F3F3F
#define ss second
#define ff first
#define pb push_back
#define ins insert
#define fori for(int i = 0 ; i < n ; i ++)
///////////////////////////////////////////////
const int sz = 2e3 + 5 ;
const int LG = 20 ;
const int N = 1e3 ;
const int mod = 1e9 + 7 ;
const int MAXM = 1e5 ;
///////////////////////////////////////////////
///////////////////////////////////////////////
void solve() {
  int n ;
  cin >> n ;
  int nc = n ;
  int k ;
  cin >> k ;
  n += k ; 
  vector<int>a(n) ;
  map<int , int>mp ;
  map<int , int>pos ;
  for(int i = 0 ; i < n ; i ++) {
    cin >> a[i] ;
    mp[a[i]] ++ ;
  }
  if(nc == 2 and k == 1) {
    cout << a[0] << ' ' << a[1] ;
    return ;
  }
  sort(a.begin() , a.end()) ;
  for(int i = 0 ; i < n ; i ++) {
    pos[a[i]] = i ;
  }
  int nn = a.size() ;
  vector<bool>check(nn , 0) ;
  map<int , int>rep ;
  for(int i = 0 ; i <= k ; i ++) {
    int l = i ;
    int r = nn - (k - i) - 1 ;
    int sum = a[l] + a[r] ;
    rep[sum] = 0 ;
    while(l < r) {
      int summ = a[l] + a[r] ;
      //cout << summ << endl ;
      if(summ == sum) {
        l ++ ;
        r -- ;
        rep[sum] ++ ;
        continue ;
      } 
      //cout << summ << endl ;
      if(summ < sum) {
        l ++ ;
      }
      else {
        r -- ;
      }
    }
    //cout << rep[sum] << endl ;
    if(rep[sum] * 2 >= nn) {
      //cout << sum << endl ;
      vector<int>ans ;
      for(int i = 0 ; i < n ; i ++) {
        if(check[i] == 0) {
          check[i] = 1 ;
          int dif = sum - a[i] ;
          if(mp[dif] == 1 and a[i] != dif) {
            ans.push_back(a[i]) ;
            ans.push_back(a[pos[dif]]) ;
            check[pos[dif]] = 1 ;
          }
        }
      }
      if(ans.size() >= nc) {
        for(int i = 0 ; i < ans.size() ; i ++) cout << ans[i] << ' ' ;
        return ;
      }
    }
    //cout << endl ;
  }
  //cout << sum << endl ;
}
///////////////////////////////////////////////
///////////////////////////////////////////////
signed main() {
  IO ;
  int t = 1 ; // cin >> t ;
  while(t --) {
    solve() ;
    cout << endl ;
  }
}

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