Submission #697448

#	Time	Username	Problem	Language	Result	Execution time	Memory
697448		hazzle	Table Tennis (info1cup20_tabletennis)	C++17	100 / 100	96 ms	10196 KiB

tabletennis

#include <bits/stdc++.h>
#define fr first
#define sc second
#define all(x) (x).begin(), (x).end()
#define pw(x) (1ll << x)
#define pb push_back
#define endl '\n'
#define sz(x) (int)((x).size())

using namespace std;

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

typedef long long ll;
typedef pair <int, int> pii;

inline void solve () {
    int n, k; cin >> n >> k;
    vector <int> a (n + k);
    for (auto &i : a) cin >> i;
    sort(all(a));

    set <int> used;

    for (int i = 0; i < k + 1; ++i) {
        for (int j = n + k - 1; j >= n - 2; --j) {
            if (used.find(a[i] + a[j]) != used.end()) continue;
            int s = a[i] + a[j];
            used.insert(s);
            int l = i + 1, r = j - 1;
            vector <int> ans; ans.reserve(n);
            ans.pb(a[i]); ans.pb(a[j]);
            while (l <= r && sz(ans) < n) {
                if (r - l + 1 + sz(ans) < n) break;
                if (a[l] + a[r] == s) {
                    ans.pb(a[l]); ans.pb(a[r]);
                    ++l, --r;
                }
                else if (a[l] + a[r] < s) ++l;
                else --r;
            }
            if (sz(ans) == n) {
                sort(all(ans));
                for (auto x : ans) cout << x << " ";
                return;
            }
        }
    }
    assert(0);
}

signed main () {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #ifdef LOCAL
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif // LOCAL
    int t = 1; //cin >> t;
    while (t--) solve();
    return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 9 / 9
• Subtask 3: 14 / 14
• Subtask 4: 15 / 15
• Subtask 5: 9 / 9
• Subtask 6: 14 / 14
• Subtask 7: 15 / 15
• Subtask 8: 13 / 13