oj.uz

Submission #697434

# Submission time Handle Problem Language Result Execution time Memory
697434 2023-02-09T19:49:22 Z hazzle Table Tennis (info1cup20_tabletennis) C++17
87 / 100
 3000 ms 5576 KB 
#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;

#define int long long

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

    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 (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.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 352 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 988 KB Output is correct
2 Correct 32 ms 5520 KB Output is correct
3 Correct 30 ms 5572 KB Output is correct
4 Correct 43 ms 5560 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 5508 KB Output is correct
2 Correct 39 ms 5572 KB Output is correct
3 Correct 31 ms 5576 KB Output is correct
4 Correct 30 ms 5536 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 3 ms 724 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 444 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 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 0 ms 324 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 2 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 356 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 258 ms 5552 KB Output is correct
3 Correct 34 ms 5552 KB Output is correct
4 Correct 60 ms 5504 KB Output is correct
5 Correct 34 ms 5576 KB Output is correct
6 Correct 55 ms 5576 KB Output is correct
7 Correct 60 ms 5532 KB Output is correct
8 Correct 31 ms 5572 KB Output is correct

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Execution timed out 3039 ms 3356 KB Time limit exceeded
3 Halted 0 ms 0 KB -