oj.uz

Submission #762940

# Submission time Handle Problem Language Result Execution time Memory
762940 2023-06-22T01:32:32 Z vjudge1 Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 85 ms 6900 KB 
#include <bits/stdc++.h>

using namespace std;

int n;
vector<pair<int, int>> a;
vector<int> b, prefLeft, prefRight, results;

int main()
{
    // freopen("inp.txt", "r", stdin);

    ios::sync_with_stdio(false);

    cin >> n;
    a.resize(n + 3); b.resize(n + 3);
    for (int i = 1; i <= n + 1; i++)
    {
        cin >> a[i].first;
        a[i].second = i;
    }
    for (int i = 1; i <= n; i++)
        cin >> b[i];

    sort(a.begin() + 1, a.begin() + n + 2);
    sort(b.begin() + 1, b.begin() + n + 1);

    prefLeft.resize(n + 3);
    for (int i = 1; i <= n; i++)
        prefLeft[i] = max(prefLeft[i - 1], max(a[i].first - b[i], 0));

    prefRight.resize(n + 3);
    for (int i = n + 1; i >= 2; i--)
        prefRight[i] = max(prefRight[i + 1], max(a[i].first - b[i - 1], 0));

    /*
    for (int i = 1; i <= n + 1; i++)
        cout << prefLeft[i] << ' ';
    cout << endl;
    for (int i = 1; i <= n + 1; i++)
        cout << prefRight[i] << ' ';
    cout << endl;
     */

    results.resize(n + 3);
    for (int i = 1; i <= n + 1; i++)
        results[a[i].second] = max(prefLeft[i - 1], prefRight[i + 1]);

    for (int i = 1; i <= n + 1; i++)
        cout << results[i] << ' ';
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 69 ms 6260 KB Output is correct
34 Correct 72 ms 6492 KB Output is correct
35 Correct 84 ms 6296 KB Output is correct
36 Correct 73 ms 6692 KB Output is correct
37 Correct 75 ms 6900 KB Output is correct
38 Correct 81 ms 6860 KB Output is correct
39 Correct 71 ms 5932 KB Output is correct
40 Correct 69 ms 5928 KB Output is correct
41 Correct 70 ms 6084 KB Output is correct
42 Correct 73 ms 5964 KB Output is correct
43 Correct 69 ms 5916 KB Output is correct
44 Correct 85 ms 5708 KB Output is correct
45 Correct 69 ms 5628 KB Output is correct
46 Correct 80 ms 5628 KB Output is correct
47 Correct 65 ms 5492 KB Output is correct
48 Correct 69 ms 5480 KB Output is correct
49 Correct 83 ms 6260 KB Output is correct
50 Correct 81 ms 6136 KB Output is correct
51 Correct 72 ms 6132 KB Output is correct
52 Correct 73 ms 6124 KB Output is correct
53 Correct 75 ms 6124 KB Output is correct