oj.uz

Submission #559735

# Submission time Handle Problem Language Result Execution time Memory
559735 2022-05-10T13:17:59 Z slime Table Tennis (info1cup20_tabletennis) C++14
100 / 100
 1732 ms 302816 KB 
#include "bits/stdc++.h"
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#ifdef ONLINE_JUDGE
const int MAXN = 2e5 + 10;
#endif
#ifndef ONLINE_JUDGE
const int MAXN = 1029;
#endif
const int MOD = 1e9 + 7;
#define ll __int128
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
ll read() { int x; cin >> x; return (ll)x; }
long long bm(long long b, long long p) {
  if(p==0) return 1 % MOD;
  long long r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
long long inv(long long b) { 
  return bm(b, MOD-2);
}
long long f[MAXN];
long long nCr(int n, int r) { 
  long long ans = f[n]; ans *= inv(f[r]); ans %= MOD;
  ans *= inv(f[n-r]); ans %= MOD; return ans;
}
void precomp() { for(int i=0; i<MAXN; i++) f[i] = (i == 0 ? 1 % MOD : (f[i-1] * i) % MOD); }
int fastlog(int x) {
  return (x == 0 ? -1 : 32 - __builtin_clz(x) - 1);
}
void gay(int i) { cout << "Case #" << i << ": "; }
void solve(int tc) {
  int n, k; cin >> n >> k;
  int a[n+k+1];
  for(int i=1; i<=n+k; i++) {
    cin >> a[i];
  }
  gp_hash_table<int, bool> yes;
  for(int i=1; i<=n+k; i++) yes[a[i]] = 1;
  vector<int> sums;
  if(n + k <= 4000) {
    for(int i=n; i<=n+k; i++) {
      for(int j=1; j<=k+1; j++) {
        if(j < i) sums.push_back(a[i] + a[j]);
      }
    }
  }
  else {
    gp_hash_table<int, int> freq;
    for(int i=0; i<44; i++) {
      int x = rnd(1, n + k);
      for(int j=1; j<=n+k; j++) {
        if(j != x) {
          freq[a[j] + a[x]]++;
          if(freq[a[j] + a[x]] == 30) {
            sums.push_back(a[j] + a[x]);
          }
        }
      }
    }
  }
  for(int x: sums) {
    int ct = 0;
    for(int i=1; i<=n+k; i++) {
      if(a[i] * 2 == x) continue;
      else if(yes[x - a[i]]) ct++;
    }
    if(ct >= n) {
      vector<int> v;
      int e = 0;
      for(int i=1; i<=n+k; i++) {
        if(a[i] * 2 == x) continue;
        if(yes[x - a[i]]) {
          v.push_back(a[i]);
          v.push_back(x - a[i]);
          e++;
          if(e == n/2) break;
        }
      }
      sort(v.begin(), v.end());
      for(int x: v) cout << x << " ";
      cout << "\n";
      return;
    }
  }
}
int32_t main() {
  precomp();
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
} 
// I don't know geometry. 
 
 
// n = 13, k = 3: 0000001010000
// n = 13, k = 5: 0000010001000
// n = 13, k = 7: 0001000100010
 
// if k < n/2 and n odd: 1[010...10]111...1

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1291 ms 3596 KB Output is correct
2 Correct 847 ms 302696 KB Output is correct
3 Correct 828 ms 302648 KB Output is correct
4 Correct 832 ms 302728 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 783 ms 302692 KB Output is correct
2 Correct 834 ms 302816 KB Output is correct
3 Correct 801 ms 302688 KB Output is correct
4 Correct 845 ms 302688 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 47 ms 19056 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 1092 KB Output is correct
5 Correct 1 ms 340 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 6 ms 2792 KB Output is correct
3 Correct 2 ms 436 KB Output is correct
4 Correct 4 ms 1620 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 1048 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 854 ms 302688 KB Output is correct
3 Correct 828 ms 302696 KB Output is correct
4 Correct 813 ms 302684 KB Output is correct
5 Correct 854 ms 302692 KB Output is correct
6 Correct 400 ms 26456 KB Output is correct
7 Correct 799 ms 302708 KB Output is correct
8 Correct 752 ms 302708 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 988 KB Output is correct
2 Correct 835 ms 302732 KB Output is correct
3 Correct 855 ms 302684 KB Output is correct
4 Correct 854 ms 302812 KB Output is correct
5 Correct 771 ms 302760 KB Output is correct
6 Correct 1732 ms 26448 KB Output is correct
7 Correct 916 ms 302692 KB Output is correct
8 Correct 847 ms 302756 KB Output is correct