oj.uz

답안 #1094552

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1094552 2024-09-29T22:41:13 Z stefdasca Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 145 ms 11084 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);
    }
    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> ans(n+1);
    for (int i = 0; i <= n; i++) {
        ans[ties[i].second] = max(start[i], shifted[i]);
    }
    for (int i = 0; i <= n; i++) {
        cout << ans[i] << " ";
    }
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 376 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 432 KB Output is correct
12 Correct 0 ms 600 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 376 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 432 KB Output is correct
12 Correct 0 ms 600 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 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 2 ms 348 KB Output is correct
26 Correct 1 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 2 ms 348 KB Output is correct
32 Correct 1 ms 444 KB Output is correct

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 376 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 432 KB Output is correct
12 Correct 0 ms 600 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 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 2 ms 348 KB Output is correct
26 Correct 1 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 2 ms 348 KB Output is correct
32 Correct 1 ms 444 KB Output is correct
33 Correct 130 ms 10052 KB Output is correct
34 Correct 135 ms 10576 KB Output is correct
35 Correct 131 ms 10200 KB Output is correct
36 Correct 130 ms 10568 KB Output is correct
37 Correct 137 ms 11084 KB Output is correct
38 Correct 135 ms 10824 KB Output is correct
39 Correct 129 ms 9804 KB Output is correct
40 Correct 133 ms 9844 KB Output is correct
41 Correct 139 ms 10056 KB Output is correct
42 Correct 129 ms 10056 KB Output is correct
43 Correct 128 ms 9804 KB Output is correct
44 Correct 125 ms 9560 KB Output is correct
45 Correct 135 ms 9456 KB Output is correct
46 Correct 126 ms 9548 KB Output is correct
47 Correct 127 ms 9548 KB Output is correct
48 Correct 133 ms 9544 KB Output is correct
49 Correct 139 ms 10192 KB Output is correct
50 Correct 136 ms 10308 KB Output is correct
51 Correct 134 ms 10060 KB Output is correct
52 Correct 145 ms 10060 KB Output is correct
53 Correct 135 ms 10312 KB Output is correct