oj.uz

Submission #766902

# Submission time Handle Problem Language Result Execution time Memory
766902 2023-06-26T08:44:33 Z Nelt Table Tennis (info1cup20_tabletennis) C++17
87 / 100
 228 ms 4556 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define ANDROID                   \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void solve()
{
    ll n, k;
    cin >> n >> k;
    ll a[n + k];
    for (ll &i : a)
        cin >> i;
    sort(all(a));
    ll l, r, cnt, tot = 0;
    bool used[n + k];
    for (ll i = 0; i < n + k; i++)
    for (ll j = i + n - 1; j < n + k; j++)
    {
        cnt = 0;
        for (ll m = i; m <= j; m++)
            used[m] = 1;
        tot = 1;
        l = i + 1, r = j - 1;
        while (l < r)
        {
            if (a[l] + a[r] == a[i] + a[j]) l++, r--, tot++;
            elif (a[l] + a[r] > a[i] + a[j]) used[r--] = 0, cnt--;
            else used[l++] = 0, cnt--;
        }
        if (cnt <= k and !(((j - i + 1) - cnt) & 1))
        {
            // cout << i << " " << j << endl;
            for (ll m = i; m <= j; m++)
                if (used[m])
                    cout << a[m] << " ";
            cout << endl;
            return;
        }
    }
}
/*

*/
int main()
{
    ANDROID
    // precomp();
    ll t = 1;
    // cin >> t;
    for (ll i = 1; i <= t; i++)
        // cout << "Case #" << i << ": ",
        solve();
    cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}

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 4 ms 848 KB Output is correct
2 Correct 23 ms 4516 KB Output is correct
3 Correct 23 ms 4428 KB Output is correct
4 Correct 29 ms 4556 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 4532 KB Output is correct
2 Correct 23 ms 4540 KB Output is correct
3 Correct 24 ms 4540 KB Output is correct
4 Correct 22 ms 4556 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 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 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 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 324 KB Output is correct
2 Correct 1 ms 336 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 464 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 1 ms 212 KB Output is correct
2 Correct 140 ms 4508 KB Output is correct
3 Correct 27 ms 4428 KB Output is correct
4 Correct 44 ms 4468 KB Output is correct
5 Correct 28 ms 4540 KB Output is correct
6 Correct 32 ms 4516 KB Output is correct
7 Correct 52 ms 4544 KB Output is correct
8 Correct 25 ms 4436 KB Output is correct

Subtask #8
0 / 13.0

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