oj.uz

답안 #424081

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
424081 2021-06-11T16:15:00 Z lyc Table Tennis (info1cup20_tabletennis) C++14
100 / 100
 81 ms 4400 KB 
#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 + 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.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 432 KB Output is correct
3 Correct 1 ms 332 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 588 KB Output is correct
2 Correct 36 ms 3320 KB Output is correct
3 Correct 35 ms 3096 KB Output is correct
4 Correct 35 ms 3780 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 2956 KB Output is correct
2 Correct 36 ms 2964 KB Output is correct
3 Correct 35 ms 2940 KB Output is correct
4 Correct 35 ms 2900 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct

Subtask #6
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct

Subtask #7
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 35 ms 2916 KB Output is correct
3 Correct 35 ms 2836 KB Output is correct
4 Correct 36 ms 2896 KB Output is correct
5 Correct 34 ms 2952 KB Output is correct
6 Correct 45 ms 2884 KB Output is correct
7 Correct 38 ms 2944 KB Output is correct
8 Correct 38 ms 2856 KB Output is correct

Subtask #8
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 57 ms 2936 KB Output is correct
3 Correct 37 ms 4384 KB Output is correct
4 Correct 52 ms 4276 KB Output is correct
5 Correct 38 ms 4288 KB Output is correct
6 Correct 43 ms 4368 KB Output is correct
7 Correct 81 ms 4400 KB Output is correct
8 Correct 39 ms 4328 KB Output is correct