oj.uz

Submission #245416

# Submission time Handle Problem Language Result Execution time Memory
245416 2020-07-06T11:14:38 Z egekabas Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 118 ms 11768 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll>    pll;
typedef pair<ull, ull>    pull;
typedef pair<int, int>  pii;
typedef pair<ld, ld>  pld;
pll a[200009];
ll b[200009];
ll n;
ll ls[200009];
ll rs[200009];
ll ans[200009];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);

    //freopen("in.txt", "r", stdin);                                                                                             
    //freopen("out.txt", "w", stdout);
    
    cin >> n;
    for(ll i = 0; i <= n; ++i){
        cin >> a[i].ff;
        a[i].ss = i;
    }
    for(ll i = 0; i < n; ++i)
        cin >> b[i];
    sort(a, a+n+1);
    sort(b, b+n);
    ls[0] = max(0LL, a[0].ff-b[0]);
    for(ll i = 1; i < n; ++i)
        ls[i] = max(a[i].ff-b[i], ls[i-1]);
    for(ll i = n-1; i >= 0; --i)
        rs[i] = max(rs[i+1], a[i+1].ff-b[i]);

    for(ll i = 0; i <= n; ++i){
        ans[a[i].ss] = rs[i];
        if(i != 0)
            ans[a[i].ss] = max(ans[a[i].ss], ls[i-1]);
    }
    for(ll i = 0; i <= n; ++i)
        cout << ans[i] << ' ';
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 512 KB Output is correct
18 Correct 5 ms 512 KB Output is correct
19 Correct 5 ms 512 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 6 ms 512 KB Output is correct
23 Correct 6 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 6 ms 512 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 6 ms 512 KB Output is correct
32 Correct 6 ms 640 KB Output is correct
33 Correct 113 ms 10872 KB Output is correct
34 Correct 113 ms 11384 KB Output is correct
35 Correct 112 ms 11000 KB Output is correct
36 Correct 118 ms 11384 KB Output is correct
37 Correct 117 ms 11768 KB Output is correct
38 Correct 117 ms 11644 KB Output is correct
39 Correct 116 ms 10616 KB Output is correct
40 Correct 113 ms 10616 KB Output is correct
41 Correct 112 ms 10872 KB Output is correct
42 Correct 114 ms 10616 KB Output is correct
43 Correct 108 ms 10616 KB Output is correct
44 Correct 109 ms 10360 KB Output is correct
45 Correct 110 ms 10360 KB Output is correct
46 Correct 111 ms 10232 KB Output is correct
47 Correct 105 ms 10360 KB Output is correct
48 Correct 107 ms 10232 KB Output is correct
49 Correct 115 ms 10976 KB Output is correct
50 Correct 114 ms 11000 KB Output is correct
51 Correct 114 ms 10872 KB Output is correct
52 Correct 117 ms 10872 KB Output is correct
53 Correct 117 ms 10872 KB Output is correct