oj.uz

Submission #766955

# Submission time Handle Problem Language Result Execution time Memory
766955 2023-06-26T09:31:45 Z Nelt Table Tennis (info1cup20_tabletennis) C++17
100 / 100
 59 ms 5588 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;
    ll l, r, cnt;
    ll ans[n], ptr;
    for (ll i = 0; i < n + k; i++)
    for (ll j = n + k - 1; j >= i + n - 1; j--)
    {
        cnt = j - i + 1;
        ptr = 0;
        l = i, r = j;
        while (l < r)
        {
            if (a[l] + a[r] == a[i] + a[j]) ans[ptr++] = a[l++], ans[ptr++] = a[r--];
            elif (a[l] + a[r] > a[i] + a[j]) cnt--, r--;
            else cnt--, l++;
            if (ptr >= n or cnt < n)
                break;
        }
        if (cnt == n)
        {
            // cout << i << " " << j << endl;
            sort(all(ans));
            for (ll i : ans)
                cout << i << " ";
            // assert(cnt == n);
            cout << endl;
            return;
        }
    }
    // assert(false);
}
/*
 
*/
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 504 KB Output is correct
2 Correct 1 ms 336 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 920 KB Output is correct
2 Correct 25 ms 4552 KB Output is correct
3 Correct 25 ms 4428 KB Output is correct
4 Correct 25 ms 4532 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 4420 KB Output is correct
2 Correct 26 ms 4516 KB Output is correct
3 Correct 26 ms 4540 KB Output is correct
4 Correct 25 ms 4440 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 324 KB Output is correct
5 Correct 1 ms 324 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 328 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 1 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 352 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 26 ms 4508 KB Output is correct
3 Correct 24 ms 4192 KB Output is correct
4 Correct 27 ms 4052 KB Output is correct
5 Correct 24 ms 4052 KB Output is correct
6 Correct 25 ms 4088 KB Output is correct
7 Correct 24 ms 4108 KB Output is correct
8 Correct 24 ms 4052 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 44 ms 4072 KB Output is correct
3 Correct 25 ms 5572 KB Output is correct
4 Correct 42 ms 5500 KB Output is correct
5 Correct 24 ms 5460 KB Output is correct
6 Correct 56 ms 5528 KB Output is correct
7 Correct 59 ms 5588 KB Output is correct
8 Correct 24 ms 5488 KB Output is correct