oj.uz

답안 #879098

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
879098 2023-11-26T10:47:40 Z frostray8653 Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 103 ms 15548 KB 
#include <bits/stdc++.h>
#define int long long
#define IO ios::sync_with_stdio(0), cin.tie(0)
#define FOR(i, a, b) for (int i = a, I = b; i <= I; i++)
using namespace std;
using pii = pair<int, int>;
void dbg() {;}
template<class T, class ...U>
void dbg(T a, U ...b) { cout << a << " "; dbg(b...); }
void ent() { cout << "\n"; }

const int N = 200005;
pii a[N];
int b[N];
int dp_f[N], dp_b[N];
int ans[N];

signed main() {
    IO;

    int n;
    cin >> n;
    FOR(i, 1, n + 1) {
        cin >> a[i].first;
        a[i].second = i;
    }
    FOR(i, 1, n) cin >> b[i];
    sort(a + 1, a + (n + 1) + 1);
    sort(b + 1, b + n + 1);

    for (int i = 1; i <= n; i++)
        dp_f[i] = max(dp_f[i - 1], a[i].first - b[i]);
    for (int i = n + 1; i >= 2; i--)
        dp_b[i] = max(dp_b[i + 1], a[i].first - b[i - 1]);
    for (int i = 1; i <= n + 1; i++) {
        int res = max(dp_f[i - 1], dp_b[i + 1]);
        ans[a[i].second] = res;
    }
    for (int i = 1; i <= n + 1; i++)
        cout << ans[i] << " \n"[i == n + 1];

    return 0;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2512 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2512 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2524 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 1 ms 2548 KB Output is correct
21 Correct 2 ms 2396 KB Output is correct
22 Correct 2 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2648 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 2 ms 2392 KB Output is correct
28 Correct 1 ms 2532 KB Output is correct
29 Correct 2 ms 2396 KB Output is correct
30 Correct 2 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2528 KB Output is correct

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2512 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2524 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 1 ms 2548 KB Output is correct
21 Correct 2 ms 2396 KB Output is correct
22 Correct 2 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2648 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 2 ms 2392 KB Output is correct
28 Correct 1 ms 2532 KB Output is correct
29 Correct 2 ms 2396 KB Output is correct
30 Correct 2 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2528 KB Output is correct
33 Correct 71 ms 14696 KB Output is correct
34 Correct 76 ms 14996 KB Output is correct
35 Correct 73 ms 14772 KB Output is correct
36 Correct 69 ms 15328 KB Output is correct
37 Correct 81 ms 15548 KB Output is correct
38 Correct 71 ms 15440 KB Output is correct
39 Correct 69 ms 14420 KB Output is correct
40 Correct 70 ms 14572 KB Output is correct
41 Correct 69 ms 14572 KB Output is correct
42 Correct 68 ms 14628 KB Output is correct
43 Correct 85 ms 14416 KB Output is correct
44 Correct 96 ms 14160 KB Output is correct
45 Correct 69 ms 14164 KB Output is correct
46 Correct 77 ms 14004 KB Output is correct
47 Correct 96 ms 14144 KB Output is correct
48 Correct 67 ms 14164 KB Output is correct
49 Correct 72 ms 14676 KB Output is correct
50 Correct 103 ms 14700 KB Output is correct
51 Correct 71 ms 14840 KB Output is correct
52 Correct 102 ms 14672 KB Output is correct
53 Correct 71 ms 14796 KB Output is correct