oj.uz

Submission #826506

# Submission time Handle Problem Language Result Execution time Memory
826506 2023-08-15T16:09:21 Z dijbkr Just Long Neckties (JOI20_ho_t1) C++14
100 / 100
 353 ms 27920 KB 
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    int n;
    cin >> n;
    pair<int,int>a[n+4];
    int b[n+4];
    for (int i=1; i<=n+1; i++) {
        cin >> a[i].first;
        a[i].second=i;
    }
    sort(a+1,a+n+1+1);
//    for (int i=1; i<=n+1; i++) {
//        cout << a[i].first << " " << a[i].second << endl;
//    }
    for (int i=1; i<=n; i++) {
        cin >> b[i];
    }
    sort(b+1,b+n+1);
    multiset<int>s;
    int ans[n+4];
    map<int,int>mp;
    for (int i=2; i<=n+1; i++) {
        s.insert(max(a[i].first-b[i-1],0));
        mp[i]=i-1;
        //cout << *--s.end();
        ans[a[1].second]=*--s.end();
    }
    //cout << ans[2] << endl;
    //cout << *--s.end() << endl;
    for (int i=2; i<=n+1; i++) {
        int cur=max(a[i].first-b[mp[i]],0);
        s.erase(s.find(cur));
        s.insert(max(a[i-1].first-b[mp[i]],0));
        mp[i-1]=mp[i];
        //cout << i << " " << a[i].second << endl;
        ans[a[i].second]=*--s.end();
    }
    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 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 320 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 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 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 320 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 2 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 2 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 564 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 2 ms 460 KB Output is correct

Subtask #3
91.0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 320 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 2 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 2 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 564 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 2 ms 460 KB Output is correct
33 Correct 305 ms 26244 KB Output is correct
34 Correct 290 ms 27440 KB Output is correct
35 Correct 256 ms 26560 KB Output is correct
36 Correct 278 ms 27128 KB Output is correct
37 Correct 272 ms 27920 KB Output is correct
38 Correct 264 ms 27564 KB Output is correct
39 Correct 347 ms 26496 KB Output is correct
40 Correct 336 ms 26272 KB Output is correct
41 Correct 339 ms 26668 KB Output is correct
42 Correct 346 ms 26508 KB Output is correct
43 Correct 342 ms 26360 KB Output is correct
44 Correct 226 ms 25696 KB Output is correct
45 Correct 234 ms 25972 KB Output is correct
46 Correct 238 ms 25736 KB Output is correct
47 Correct 237 ms 26628 KB Output is correct
48 Correct 243 ms 26568 KB Output is correct
49 Correct 336 ms 27208 KB Output is correct
50 Correct 349 ms 27236 KB Output is correct
51 Correct 342 ms 27212 KB Output is correct
52 Correct 342 ms 27232 KB Output is correct
53 Correct 353 ms 27212 KB Output is correct