oj.uz

답안 #367195

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
367195 2021-02-16T14:02:55 Z piddddgy Just Long Neckties (JOI20_ho_t1) C++11
100 / 100
 111 ms 13932 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
// #define cerr if(false) cerr
#define watch(x) cerr << (#x) << " is " << (x) << endl;
#define endl '\n'
#define ld long double
#define int long long
#define pii pair<int, int>
#define fi first
#define se second
#define sz(a) (int)(a).size()
#define all(x) (x).begin(), (x).end()

const int maxn = 200500;

int n;
pii a[maxn];
int b[maxn];

int pre[maxn], suf[maxn];
int ans[maxn];

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n;

    for(int i = 1; i <= n+1; i++) {
        cin >> a[i].fi;
        a[i].se = i;
    }    

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

    sort(a+1, a+n+2);
    sort(b+1, b+n+1);

    for(int i = 1; i <= n; i++) {
        int o = max(a[i].fi-b[i], 0LL);

        pre[i] = max(pre[i-1], o);
    }

    for(int i = n; i >= 1; i--) {
        int o = max(a[i+1].fi-b[i], 0LL);

        suf[i] = max(suf[i+1], o);
    }

    for(int i = 1; i <= n+1; i++) {
        int val = max(pre[i-1], suf[i]);

        ans[a[i].se] = val;
    }

    for(int i = 1; i <= n+1; i++) {
        cout << ans[i] << " ";
    }
    cout << endl;
}

/*



Did you read the bounds?
Did you make typos?
Are there edge cases (N=1?)
Are array sizes proper?
Integer overflow?
DS reset properly between test cases?
Is using long longs causing TLE?
Are you using floating points?
*/

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 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 384 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 384 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

# 결과 실행 시간 메모리 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 384 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 384 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 512 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 1 ms 512 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 2 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 2 ms 492 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 1 ms 492 KB Output is correct
32 Correct 2 ms 492 KB Output is correct

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 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 384 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 384 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 512 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 1 ms 512 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 2 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 2 ms 492 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 1 ms 492 KB Output is correct
32 Correct 2 ms 492 KB Output is correct
33 Correct 99 ms 13036 KB Output is correct
34 Correct 107 ms 13420 KB Output is correct
35 Correct 101 ms 13036 KB Output is correct
36 Correct 103 ms 13604 KB Output is correct
37 Correct 111 ms 13932 KB Output is correct
38 Correct 105 ms 13804 KB Output is correct
39 Correct 103 ms 12780 KB Output is correct
40 Correct 104 ms 12780 KB Output is correct
41 Correct 109 ms 12908 KB Output is correct
42 Correct 111 ms 13036 KB Output is correct
43 Correct 101 ms 12780 KB Output is correct
44 Correct 109 ms 12416 KB Output is correct
45 Correct 102 ms 12524 KB Output is correct
46 Correct 99 ms 12396 KB Output is correct
47 Correct 96 ms 12652 KB Output is correct
48 Correct 110 ms 12524 KB Output is correct
49 Correct 104 ms 13164 KB Output is correct
50 Correct 111 ms 13164 KB Output is correct
51 Correct 110 ms 13164 KB Output is correct
52 Correct 105 ms 13164 KB Output is correct
53 Correct 109 ms 13292 KB Output is correct