oj.uz

Submission #1117991

# Submission time Handle Problem Language Result Execution time Memory
1117991 2024-11-24T15:32:59 Z heey Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 84 ms 15448 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long


signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n; cin >> n;
    vector<int> b(n);
    vector<pair<int,int>> a(n+1);
    for(int i = 0; i <= n; i++){
        int v; cin >> v;
        a[i] = {v, i};
    }
    for(int i = 0; i < n; i++) cin >> b[i];


    sort(b.begin(), b.end());
    sort(a.begin(), a.end());

    vector<int> p(n+1, 0), s(n+1, 0);

    for(int i = 1; i <= n; i++){
        p[i] = max(p[i-1], max(a[i-1].first -  b[i-1], 0ll));
    }

    for(int i = n-1; i >= 0; i--) s[i] = max(s[i+1], max(a[i+1].first - b[i], 0ll));

    /*cout << "prefix\n";
    for(int i = 0; i <= n; i++) cout << p[i] << ' ';
    cout << "\nsuffix\n";
    for(int i = 0; i <= n; i++) cout << s[i] << ' ';
    cout << '\n';*/


    vector<int> ans(n+1);
    for(int i = 0; i <= n; i++) ans[a[i].second] = max(p[i], s[i]);

    for(int i = 0; i <= n; i++) cout << ans[i] << ' ';

    return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 504 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 360 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 592 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 532 KB Output is correct
20 Correct 1 ms 508 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 2 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 592 KB Output is correct
26 Correct 1 ms 592 KB Output is correct
27 Correct 1 ms 504 KB Output is correct
28 Correct 2 ms 592 KB Output is correct
29 Correct 1 ms 508 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 2 ms 592 KB Output is correct
33 Correct 71 ms 14408 KB Output is correct
34 Correct 84 ms 15096 KB Output is correct
35 Correct 78 ms 14664 KB Output is correct
36 Correct 72 ms 14920 KB Output is correct
37 Correct 74 ms 15432 KB Output is correct
38 Correct 72 ms 15448 KB Output is correct
39 Correct 70 ms 14376 KB Output is correct
40 Correct 73 ms 14332 KB Output is correct
41 Correct 72 ms 14408 KB Output is correct
42 Correct 74 ms 14620 KB Output is correct
43 Correct 69 ms 14408 KB Output is correct
44 Correct 68 ms 13896 KB Output is correct
45 Correct 67 ms 13912 KB Output is correct
46 Correct 71 ms 13896 KB Output is correct
47 Correct 66 ms 14160 KB Output is correct
48 Correct 64 ms 14152 KB Output is correct
49 Correct 75 ms 14736 KB Output is correct
50 Correct 69 ms 14664 KB Output is correct
51 Correct 75 ms 14856 KB Output is correct
52 Correct 71 ms 14868 KB Output is correct
53 Correct 69 ms 14664 KB Output is correct