oj.uz

답안 #996523

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
996523 2024-06-10T18:34:38 Z makrav Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 78 ms 10836 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;

#define all(a) (a).begin(), (a).end()
#define sz(a) (int) a.size()
#define pb push_back
#define ff first
#define sc second
#define pii pair<int, int>
#define f(i, l, r) for (int i = (l); i < (r); i++)
#define double ld

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n; cin >> n;
    vector<pair<int, int>> a(n + 1); 
    vector<int> b(n);
    for (int i = 0; i < n + 1; i++) {
        cin >> a[i].first;
        a[i].second = i;
    }
    for (int i = 0; i < n; i++) cin >> b[i];
    sort(all(a));
    sort(all(b));
    vector<int> pref(n+1,0), suff(n+1,0);
    for (int i = 1; i <= n; i++) {
        pref[i] = max(pref[i - 1], a[i - 1].first - b[i - 1]);
        suff[i] = max(suff[i - 1], a[n + 1 - i].first - b[n - i]);
    }
    vector<int> pos(n + 1, 0);
    for (int i = 0; i <= n; i++) pos[a[i].second] = i;
    for (int i = 0; i <= n; i++) {
        cout << max(pref[pos[i]], suff[n - pos[i]]) << ' ';
    }
    cout<<'\n';

    return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 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 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 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 348 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 348 KB Output is correct
23 Correct 1 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 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 344 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 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 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 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 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 348 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 348 KB Output is correct
23 Correct 1 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 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 344 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 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 78 ms 10068 KB Output is correct
34 Correct 73 ms 10468 KB Output is correct
35 Correct 64 ms 10064 KB Output is correct
36 Correct 67 ms 10576 KB Output is correct
37 Correct 67 ms 10832 KB Output is correct
38 Correct 70 ms 10836 KB Output is correct
39 Correct 64 ms 9820 KB Output is correct
40 Correct 72 ms 9812 KB Output is correct
41 Correct 71 ms 9788 KB Output is correct
42 Correct 64 ms 9812 KB Output is correct
43 Correct 64 ms 9808 KB Output is correct
44 Correct 67 ms 9296 KB Output is correct
45 Correct 71 ms 9488 KB Output is correct
46 Correct 62 ms 9296 KB Output is correct
47 Correct 58 ms 9556 KB Output is correct
48 Correct 58 ms 9584 KB Output is correct
49 Correct 73 ms 10324 KB Output is correct
50 Correct 67 ms 9968 KB Output is correct
51 Correct 68 ms 9972 KB Output is correct
52 Correct 67 ms 10068 KB Output is correct
53 Correct 70 ms 10068 KB Output is correct