oj.uz

Submission #697219

# Submission time Handle Problem Language Result Execution time Memory
697219 2023-02-08T23:33:15 Z hazzle Table Tennis (info1cup20_tabletennis) C++17
100 / 100
 753 ms 4016 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;

        auto check = [&](int x){
                int pl = 0, pr = z - 1;
                vec <int> ans;
                while(pl < pr && sz(ans) < n){
                        if (a[pl] + a[pr] == x){
                                ans.push_back(a[pl]);
                                ans.push_back(a[pr]);
                                ++pl, --pr;
                        }
                        else if (a[pl] + a[pr] < x) ++pl;
                        else --pr;
                }
                if (sz(ans) == n){
                        sort(all(ans));
                        for (auto &i: ans) cout << i << " ";
                        exit(0);
                }
        };

        if (n < 400){
                for (int i = 0; i < z; ++i){
                        for (int j = i + 1; j < z; ++j){
                                check(a[i] + a[j]);
                        }
                }
                assert(false);
        }
        int j = rng() % z;
        int l = max(0, z - j - k - 20), r = min(z, z - j + k + 20);
        for (int i = l; i < r; ++i){
                check(a[i] + a[j]);
        }
        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
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 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 6 ms 788 KB Output is correct
2 Correct 50 ms 3084 KB Output is correct
3 Correct 49 ms 3052 KB Output is correct
4 Correct 47 ms 3076 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 3036 KB Output is correct
2 Correct 41 ms 3084 KB Output is correct
3 Correct 48 ms 3132 KB Output is correct
4 Correct 36 ms 3012 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 7 ms 316 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 6 ms 320 KB Output is correct
5 Correct 1 ms 212 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 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 77 ms 3072 KB Output is correct
3 Correct 39 ms 3016 KB Output is correct
4 Correct 43 ms 3088 KB Output is correct
5 Correct 37 ms 3088 KB Output is correct
6 Correct 56 ms 4016 KB Output is correct
7 Correct 41 ms 3120 KB Output is correct
8 Correct 39 ms 3084 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 753 ms 3080 KB Output is correct
3 Correct 47 ms 3084 KB Output is correct
4 Correct 177 ms 3088 KB Output is correct
5 Correct 90 ms 3032 KB Output is correct
6 Correct 50 ms 3988 KB Output is correct
7 Correct 171 ms 3092 KB Output is correct
8 Correct 180 ms 3084 KB Output is correct