oj.uz

Submission #762991

# Submission time Handle Problem Language Result Execution time Memory
762991 2023-06-22T02:11:21 Z vjudge1 Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 75 ms 6936 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 200005;
pair <int, int> a[N];
int b[N];
int diff[N], diff2[N], ans[N];
int st[4*N];
int n;

void build(int l, int r, int id){
    if (l == r){
        st[id] = diff[l];
        return;
    }
    int mid = (l+r)/2;
    build(l, mid, 2*id);
    build(mid+1, r, 2*id+1);
    st[id] = max(st[2*id], st[2*id+1]);
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    cin >> n;
    for (int i = 1; i <= n+1; i++){
        cin >> a[i].first;
        a[i].second = i;
    }
    for (int i = 1; i <= n; i++){
        cin >> b[i];
    }
    sort(a + 1, a + n + 2);
    sort(b + 1, b + n + 1);
    diff[1] = max(a[1].first - b[1], 0);
    diff2[n+1] = max(a[n+1].first - b[n], 0);
    for (int i = 2; i <= n; i++){
        diff[i] = max(diff[i-1], max(a[i].first - b[i], 0));
    }
    for (int i = n; i > 1; i--){
        diff2[i] = max(diff2[i+1], max(a[i].first - b[i-1], 0));
    }
    for (int i = 1; i <= n+1; i++){
        ans[a[i].second] = max(diff[i-1], diff2[i+1]);
    }
    for (int i = 1; i <= n+1; i++){
        cout << ans[i] << ' ';
    }
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 67 ms 6284 KB Output is correct
34 Correct 70 ms 6552 KB Output is correct
35 Correct 69 ms 6284 KB Output is correct
36 Correct 69 ms 6908 KB Output is correct
37 Correct 71 ms 6936 KB Output is correct
38 Correct 74 ms 6916 KB Output is correct
39 Correct 68 ms 5928 KB Output is correct
40 Correct 68 ms 5992 KB Output is correct
41 Correct 72 ms 6068 KB Output is correct
42 Correct 68 ms 6004 KB Output is correct
43 Correct 68 ms 5916 KB Output is correct
44 Correct 66 ms 5668 KB Output is correct
45 Correct 67 ms 5648 KB Output is correct
46 Correct 69 ms 5752 KB Output is correct
47 Correct 73 ms 5464 KB Output is correct
48 Correct 64 ms 5452 KB Output is correct
49 Correct 71 ms 6076 KB Output is correct
50 Correct 70 ms 6108 KB Output is correct
51 Correct 69 ms 6160 KB Output is correct
52 Correct 75 ms 6112 KB Output is correct
53 Correct 69 ms 6144 KB Output is correct