oj.uz

Submission #254874

# Submission time Handle Problem Language Result Execution time Memory
254874 2020-07-30T19:04:23 Z imeimi2000 Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 127 ms 10872 KB 
#include <bits/stdc++.h>

using namespace std;
typedef pair<int, int> pii;

int n;
pii A[200001];
int B[200001];
int L[200002];
int R[200002];
int ans[200001];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n;
    for (int i = 0; i <= n; ++i) {
        cin >> A[i].first;
        A[i].second = i;
    }
    for (int i = 1; i <= n; ++i) cin >> B[i];
    sort(A, A + (n + 1));
    sort(B + 1, B + (n + 1));
    for (int i = 1; i <= n; ++i) L[i] = max(L[i - 1], A[i - 1].first - B[i]);
    for (int i = n; i > 0; --i) R[i] = max(R[i + 1], A[i].first - B[i]);
    for (int i = 0; i <= n; ++i) ans[A[i].second] = max(L[i], R[i + 1]);
    for (int i = 0; i <= n; ++i) printf("%d%c", ans[i], "\n "[i < n]);
    return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 1 ms 512 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 2 ms 512 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 1 ms 512 KB Output is correct
30 Correct 1 ms 512 KB Output is correct
31 Correct 1 ms 512 KB Output is correct
32 Correct 1 ms 512 KB Output is correct
33 Correct 107 ms 10028 KB Output is correct
34 Correct 127 ms 10488 KB Output is correct
35 Correct 110 ms 10104 KB Output is correct
36 Correct 112 ms 10744 KB Output is correct
37 Correct 118 ms 10872 KB Output is correct
38 Correct 118 ms 10752 KB Output is correct
39 Correct 112 ms 9848 KB Output is correct
40 Correct 117 ms 9848 KB Output is correct
41 Correct 107 ms 9936 KB Output is correct
42 Correct 112 ms 9976 KB Output is correct
43 Correct 108 ms 9848 KB Output is correct
44 Correct 105 ms 9464 KB Output is correct
45 Correct 111 ms 9464 KB Output is correct
46 Correct 108 ms 9464 KB Output is correct
47 Correct 109 ms 9464 KB Output is correct
48 Correct 108 ms 9464 KB Output is correct
49 Correct 114 ms 10104 KB Output is correct
50 Correct 111 ms 10104 KB Output is correct
51 Correct 110 ms 10104 KB Output is correct
52 Correct 108 ms 10104 KB Output is correct
53 Correct 110 ms 10104 KB Output is correct