oj.uz

Submission #1094553

# Submission time Handle Problem Language Result Execution time Memory
1094553 2024-09-29T22:43:09 Z Izzy Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 140 ms 7244 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int n;

int main() {
    cin >> n;
    vector<pair<int, int>> ties(n + 1);
    vector<int> current(n);
    for (int i = 0; i <= n; i++) {
        cin >> ties[i].first;
        ties[i].second = i;
    }
    for (int i = 0; i < n; i++) {
        cin >> current[i];
    }
    sort(ties.begin(), ties.end());
    sort(current.begin(), current.end());
    
    vector<int> start = {0};
    vector<int> shifted = {0};

    int temp1 = 0;
    int temp2 = 0;
    for (int i = 0; i < n; i++) {
        temp1 = max(temp1, ties[i].first - current[i]);
        start.push_back(temp1);
    }
    start.push_back(max(temp1, ties[n].first - current[n - 1]));
    for (int i = n - 1; i >= 0; i--) {
        temp2 = max(temp2, ties[i + 1].first - current[i]);
        shifted.push_back(temp2);
    }
    reverse(shifted.begin(), shifted.end());
    //indexing issue below?
    vector<int> answers(n + 1);
    for (int i = 0; i <= n; i++) {
        answers[ties[i].second] = max(start[i], shifted[i]);
    }
    for (auto i: answers) {
        cout << i << ' ';
    }
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 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 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 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 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 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 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 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 344 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 2 ms 348 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 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 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 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 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 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 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 344 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 2 ms 348 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 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 140 ms 6504 KB Output is correct
34 Correct 139 ms 6580 KB Output is correct
35 Correct 130 ms 6472 KB Output is correct
36 Correct 137 ms 6984 KB Output is correct
37 Correct 135 ms 7244 KB Output is correct
38 Correct 138 ms 6984 KB Output is correct
39 Correct 134 ms 6036 KB Output is correct
40 Correct 128 ms 6220 KB Output is correct
41 Correct 134 ms 6316 KB Output is correct
42 Correct 131 ms 6220 KB Output is correct
43 Correct 132 ms 6216 KB Output is correct
44 Correct 130 ms 5708 KB Output is correct
45 Correct 128 ms 5744 KB Output is correct
46 Correct 129 ms 5708 KB Output is correct
47 Correct 130 ms 5708 KB Output is correct
48 Correct 133 ms 5704 KB Output is correct
49 Correct 132 ms 6220 KB Output is correct
50 Correct 132 ms 6220 KB Output is correct
51 Correct 132 ms 6368 KB Output is correct
52 Correct 137 ms 6220 KB Output is correct
53 Correct 135 ms 6364 KB Output is correct