oj.uz

Submission #369292

# Submission time Handle Problem Language Result Execution time Memory
369292 2021-02-21T07:05:15 Z phathnv Just Long Neckties (JOI20_ho_t1) C++11
100 / 100
 123 ms 10860 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = 2e5 + 2;

int n, a[N], b[N], c[N], ind[N], l[N], r[N];

void ReadInput(){
    cin >> n;
    for(int i = 1; i <= n + 1; i++)
        cin >> a[i];
    for(int i = 1; i <= n; i++)
        cin >> b[i];
}

void Solve(){
    for(int i = 1; i <= n + 1; i++)
        ind[i] = i;
    sort(ind + 1, ind + 2 + n, [](const int &x, const int &y){
            return a[x] < a[y];
         });
    sort(b + 1, b + 1 + n);
    l[0] = 0;
    for(int i = 1; i <= n; i++)
        l[i] = max(l[i - 1], max(0, a[ind[i]] - b[i]));
    r[n + 1] = 0;
    for(int i = n; i >= 1; i--)
        r[i] = max(r[i + 1], max(0, a[ind[i + 1]] - b[i]));
    for(int i = 1; i <= n + 1; i++)
        c[ind[i]] = max(l[i - 1], r[i]);
    for(int i = 1; i <= n + 1; i++)
        cout << c[i] << ' ';
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ReadInput();
    Solve();
    return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 2 ms 492 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 2 ms 492 KB Output is correct
21 Correct 2 ms 492 KB Output is correct
22 Correct 2 ms 492 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 2 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 2 ms 512 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 2 ms 492 KB Output is correct
32 Correct 2 ms 512 KB Output is correct
33 Correct 103 ms 10052 KB Output is correct
34 Correct 107 ms 10476 KB Output is correct
35 Correct 105 ms 10092 KB Output is correct
36 Correct 106 ms 10604 KB Output is correct
37 Correct 120 ms 10860 KB Output is correct
38 Correct 110 ms 10860 KB Output is correct
39 Correct 106 ms 9836 KB Output is correct
40 Correct 106 ms 9836 KB Output is correct
41 Correct 113 ms 9964 KB Output is correct
42 Correct 122 ms 9836 KB Output is correct
43 Correct 105 ms 9964 KB Output is correct
44 Correct 103 ms 9452 KB Output is correct
45 Correct 104 ms 9452 KB Output is correct
46 Correct 103 ms 9452 KB Output is correct
47 Correct 88 ms 9580 KB Output is correct
48 Correct 89 ms 9580 KB Output is correct
49 Correct 108 ms 10092 KB Output is correct
50 Correct 123 ms 10092 KB Output is correct
51 Correct 109 ms 10092 KB Output is correct
52 Correct 109 ms 10084 KB Output is correct
53 Correct 107 ms 10092 KB Output is correct