oj.uz

Submission #953520

# Submission time Handle Problem Language Result Execution time Memory
953520 2024-03-26T05:07:48 Z irmuun Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 193 ms 21692 KB 
#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n;
    cin>>n;
    ll b[n+5];
    pair<ll,ll>a[n+5];
    ll ans[n+5];
    for(ll i=1;i<=n+1;i++){
        cin>>a[i].ff;
        a[i].ss=i;
    }
    for(ll i=1;i<=n;i++){
        cin>>b[i];
    }
    sort(a+1,a+n+2);
    sort(b+1,b+n+1);
    multiset<ll,greater<ll>>st;
    for(ll i=1;i<=n;i++){
        st.insert(a[i].ff-b[i]);
    }
    ans[a[n+1].ss]=*st.begin();
    for(ll i=n;i>=1;i--){
        st.erase(st.find(a[i].ff-b[i]));
        st.insert(a[i+1].ff-b[i]);
        ans[a[i].ss]=*st.begin();
    }
    for(ll i=1;i<=n+1;i++){
        cout<<max(ans[i],0ll)<<' ';
    }
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 532 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 1012 KB Output is correct
33 Correct 158 ms 18772 KB Output is correct
34 Correct 150 ms 21332 KB Output is correct
35 Correct 141 ms 20520 KB Output is correct
36 Correct 151 ms 21056 KB Output is correct
37 Correct 158 ms 21692 KB Output is correct
38 Correct 142 ms 21564 KB Output is correct
39 Correct 158 ms 20560 KB Output is correct
40 Correct 168 ms 20424 KB Output is correct
41 Correct 166 ms 20564 KB Output is correct
42 Correct 193 ms 20552 KB Output is correct
43 Correct 191 ms 20448 KB Output is correct
44 Correct 177 ms 19796 KB Output is correct
45 Correct 193 ms 19888 KB Output is correct
46 Correct 178 ms 19800 KB Output is correct
47 Correct 130 ms 20380 KB Output is correct
48 Correct 132 ms 20332 KB Output is correct
49 Correct 176 ms 21144 KB Output is correct
50 Correct 180 ms 21060 KB Output is correct
51 Correct 164 ms 21072 KB Output is correct
52 Correct 170 ms 20984 KB Output is correct
53 Correct 185 ms 20980 KB Output is correct