oj.uz

Submission #696587

# Submission time Handle Problem Language Result Execution time Memory
696587 2023-02-07T00:31:25 Z hazzle Table Tennis (info1cup20_tabletennis) C++17
29 / 100
 1534 ms 8104 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define fi first
#define se second
#define all(m) (m).begin(), (m).end()
#define rall(m) (m).rbegin(), (m).rend()
#define vec vector
#define sz(a) (int) (a).size()
#define mpp make_pair
#define mtt make_tuple

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair <int, int> pii;
typedef tuple <int, int, int> tui;

template <typename T> bool umin(T &a, T b) { return a > b ? a = b, 1 : 0; }
template <typename T> bool umax(T &a, T b) { return a < b ? a = b, 1 : 0; }

mt19937 rng((uint64_t) new char);

int solve(){
        int n, k;
        cin >> n >> k;
        int z = n + k;
        vec <int> a(z);
        for (auto &i: a) cin >> i;
        gp_hash_table <int, null_type> s(all(a));

        auto get_ans = [&](int x){
                vec <int> ans;
                for (int i = 0; i < z; ++i){
                        if (s.find(x - a[i]) != s.end() && n){
                                ans.push_back(a[i]);
                                ans.push_back(x - a[i]);
                                s.erase(a[i]), n -= 2;
                        }
                }
                sort(all(ans));
                for (auto &i: ans) cout << i << " ";
                exit(0);
        };

        if (n <= k){
                for (int i = 0; i < z; ++i){
                        for (int j = i + 1; j < z; ++j){
                                int x = a[i] + a[j];
                                int cnt = 0;
                                for (int l = 0; l < z; ++l){
                                        cnt += s.find(x - a[l]) != s.end();
                                }
                                if (cnt >= n) get_ans(x);
                        }
                }
                return 0;
        }
        shuffle(all(a), rng);
        while(true){
                int ai = a[rng() % z];
                for (auto &aj: a){
                        int x = ai + aj;
                        int cnt = 0;
                        for (int i = 0; i < min(z, 3 * k); ++i){
                                cnt += s.find(x - a[i]) != s.end();
                        }
                        if (cnt > k) get_ans(x);
                }
        }
        return 0;
}

signed main(){
        ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
        int tst = 1; //cin >> tst;
        while(tst--) solve();
        return 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Incorrect 1 ms 340 KB Unexpected end of file - int32 expected
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 8096 KB Output is correct
2 Correct 59 ms 8104 KB Output is correct
3 Correct 57 ms 8072 KB Output is correct
4 Correct 52 ms 8092 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 22 ms 328 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 13 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 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 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 340 KB Unexpected end of file - int32 expected
3 Halted 0 ms 0 KB -

Subtask #7
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 114 ms 8104 KB Output is correct
3 Correct 155 ms 8096 KB Output is correct
4 Incorrect 43 ms 7116 KB Unexpected end of file - int32 expected
5 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1534 ms 8096 KB Output is correct
3 Correct 1175 ms 8100 KB Output is correct
4 Correct 523 ms 8100 KB Output is correct
5 Incorrect 34 ms 7116 KB Unexpected end of file - int32 expected
6 Halted 0 ms 0 KB -