oj.uz

Submission #364223

# Submission time Handle Problem Language Result Execution time Memory
364223 2021-02-08T12:46:34 Z Lam_lai_cuoc_doi Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 128 ms 10860 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

const bool typetest = 0;
const int N = 2e5 + 5;
int n, id[N], ans[N];
int a[N], b[N], s[N], p[N];

void Read()
{
    cin >> n;
    for (int i = 1; i <= n + 1; ++i)
        cin >> a[i],
            id[i] = i;
    for (int i = 1; i <= n; ++i)
        cin >> b[i];
    sort(b + 1, b + n + 1);
    sort(id + 1, id + n + 2, [&](const int &x, const int &y) {
        return a[x] < a[y];
    });
    sort(a + 1, a + n + 2);
}

void Solve()
{
    for (int i = 1; i <= n; ++i)
        p[i] = max(p[i - 1], a[i] - b[i]);
    for (int i = n; i; --i)
        s[i] = max(s[i + 1], a[i + 1] - b[i]);
    for (int i = 1; i <= n + 1; ++i)
        ans[id[i]] = max(p[i - 1], s[i]);
    for (int i = 1; i <= n + 1; ++i)
        cout << ans[i] << " ";
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t(1);
    if (typetest)
        cin >> t;
    for (int _ = 1; _ <= t; ++_)
    {
        Read();
        Solve();
    }
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 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 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 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 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 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 364 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 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 2 ms 492 KB Output is correct
23 Correct 2 ms 492 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 2 ms 492 KB Output is correct
26 Correct 2 ms 492 KB Output is correct
27 Correct 2 ms 492 KB Output is correct
28 Correct 2 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 2 ms 492 KB Output is correct
31 Correct 2 ms 492 KB Output is correct
32 Correct 2 ms 492 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 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 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 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 364 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 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 2 ms 492 KB Output is correct
23 Correct 2 ms 492 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 2 ms 492 KB Output is correct
26 Correct 2 ms 492 KB Output is correct
27 Correct 2 ms 492 KB Output is correct
28 Correct 2 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 2 ms 492 KB Output is correct
31 Correct 2 ms 492 KB Output is correct
32 Correct 2 ms 492 KB Output is correct
33 Correct 116 ms 10052 KB Output is correct
34 Correct 123 ms 10604 KB Output is correct
35 Correct 122 ms 10092 KB Output is correct
36 Correct 121 ms 10604 KB Output is correct
37 Correct 128 ms 10860 KB Output is correct
38 Correct 125 ms 10732 KB Output is correct
39 Correct 124 ms 9836 KB Output is correct
40 Correct 119 ms 9836 KB Output is correct
41 Correct 125 ms 9964 KB Output is correct
42 Correct 121 ms 9840 KB Output is correct
43 Correct 120 ms 9836 KB Output is correct
44 Correct 118 ms 9452 KB Output is correct
45 Correct 119 ms 9580 KB Output is correct
46 Correct 119 ms 9580 KB Output is correct
47 Correct 93 ms 9452 KB Output is correct
48 Correct 95 ms 9452 KB Output is correct
49 Correct 124 ms 10092 KB Output is correct
50 Correct 123 ms 10092 KB Output is correct
51 Correct 122 ms 10092 KB Output is correct
52 Correct 122 ms 10092 KB Output is correct
53 Correct 123 ms 10092 KB Output is correct