oj.uz

Submission #922292

# Submission time Handle Problem Language Result Execution time Memory
922292 2024-02-05T11:20:47 Z Ianis Table Tennis (info1cup20_tabletennis) C++17
11 / 100
 3000 ms 3944 KB 
#ifdef LOCAL
#include <iostream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <random>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#else
#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
#define cerr if (false) cerr 
#define endl '\n'
#endif

#define fi first
#define se second

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

#define lsb(x) (x & (-x))

#define bit(mask, i) (((mask) >> (i)) & 1)
#define popcount(x) __builtin_popcount(x)

#define YES cout << "YES" << endl
#define NO cout << "NO" << endl

using namespace std;

template <typename T>
bool ckmax(T &a, T b) { return a < b ? a = b, true : false; }
template <typename T>
bool ckmin(T &a, T b) { return a > b ? a = b, true : false; }

using ll = long long;
using pii = pair<int, int>;

const int NMAX = 15e4+5;

int n, k, m;
int a[NMAX];

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

void check(vector<int> v) {
   int n = int(v.size());
   assert(n % 2 == 0);
   for (int mask = 1; mask < 1 << n; mask++) {
      if (popcount(mask) != n / 2) continue;
      ll sum1 = 0, sum2 = 0;
      for (int i = 0; i < n; i++) {
         if (mask & (1 << i)) sum1 += v[i];
         else sum2 += v[i];
      }
      if (sum1 == sum2) {
         vector<int> v1, v2;
         for (int i = 0; i < n; i++) {
            if (mask & (1 << i)) v2.push_back(v[i]);
            else v1.push_back(v[i]);
         }
         for (auto &it : v1) cout << it << ' ';
         cout << endl;
         for (auto &it : v2) cout << it << ' ';
         cout << endl;
         return;
      }
   }
}

bool check(int blocked) {
   int l = 1, r = m;
   if (blocked == l) l++;
   if (blocked == r) r--;

   int sum1 = 0, sum2 = 0;
   int cnt = 0;
   while (l < r) {
      cnt++;
      if (cnt % 2) sum1 += a[l] + a[r];
      else sum2 += a[l] + a[r];

      l++;
      if (l == blocked) l++;
      r--;
      if (r == blocked) r--;
   }

   return sum1 == sum2;
}

void solve() {
   for (int i = 1; i <= m; i++) {
      if (check(i)) {
         for (int j = 1; j <= m; j++) {
            if (j != i)
               cout << a[j] << ' ';
         }
         cout << endl;
         return;
      }
   }
}

signed main() {
#ifdef LOCAL
   freopen("input.txt", "r", stdin);
#endif
   ios_base::sync_with_stdio(false);
   cin.tie(0);
   cout.tie(0);
   
   read();
   solve();

   return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 5 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 852 KB Output is correct
2 Correct 20 ms 3944 KB Output is correct
3 Execution timed out 3032 ms 2392 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3031 ms 2396 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -