oj.uz

답안 #897840

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
897840 2024-01-03T19:25:52 Z arbuzick Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 76 ms 11608 KB 
#include <bits/stdc++.h>

using namespace std;

void solve() {
    int n;
    cin >> n;
    vector<int> a(n + 1), b(n);
    vector<pair<int, int>> a_s(n + 1);
    for (int i = 0; i < n + 1; ++i) {
        cin >> a[i];
        a_s[i] = {a[i], i};
    }
    for (int i = 0; i < n; ++i) {
        cin >> b[i];
    }
    sort(a_s.begin(), a_s.end());
    sort(b.begin(), b.end());
    vector<int> ans(n + 1);
    vector<int> pr_ans(n + 1), suff_ans(n + 1);
    for (int i = 0; i < n; ++i) {
        pr_ans[i + 1] = max(pr_ans[i], a_s[i].first - b[i]);
    }
    for (int i = n; i > 0; --i) {
        suff_ans[i - 1] = max(suff_ans[i], a_s[i].first - b[i - 1]);
    }
    for (int i = 0; i < n + 1; ++i) {
        ans[a_s[i].second] = max(pr_ans[i], suff_ans[i]);
    }
    for (int i = 0; i < n + 1; ++i) {
        cout << ans[i] << ' ';
    }
    cout << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.precision(25);
    cout << fixed;
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 456 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 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 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 456 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 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 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 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 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 508 KB Output is correct
25 Correct 1 ms 520 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 456 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 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 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 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 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 508 KB Output is correct
25 Correct 1 ms 520 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 67 ms 10832 KB Output is correct
34 Correct 71 ms 11088 KB Output is correct
35 Correct 67 ms 10880 KB Output is correct
36 Correct 68 ms 11312 KB Output is correct
37 Correct 71 ms 11604 KB Output is correct
38 Correct 70 ms 11608 KB Output is correct
39 Correct 69 ms 10576 KB Output is correct
40 Correct 68 ms 10576 KB Output is correct
41 Correct 68 ms 10580 KB Output is correct
42 Correct 68 ms 10660 KB Output is correct
43 Correct 69 ms 10520 KB Output is correct
44 Correct 66 ms 10076 KB Output is correct
45 Correct 71 ms 10232 KB Output is correct
46 Correct 67 ms 10064 KB Output is correct
47 Correct 64 ms 10332 KB Output is correct
48 Correct 64 ms 10204 KB Output is correct
49 Correct 76 ms 10776 KB Output is correct
50 Correct 69 ms 10828 KB Output is correct
51 Correct 76 ms 10832 KB Output is correct
52 Correct 70 ms 10780 KB Output is correct
53 Correct 76 ms 10868 KB Output is correct