oj.uz

Submission #638685

# Submission time Handle Problem Language Result Execution time Memory
638685 2022-09-06T19:32:45 Z new_acc Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 87 ms 10868 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
#define pitem item*
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
const int N=1e6+10;
const int SS=1<<19;
const int INFi=2e9;
const ll INFl=1e16;
const ll mod2=998244353;
const ll mod=1e9+7;
const ll mod3=1000696969;
const ll p=70032301;
const ull p2=913;
const int L=20;
int t[N],n,maxi1[N],maxi2[N],res[N];
pair<int,int>sorted[N];
void solve(){
    cin>>n;
    for(int i=1;i<=n+1;i++){
        cin>>sorted[i].fi;
        sorted[i].se=i;
    }
    sort(sorted+1,sorted+2+n);
    for(int i=1;i<=n;i++) cin>>t[i];
    sort(t+1,t+1+n);
    for(int i=1;i<=n;i++)
        maxi1[i]=max(maxi1[i-1],sorted[i].fi-t[i]);
    for(int i=n+1;i>=2;i--)
        maxi2[i]=max(maxi2[i+1],sorted[i].fi-t[i-1]);
    for(int i=1;i<=n+1;i++)
        res[sorted[i].se]=max(maxi1[i-1],maxi2[i+1]);
    for(int i=1;i<=n+1;i++) cout<<res[i]<<" ";
    cout<<"\n";
}
int main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    int tt=1;
    while(tt--) solve();
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 1 ms 376 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 344 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 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 1 ms 376 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 344 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 83 ms 9932 KB Output is correct
34 Correct 87 ms 10372 KB Output is correct
35 Correct 84 ms 10060 KB Output is correct
36 Correct 83 ms 10520 KB Output is correct
37 Correct 86 ms 10868 KB Output is correct
38 Correct 87 ms 10696 KB Output is correct
39 Correct 81 ms 9772 KB Output is correct
40 Correct 81 ms 9656 KB Output is correct
41 Correct 81 ms 9804 KB Output is correct
42 Correct 82 ms 9804 KB Output is correct
43 Correct 81 ms 9672 KB Output is correct
44 Correct 82 ms 9292 KB Output is correct
45 Correct 80 ms 9360 KB Output is correct
46 Correct 81 ms 9316 KB Output is correct
47 Correct 79 ms 9488 KB Output is correct
48 Correct 77 ms 9488 KB Output is correct
49 Correct 83 ms 10060 KB Output is correct
50 Correct 84 ms 10060 KB Output is correct
51 Correct 85 ms 10032 KB Output is correct
52 Correct 84 ms 9992 KB Output is correct
53 Correct 84 ms 10044 KB Output is correct