제출 #423809

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
423809		lyc	Table Tennis (info1cup20_tabletennis)	C++14	49 / 100	3059 ms	1612 KiB

tabletennis

#include <bits/stdc++.h>
using namespace std;

#define TRACE(x) cerr << #x << " :: " << x << endl
#define _ << " " <<
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(a);i>=(b);--i)

const int mxN = 150001;
const int mxK = 401;

int N, K;
int A[mxN], ls[mxN], rs[mxN], lp, rp;

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> N >> K;
    FOR(i,1,N+K){
        cin >> A[i];
    }

    FOR(i,1,K+1){
        RFOR(j,N+K,N+i-1){
            int mx = min(j-i+1-N, K-(i-1)-(N+K-j));

            //TRACE(i _ j _ mx);
            int l = i, r = j;
            int a = i+1, b = j-1, c = 0;

            lp = 0; rp = 0;
            ls[lp++] = l;
            rs[rp++] = r;
            while (c <= mx && lp+rp < N && a < b) {
                int cur = A[a]+A[b], tgt = A[l]+A[r];
                //TRACE(a _ b _ cur _ tgt);
                if (cur == tgt) {
                    l = a, r = b;
                    ls[lp++] = a++;
                    rs[rp++] = b--;
                } else {
                    ++c;
                    if (cur < tgt) ++a;
                    else --b;
                }
            }

            //TRACE(SZ(ls) _ SZ(rs) _ c);
            if (lp+rp == N) {
                FOR(x,0,lp-1) cout << A[ls[x]] << ' ';
                RFOR(x,rp-1,0) cout << A[rs[x]] << ' ';
                return 0;
            }
        }
    }

    assert(false);
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 9
• Subtask 3: 0 / 14
• Subtask 4: 15 / 15
• Subtask 5: 9 / 9
• Subtask 6: 14 / 14
• Subtask 7: 0 / 15
• Subtask 8: 0 / 13