oj.uz

Submission #364493

# Submission time Handle Problem Language Result Execution time Memory
364493 2021-02-09T10:44:32 Z bigDuck Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 126 ms 12908 KB 
#include<bits/stdc++.h>
using namespace std;
#define INIT  ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
#define int ll

int t, n, m, k, q, l, r;
int b[200010];
int p[200010], s[200010];

pii a[200010];
int c[200010];



int32_t main(){
INIT
cin>>n;
for(int i=1; i<=(n+1); i++){
    cin>>a[i].ft; a[i].sc=i;
    //a2[i]=a[i];
}
for(int i=1; i<=n; i++){
    cin>>b[i];
}
sort(b+1, b+n+1);
sort(a+1, a+2+n);
for(int i=(n+1); i>=2; i--){
    s[i]=max(s[i+1], a[i].ft-b[i-1]);
}
for(int i=1; i<=n; i++){
    p[i]=max(p[i-1],a[i].ft-b[i]);
}

for(int i=1; i<=(n+1); i++){
    c[a[i].sc ]=max(p[i-1], s[i+1]);
}
for(int i=1; i<=(n+1); i++){
    cout<<c[i]<<" ";
}
return 0;
}

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 364 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 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 364 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 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 492 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 2 ms 492 KB Output is correct
22 Correct 2 ms 540 KB Output is correct
23 Correct 1 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 512 KB Output is correct
27 Correct 2 ms 492 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 2 ms 512 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 364 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 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 492 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 2 ms 492 KB Output is correct
22 Correct 2 ms 540 KB Output is correct
23 Correct 1 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 512 KB Output is correct
27 Correct 2 ms 492 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 2 ms 512 KB Output is correct
32 Correct 2 ms 492 KB Output is correct
33 Correct 101 ms 12052 KB Output is correct
34 Correct 106 ms 12396 KB Output is correct
35 Correct 116 ms 12012 KB Output is correct
36 Correct 126 ms 12652 KB Output is correct
37 Correct 106 ms 12908 KB Output is correct
38 Correct 106 ms 12720 KB Output is correct
39 Correct 106 ms 12012 KB Output is correct
40 Correct 100 ms 11756 KB Output is correct
41 Correct 102 ms 12012 KB Output is correct
42 Correct 101 ms 11884 KB Output is correct
43 Correct 123 ms 11756 KB Output is correct
44 Correct 101 ms 11372 KB Output is correct
45 Correct 101 ms 11500 KB Output is correct
46 Correct 101 ms 11500 KB Output is correct
47 Correct 113 ms 11628 KB Output is correct
48 Correct 97 ms 11508 KB Output is correct
49 Correct 104 ms 12140 KB Output is correct
50 Correct 104 ms 12140 KB Output is correct
51 Correct 104 ms 12140 KB Output is correct
52 Correct 104 ms 12140 KB Output is correct
53 Correct 105 ms 12140 KB Output is correct