제출 #910991

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
910991		Ianis	Table Tennis (info1cup20_tabletennis)	C++17	0 / 100	3100 ms	1496 KiB

tabletennis

#include <algorithm>
#include <iostream>
#include <fstream>
#include <queue>
#include <cmath>

#define fi first
#define se second

#define sz(a) int((a).size())
#define all(a) (a).begin(), (a).end()

using namespace std;

#define int int64_t

using pii = pair<int, int>;

const int NMAX = 2e5+5;

int n, k;
int a[NMAX];
vector<int> ans;

void read() {
   cin >> n >> k;
   for (int i = 1; i <= n + k; i++) {
      cin >> a[i];
   }
}

bool check(vector<int> a) {
   if (sz(a) == 2) return a[0] == a[1];

   sort(all(a));

   if (sz(a) / 2 % 2 == 0) {
      for (int i = 0; i < sz(a) / 2; i++)
         a[i] += a[sz(a) - i - 1];
      a.resize(sz(a) / 2);
   } else {
      for (int i = 0; i < sz(a) / 2 - 1; i++)
         a[i] += a[sz(a) - i - 1];
      a.resize(sz(a) / 2 + 1);
   }

   return check(a);
}

void solve() {
   if (k == 1) {
      vector<int> v;
      for (int i = 1; i <= n; i++)
         v.push_back(a[i]);
      for (int i = 0; i < n; i++) {
         if (i != n - 1)
            swap(v[i], v[n - 1]);
         if (check(v)) {
            ans = v;
            break;
         }
         if (i != n - 1)
            swap(v[i], v[n - 1]);
      }
   } else {
      for (int mask = 1; mask < 1 << (n + k); mask++) {
         if (__builtin_popcount(mask) != n) continue;
         vector<int> v;
         for (int i = 0; i < n + k; i++) {
            if (mask & (1 << i))
               v.push_back(a[i + 1]);
         }
         if (check(v)) {
            ans = v;
            break;
         }
      }
   }
   if (ans.empty()) exit(-1);
   sort(all(ans));
   for (auto &it : ans) {
      cout << it << ' ';
   }
   cout << endl;
}

signed main() {
#ifdef LOCAL
   freopen("input.txt", "r", stdin);
#endif

   read();
   solve();
   
   return 0;
}

• 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