oj.uz

Submission #224015

# Submission time Handle Problem Language Result Execution time Memory
224015 2020-04-17T04:46:29 Z lyc Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 119 ms 7160 KB 
#include <bits/stdc++.h>
using namespace std;

#define TRACE(x) cerr << #x << " :: " << x << endl
#define _ << " " <<
#define SZ(x) (int)(x).size()
#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 MX_N = 2e5+5;

int N;
pair<int,int> A[MX_N];
int B[MX_N];

int P[MX_N], Q[MX_N], ans[MX_N];

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

    cin >> N;
    FOR(i,1,N+1){
        cin >> A[i].first;
        A[i].second = i;
    }
    FOR(i,1,N){
        cin >> B[i];
    }
    sort(A+1,A+1+N+1);
    sort(B+1,B+1+N);

    FOR(i,1,N){
        P[i] = max(P[i-1], max(A[i].first-B[i],0));
    }
    RFOR(i,N,1){
        Q[i] = max(Q[i+1], max(A[i+1].first-B[i],0));
    }

    FOR(i,1,N+1){
        ans[A[i].second] = max(P[i-1],Q[i]);
    }
    FOR(i,1,N+1){
        cout << ans[i] << (i==N+1?'\n':' ');
    }
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 5 ms 512 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 6 ms 384 KB Output is correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 6 ms 436 KB Output is correct
24 Correct 6 ms 384 KB Output is correct
25 Correct 6 ms 384 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 7 ms 384 KB Output is correct
29 Correct 6 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 6 ms 384 KB Output is correct
32 Correct 6 ms 512 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 5 ms 512 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 6 ms 384 KB Output is correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 6 ms 436 KB Output is correct
24 Correct 6 ms 384 KB Output is correct
25 Correct 6 ms 384 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 7 ms 384 KB Output is correct
29 Correct 6 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 6 ms 384 KB Output is correct
32 Correct 6 ms 512 KB Output is correct
33 Correct 109 ms 6392 KB Output is correct
34 Correct 115 ms 6596 KB Output is correct
35 Correct 115 ms 6440 KB Output is correct
36 Correct 111 ms 6880 KB Output is correct
37 Correct 116 ms 7160 KB Output is correct
38 Correct 116 ms 6904 KB Output is correct
39 Correct 111 ms 6136 KB Output is correct
40 Correct 111 ms 6076 KB Output is correct
41 Correct 116 ms 6140 KB Output is correct
42 Correct 115 ms 6300 KB Output is correct
43 Correct 109 ms 6140 KB Output is correct
44 Correct 111 ms 5752 KB Output is correct
45 Correct 108 ms 5752 KB Output is correct
46 Correct 108 ms 5752 KB Output is correct
47 Correct 111 ms 5624 KB Output is correct
48 Correct 102 ms 5624 KB Output is correct
49 Correct 119 ms 6264 KB Output is correct
50 Correct 119 ms 6264 KB Output is correct
51 Correct 117 ms 6200 KB Output is correct
52 Correct 111 ms 6264 KB Output is correct
53 Correct 116 ms 6264 KB Output is correct