oj.uz

Submission #420040

# Submission time Handle Problem Language Result Execution time Memory
420040 2021-06-08T01:37:05 Z Marceantasy Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 131 ms 10820 KB 
#include <bits/stdc++.h>

using namespace std; 

#define ll long long
#define ar array

const int mxN = 2e5+10; 
int n, b[mxN];
ar<int, 2> a[mxN]; 
int dif1[mxN], dif2[mxN], ans[mxN]; 

int main(){
    std::ios_base::sync_with_stdio(false); std::cin.tie(0); std::cout.tie(0);

    cin >> n; 
    for(int i = 0; i<n+1; ++i){
        cin >> a[i][0], a[i][1] = i; 
    }
    for(int i = 0; i<n; ++i){
        cin >> b[i]; 
    }
    sort(a, a+n+1); 
    sort(b, b+n); 

    for(int i = 0; i<n; ++i){   
        dif1[i] = max(a[i+1][0]-b[i], 0); 
        dif2[i+1] = max(a[i][0]-b[i], 0); 
    }
    for(int i = n-1; i>=0; --i){
        dif1[i] = max(dif1[i], dif1[i+1]); 
    }
    for(int i = 1; i<=n; ++i){
        dif2[i] = max(dif2[i], dif2[i-1]); 
    }
    for(int i = 0; i<=n; ++i){
        ans[a[i][1]] = max(dif1[i], dif2[i]); 
    }
    for(int i = 0; i<=n; ++i){
        cout << ans[i] << " "; 
    }

}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 2 ms 328 KB Output is correct
32 Correct 2 ms 332 KB Output is correct
33 Correct 112 ms 9872 KB Output is correct
34 Correct 129 ms 10292 KB Output is correct
35 Correct 106 ms 10052 KB Output is correct
36 Correct 109 ms 10436 KB Output is correct
37 Correct 115 ms 10820 KB Output is correct
38 Correct 113 ms 10652 KB Output is correct
39 Correct 109 ms 9760 KB Output is correct
40 Correct 125 ms 9640 KB Output is correct
41 Correct 131 ms 9860 KB Output is correct
42 Correct 106 ms 9736 KB Output is correct
43 Correct 129 ms 9696 KB Output is correct
44 Correct 110 ms 9356 KB Output is correct
45 Correct 104 ms 9412 KB Output is correct
46 Correct 105 ms 9296 KB Output is correct
47 Correct 104 ms 9412 KB Output is correct
48 Correct 106 ms 9408 KB Output is correct
49 Correct 112 ms 9992 KB Output is correct
50 Correct 114 ms 10000 KB Output is correct
51 Correct 114 ms 10124 KB Output is correct
52 Correct 111 ms 9964 KB Output is correct
53 Correct 111 ms 9928 KB Output is correct