제출 #1346515

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1346515		bakhtiyarn	Table Tennis (info1cup20_tabletennis)	C++20	72 / 100	3103 ms	329572 KiB

tabletennis

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

const int N = 3e5+5;
unordered_map<int, int> pos;
int a[N];


int build(int l, int r, int sm, int k){
  int ans = 0;
  for(int i=l; i<=r; i++) if(pos[sm-a[i]]) ans++;
  return ans;
}

// 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];
  for(int i=1; i<=n+k; i++) pos[a[i]] = i;
  
  for(int l=1; l<=2+k; l++){
    for(int r=n-2; r<=n+k; r++){
      if(l >= r) continue;
      int sm = a[l] + a[r];
      if(l-1 + n+k-r > k) continue;
      // 
        int ans = build(l, r, sm, k - (l-1 + n+k-r));
        if(ans == n) {
          for(int i=l; i<=r; i++) if(pos[sm-a[i]]) cout << a[i] << " ";
          return;
        }
      // 
    }
  }
}

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

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