제출 #1231697

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1231697		Solikha	Table Tennis (info1cup20_tabletennis)	C++20	49 / 100	3109 ms	626588 KiB

tabletennis

#include "bits/stdc++.h"
using namespace std;
#define int long long
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ss second
#define ff first
#define pb push_back 

void solve(){
  int n, k; cin >> n >> k;
  int N = n + k;
  map<int, int> mp;
  vector<int> v(N);
  for(int i = 0; i < N; i++){
    cin >> v[i];
    mp[v[i]]++;
  }

  map<int, int> cnt;
  int sm = 0;
  for(int i = 0; i < N; i++){
    for(int j = i + 1; j < N; j++){
      int x = v[i] + v[j];
      cnt[x]++;
      if(cnt[x] == n / 2){
        i = N;
        sm = x; break;
      }
    }
  }

  vector<int> ans;
  for(int i = 0; i < N; i++){
    if(mp[v[i]] == 1 && mp[sm - v[i]] == 1){
      ans.pb(v[i]);
      ans.pb(sm - v[i]);
      mp[v[i]]++;
      mp[sm - v[i]]++;
    }
  }
  sort(all(ans));
  for(int &i : ans) cout << i << ' ';
}
 
signed main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int t = 1; //cin >> t;
  while(t--){
    solve();
    cout << endl;
  }
  return 0;
}

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