Submission #1318449

#	Time	Username	Problem	Language	Result	Execution time	Memory
1318449		husuuu	Table Tennis (info1cup20_tabletennis)	C++20	20 / 100	3093 ms	6360 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 k ;
  cin >> k ;
  n += k ;
  vector<int>a(n) ;
  for(int i = 0 ; i < n ; i ++) cin >> a[i] ;
  map<int , int>mp ;
  sort(a.begin() , a.end()) ;
  for(int i = 0 ; i < n ; i ++) {
    vector<int>check ;
    for(int j = 0 ; j < i ; j ++) {
      check.push_back(a[j]) ;
    }
    for(int j = i + k ; j < n ; j ++) {
      check.push_back(a[j]) ;
    }
    int l = 0 ;
    int r = n - k - 1 ;
    set<int>st ;
    bool b = false ;
    while(l <= r) {
      int sum = check[l] + check[r] ;
      l ++ ;
      r -- ;
      st.insert(sum) ;
    }
    if(st.size() == 1) {
      for(int W = 0 ; W < check.size() ; W ++) {
        cout << check[W] << ' ' ;
      }
      return ;
    }
  }
}
///////////////////////////////////////////////
///////////////////////////////////////////////
signed main() {
  IO ;
  int t = 1 ; // cin >> t ;
  while(t --) {
    solve() ;
    cout << endl ;
  }
}

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