oj.uz

Submission #413577

# Submission time Handle Problem Language Result Execution time Memory
413577 2021-05-29T00:32:46 Z Ozy Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 130 ms 13868 KB 
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i = (a); i <= (b); i++)
#define repa(i,a,b) for (int i = (a); i >= (b); i--)
#define lli long long int
#define debugsl(a) cout << #a << " = " << a << ", "
#define debug(a) cout << #a << " = " << a << endl

#define MAX 200000
#define val first
#define pos second

lli n,paso,a,act;
lli res[MAX+2],B[MAX+2],maximos[MAX+2];
pair<lli,lli> A[MAX+2];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n;
    rep(i,1,n+1) {
        cin >> A[i].val;
        A[i].pos = i;;
    }
    rep(i,1,n) cin >> B[i];

    sort(A+1, A+2+n);
    sort(B+1,B+n+1);

    rep(i,1,n) {
        a = max(A[i].val - B[i], 0ll);
        maximos[i] = max(a,maximos[i-1]);
    }

    res[A[n+1].pos] = maximos[n];
    act = 0;
    repa(i,n,1) {
        a = max(A[i+1].val - B[i], 0ll);
        act = max(act,a);

        res[A[i].pos] = max(act,maximos[i-1]);
    }

    rep(i,1,n+1) cout << res[i] << ' ';

    return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 276 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 2 ms 460 KB Output is correct
28 Correct 2 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 2 ms 464 KB Output is correct
32 Correct 2 ms 460 KB Output is correct
33 Correct 107 ms 12932 KB Output is correct
34 Correct 113 ms 13548 KB Output is correct
35 Correct 114 ms 13004 KB Output is correct
36 Correct 108 ms 13508 KB Output is correct
37 Correct 130 ms 13868 KB Output is correct
38 Correct 109 ms 13764 KB Output is correct
39 Correct 105 ms 12728 KB Output is correct
40 Correct 110 ms 12672 KB Output is correct
41 Correct 106 ms 12840 KB Output is correct
42 Correct 104 ms 12872 KB Output is correct
43 Correct 125 ms 12740 KB Output is correct
44 Correct 102 ms 12328 KB Output is correct
45 Correct 104 ms 12440 KB Output is correct
46 Correct 102 ms 12300 KB Output is correct
47 Correct 110 ms 12572 KB Output is correct
48 Correct 98 ms 12604 KB Output is correct
49 Correct 107 ms 13116 KB Output is correct
50 Correct 118 ms 13120 KB Output is correct
51 Correct 106 ms 13100 KB Output is correct
52 Correct 106 ms 13120 KB Output is correct
53 Correct 107 ms 13052 KB Output is correct