oj.uz

Submission #1051278

# Submission time Handle Problem Language Result Execution time Memory
1051278 2024-08-10T03:27:16 Z fryingduc Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 60 ms 10840 KB 
#include "bits/stdc++.h"
using namespace std;

const int maxn = 2e5 + 5;
int n, b[maxn];

pair<int, int> a[maxn];

int ans[maxn];

int pref[maxn], suf[maxn];

void solve() {
    cin >> n;
    for(int i = 1; i <= n + 1; ++i) {
        cin >> a[i].first;
        a[i].second = i;
    }
    sort(a + 1, a + n + 2);
    for(int i = 1; i <= n; ++i) {
        cin >> b[i];
    }
    sort(b + 1, b + n + 1);
    for(int i = 1; i <= n; ++i) {
        pref[i] = max(pref[i - 1], a[i].first - b[i]);
    }
    for(int i = n; i; --i) {
        suf[i] = max(suf[i + 1], a[i + 1].first - b[i]);
    }
    
    for(int i = 1; i <= n + 1; ++i) {
        ans[a[i].second] = max(pref[i - 1], suf[i]);
    }
    
    for(int i = 1; i <= n + 1; ++i) {
        cout << ans[i] << " ";
    }
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    solve();
    return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 516 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 51 ms 10084 KB Output is correct
34 Correct 60 ms 10320 KB Output is correct
35 Correct 60 ms 10064 KB Output is correct
36 Correct 52 ms 10576 KB Output is correct
37 Correct 54 ms 10832 KB Output is correct
38 Correct 53 ms 10840 KB Output is correct
39 Correct 52 ms 9804 KB Output is correct
40 Correct 52 ms 9644 KB Output is correct
41 Correct 58 ms 9964 KB Output is correct
42 Correct 51 ms 9912 KB Output is correct
43 Correct 52 ms 9896 KB Output is correct
44 Correct 50 ms 9348 KB Output is correct
45 Correct 50 ms 9376 KB Output is correct
46 Correct 51 ms 9300 KB Output is correct
47 Correct 48 ms 9448 KB Output is correct
48 Correct 47 ms 9552 KB Output is correct
49 Correct 55 ms 10184 KB Output is correct
50 Correct 53 ms 10064 KB Output is correct
51 Correct 52 ms 10064 KB Output is correct
52 Correct 54 ms 10064 KB Output is correct
53 Correct 53 ms 10112 KB Output is correct