제출 #766951

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
766951		Nelt	Table Tennis (info1cup20_tabletennis)	C++17	87 / 100	3053 ms	4504 KiB

tabletennis

#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)
                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 / 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: 0 / 13