oj.uz

Submission #677012

# Submission time Handle Problem Language Result Execution time Memory
677012 2023-01-02T05:41:48 Z rittin1 Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 264 ms 24848 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    pair<int,int> a[n+2];
    int b[n+1];
    int ans[n+2];
    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(b+1,b+n+1);
    sort(a+1,a+n+2);
    int firstdiff[n+1];
    multiset<int> s;
    for(int i=1;i<=n;i++){
        firstdiff[i]=max(0LL,a[i].first-b[i]);
    }
    int secoddiff[n+1];
    for(int i=1;i<=n;i++){
        secoddiff[i]=max(0LL,a[i+1].first-b[i]);
        s.insert(secoddiff[i]);
    }
    for(int i=1;i<=n+1;i++){
        auto it=s.end();
        it--;
        int x=*it;
        ans[a[i].second]=x;
        if(i==n+1){
            break;
        }
        s.erase(s.find(secoddiff[i]));
        s.insert(firstdiff[i]);
        
    }
    for(int i=1;i<=n+1;i++){
        cout << ans[i] << " ";
    }
}

Subtask #1
1.0 / 1.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 0 ms 320 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 312 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 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 448 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 544 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 1 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 2 ms 468 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 0 ms 320 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 312 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 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 448 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 544 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 1 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 2 ms 468 KB Output is correct
33 Correct 168 ms 23280 KB Output is correct
34 Correct 186 ms 24300 KB Output is correct
35 Correct 169 ms 23448 KB Output is correct
36 Correct 178 ms 24096 KB Output is correct
37 Correct 179 ms 24848 KB Output is correct
38 Correct 167 ms 24504 KB Output is correct
39 Correct 232 ms 23536 KB Output is correct
40 Correct 236 ms 23284 KB Output is correct
41 Correct 237 ms 23732 KB Output is correct
42 Correct 227 ms 23500 KB Output is correct
43 Correct 223 ms 23368 KB Output is correct
44 Correct 153 ms 22756 KB Output is correct
45 Correct 165 ms 22932 KB Output is correct
46 Correct 153 ms 22708 KB Output is correct
47 Correct 156 ms 23512 KB Output is correct
48 Correct 158 ms 23500 KB Output is correct
49 Correct 235 ms 24076 KB Output is correct
50 Correct 236 ms 24104 KB Output is correct
51 Correct 264 ms 24012 KB Output is correct
52 Correct 241 ms 24148 KB Output is correct
53 Correct 241 ms 24072 KB Output is correct