제출 #675080

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
675080		jahsdwaijsd	Table Tennis (info1cup20_tabletennis)	C++14	100 / 100	79 ms	7360 KiB

tabletennis

/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
*/
#include <bits/stdc++.h>
#define taskname "bai3"
#define all(x) x.begin(), x.end()
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
using namespace std;

const int mxN = 2e5 + 5;
const int base = 1e9 + 1;
const int mod = 1e9 + 7;
const ll oo = 1e18;

int n, k, a[mxN];
map<int, int> s;

bool test(int l, int r) {
    vector<int> bruh, bruh1;
    int cnt = n + k - r + l - 1;
    int sum = a[l] + a[r];
    if(s.find(sum) != s.end()) return false;
    else s[sum]++;
    int actual_count = 0;
    while(l < r) {
        int tmp = a[l] + a[r];
        if(tmp == sum) {
            bruh.pb(a[l]);
            bruh1.pb(a[r]);
            ++l; --r;
            actual_count += 2;
        }
        else {
            ++cnt;
            if(tmp > sum) --r;
            else ++l;
        }
        if(cnt > k) return false;
        if(actual_count == n) {
            for(int i = 0; i * 2 < actual_count; ++i) cout << bruh[i] << " ";
            for(int i = (actual_count >> 1) - 1; i >= 0; --i) cout << bruh1[i] << " ";
            cout << endl;
            return true;
        }
    }
    for(int i = 0; i * 2 < actual_count; ++i) cout << bruh[i] << " ";
    for(int i = (actual_count >> 1) - 1; i >= 0; --i) cout << bruh1[i] << " ";
    cout << endl;
    return true;
}

void solve() {
    cin >> n >> k;
    for(int i = 1; i <= n + k; ++i) cin >> a[i];
    for(int i = 1; i <= k + 1; ++i) {
        for(int j = n + k; j >= n + i - 1; --j) {
            if(test(i, j)) return;
        }
    }
}

signed main() {
#ifdef CDuongg
    freopen("bai3.inp", "r", stdin);
    freopen("bai3.out", "w", stdout);
    auto start = chrono::high_resolution_clock::now();
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1; //cin >> t;
    while(t--) solve();

#ifdef CDuongg
    auto end = chrono::high_resolution_clock::now();
    cout << "\n"; for(int i = 1; i <= 100; ++i) cout << '=';
    cout << "\nExecution time: " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
#endif

}

• 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