oj.uz

Submission #540943

# Submission time Handle Problem Language Result Execution time Memory
540943 2022-03-22T03:19:10 Z Cookie197 Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 326 ms 17856 KB 
#include<iostream>
#include<vector>
#include<set>
#include<algorithm>
using namespace std;

#define ll long long
#define mp make_pair
#define pii pair<ll,ll>
#define endl "\n"
#define out(x) cout<< #x << " = " << x << endl

ll b[200005],ans[200005];
pii a[200005];
int n;
multiset<ll> ms;
signed main(){
    ios::sync_with_stdio(false); cin.tie(0);
    cin>>n;
    for (int i=1;i<=n+1;i++) cin>>a[i].first, a[i].second = i;
    for (int i=1;i<=n;i++) cin>>b[i];
    sort(a+1,a+2+n);
    sort(b+1,b+1+n);

    
    for (int i=1;i<=n;i++) ms.insert (max(0ll, a[i+1].first-b[i]));
    ans[a[1].second] = *(--ms.end());
    for (int i=2;i<=n+1;i++){
        //for (ll u:ms) cout<<u<<"  ";
        //cout<<endl;
        ll orig = max(0ll, a[i].first - b[i-1]);
        ll new_ = max(0ll, a[i-1].first - b[i-1]);
        ms.insert(new_);
        ms.erase(ms.lower_bound(orig));
        
        ans[a[i].second] = *(--ms.end());
    }
    for (int i=1;i<=n+1;i++) cout<<ans[i]<<" ";
    cout<<endl;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 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 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 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 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 3 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 1 ms 468 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 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 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 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 3 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 190 ms 16692 KB Output is correct
34 Correct 175 ms 17384 KB Output is correct
35 Correct 217 ms 16844 KB Output is correct
36 Correct 180 ms 17356 KB Output is correct
37 Correct 192 ms 17856 KB Output is correct
38 Correct 192 ms 17652 KB Output is correct
39 Correct 234 ms 16656 KB Output is correct
40 Correct 326 ms 16596 KB Output is correct
41 Correct 240 ms 16788 KB Output is correct
42 Correct 259 ms 16628 KB Output is correct
43 Correct 263 ms 16564 KB Output is correct
44 Correct 149 ms 16072 KB Output is correct
45 Correct 158 ms 16248 KB Output is correct
46 Correct 155 ms 16052 KB Output is correct
47 Correct 153 ms 16452 KB Output is correct
48 Correct 160 ms 16468 KB Output is correct
49 Correct 262 ms 17140 KB Output is correct
50 Correct 259 ms 17120 KB Output is correct
51 Correct 251 ms 17112 KB Output is correct
52 Correct 258 ms 17112 KB Output is correct
53 Correct 253 ms 17100 KB Output is correct