Submission #1346539

#	Time	Username	Problem	Language	Result	Execution time	Memory
1346539		bakhtiyarn	Table Tennis (info1cup20_tabletennis)	C++20	0 / 100	3108 ms	452764 KiB

tabletennis

#include <bits/stdc++.h>
using namespace std;

const int N = 3e5+5;
int a[N];

// for(int i=1; i<=n; i++) 
void solve(){
  int n, k; cin >> n >> k;
  for(int i=1; i<=n+k; i++) cin >> a[i];
  
  map<int, int> best;
  
  int mx = 0, sm = 0;
  for(int l=k+1; l>=1; l--){
    for(int r=l+1; r<=n+k; r++){
      best[a[l]+a[r]]+=2;
      if(mx < best[a[l]+a[r]]) mx = best[a[l]+a[r]], sm = a[l]+a[r];
    }
  }
  
  map<int, int> pos;
  for(int i=1; i<=n+k; i++) pos[a[i]] = i;
  
  vector<int> ans;
  int cnt = n/2;
  for(int i=1; i<=n+k and ans.size() < n; i++){
    if(pos[sm-a[i]]) {
      ans.push_back(a[i]);
      ans.push_back(sm-a[i]);
    }
  }
  sort(ans.begin(), ans.end());
  for(int i: ans) cout << i << ' ';
}

signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
}

• 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