oj.uz

Submission #758541

# Submission time Handle Problem Language Result Execution time Memory
758541 2023-06-14T19:40:26 Z Hanksburger Bubble Sort 2 (JOI18_bubblesort2) C++17
60 / 100
 452 ms 50200 KB 
#include "bubblesort2.h"
#include <bits/stdc++.h>
using namespace std;
int seg[2000005], lazy[2000005];
vector<pair<int, int> > vec;
vector<int> ans;
void push(int i, int l, int r)
{
    if (l<r)
    {
        seg[i*2]+=lazy[i];
        seg[i*2+1]+=lazy[i];
        lazy[i*2]+=lazy[i];
        lazy[i*2+1]+=lazy[i];
        lazy[i]=0;
    }
}
void upd(int i, int l, int r, int ql, int qr, int val)
{
//    cout << "update " << l << ' ' << r << ' ' << ql << ' ' << qr << ' ' << val << '\n';
//    push(i, l, r);
    if (ql<=l && r<=qr)
    {
        seg[i]+=val;
        lazy[i]+=val;
        return;
    }
    int mid=(l+r)/2;
    if (ql<=mid && l<=qr)
        upd(i*2, l, mid, ql, qr, val);
    if (ql<=r && mid+1<=qr)
        upd(i*2+1, mid+1, r, ql, qr, val);
    seg[i]=max(seg[i*2], seg[i*2+1])+lazy[i];
//    cout << "seg[" << i << "] = " << seg[i] << " after considering " << seg[i*2] << " and " << seg[i*2+1] << '\n';
}
vector<int> countScans(vector<int> a, vector<int> x, vector<int> y)
{
    int n=a.size(), m=x.size();
    for (int i=0; i<n; i++)
        vec.push_back({a[i], i});
    for (int i=0; i<m; i++)
        vec.push_back({y[i], x[i]});
    sort(vec.begin(), vec.end());
    vec.erase(unique(vec.begin(), vec.end()), vec.end());
    int sz=vec.size();
//    for (int i=0; i<sz; i++)
//        cout << vec[i].first << ' ' << vec[i].second << '\n';
    for (int i=0; i<n; i++)
    {
        int ind=lower_bound(vec.begin(), vec.end(), make_pair(a[i], i))-vec.begin();
        int ind2=lower_bound(vec.begin(), vec.end(), make_pair(a[i], 0))-vec.begin();
        upd(1, 0, sz-1, ind, ind, i+1);
        upd(1, 0, sz-1, ind2, sz-1, -1);
    }
//    cout << "seg: " << '\n';
//    for (int i=8; i<=15; i++)
//        cout << seg[i] << ' ';
//    cout << '\n';
//    for (int j=1; j<=15; j++)
//            cout << j << ' ' << seg[j] << ' ' << lazy[j] << '\n';
    for (int i=0; i<m; i++)
    {
//        cout << "i=" << i << '\n';
        int ind=lower_bound(vec.begin(), vec.end(), make_pair(a[x[i]], x[i]))-vec.begin();
        int ind2=lower_bound(vec.begin(), vec.end(), make_pair(a[x[i]], 0))-vec.begin();
        upd(1, 0, sz-1, ind, ind, -x[i]-1);
        upd(1, 0, sz-1, ind2, sz-1, 1);
        a[x[i]]=y[i];
        ind=lower_bound(vec.begin(), vec.end(), make_pair(a[x[i]], x[i]))-vec.begin();
        ind2=lower_bound(vec.begin(), vec.end(), make_pair(a[x[i]], 0))-vec.begin();
        upd(1, 0, sz-1, ind, ind, x[i]+1);
        upd(1, 0, sz-1, ind2, sz-1, -1);
        ans.push_back(seg[1]);
//        for (int j=1; j<=15; j++)
//            cout << j << ' ' << seg[j] << ' ' << lazy[j] << '\n';
    }
    return ans;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 4 ms 468 KB Output is correct
4 Correct 5 ms 596 KB Output is correct
5 Correct 4 ms 468 KB Output is correct
6 Correct 4 ms 488 KB Output is correct
7 Correct 4 ms 468 KB Output is correct
8 Correct 4 ms 468 KB Output is correct
9 Correct 4 ms 468 KB Output is correct
10 Correct 4 ms 468 KB Output is correct
11 Correct 4 ms 468 KB Output is correct
12 Correct 5 ms 468 KB Output is correct
13 Correct 3 ms 468 KB Output is correct
14 Correct 4 ms 468 KB Output is correct
15 Correct 4 ms 468 KB Output is correct
16 Correct 5 ms 488 KB Output is correct
17 Correct 4 ms 468 KB Output is correct
18 Correct 4 ms 468 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 4 ms 468 KB Output is correct
4 Correct 5 ms 596 KB Output is correct
5 Correct 4 ms 468 KB Output is correct
6 Correct 4 ms 488 KB Output is correct
7 Correct 4 ms 468 KB Output is correct
8 Correct 4 ms 468 KB Output is correct
9 Correct 4 ms 468 KB Output is correct
10 Correct 4 ms 468 KB Output is correct
11 Correct 4 ms 468 KB Output is correct
12 Correct 5 ms 468 KB Output is correct
13 Correct 3 ms 468 KB Output is correct
14 Correct 4 ms 468 KB Output is correct
15 Correct 4 ms 468 KB Output is correct
16 Correct 5 ms 488 KB Output is correct
17 Correct 4 ms 468 KB Output is correct
18 Correct 4 ms 468 KB Output is correct
19 Correct 14 ms 984 KB Output is correct
20 Correct 17 ms 980 KB Output is correct
21 Correct 17 ms 1024 KB Output is correct
22 Correct 17 ms 1024 KB Output is correct
23 Correct 16 ms 984 KB Output is correct
24 Correct 16 ms 1016 KB Output is correct
25 Correct 15 ms 980 KB Output is correct
26 Correct 16 ms 1024 KB Output is correct
27 Correct 15 ms 1020 KB Output is correct
28 Correct 16 ms 1024 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 1436 KB Output is correct
2 Correct 85 ms 2660 KB Output is correct
3 Correct 141 ms 4672 KB Output is correct
4 Correct 115 ms 4664 KB Output is correct
5 Correct 110 ms 4752 KB Output is correct
6 Correct 119 ms 4740 KB Output is correct
7 Correct 134 ms 4608 KB Output is correct
8 Correct 119 ms 4672 KB Output is correct
9 Correct 114 ms 4620 KB Output is correct
10 Correct 123 ms 3584 KB Output is correct
11 Correct 107 ms 3560 KB Output is correct
12 Correct 104 ms 3540 KB Output is correct
13 Correct 93 ms 3588 KB Output is correct
14 Correct 90 ms 3548 KB Output is correct
15 Correct 94 ms 3576 KB Output is correct
16 Correct 89 ms 3556 KB Output is correct
17 Correct 82 ms 3648 KB Output is correct
18 Correct 82 ms 3664 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 4 ms 468 KB Output is correct
4 Correct 5 ms 596 KB Output is correct
5 Correct 4 ms 468 KB Output is correct
6 Correct 4 ms 488 KB Output is correct
7 Correct 4 ms 468 KB Output is correct
8 Correct 4 ms 468 KB Output is correct
9 Correct 4 ms 468 KB Output is correct
10 Correct 4 ms 468 KB Output is correct
11 Correct 4 ms 468 KB Output is correct
12 Correct 5 ms 468 KB Output is correct
13 Correct 3 ms 468 KB Output is correct
14 Correct 4 ms 468 KB Output is correct
15 Correct 4 ms 468 KB Output is correct
16 Correct 5 ms 488 KB Output is correct
17 Correct 4 ms 468 KB Output is correct
18 Correct 4 ms 468 KB Output is correct
19 Correct 14 ms 984 KB Output is correct
20 Correct 17 ms 980 KB Output is correct
21 Correct 17 ms 1024 KB Output is correct
22 Correct 17 ms 1024 KB Output is correct
23 Correct 16 ms 984 KB Output is correct
24 Correct 16 ms 1016 KB Output is correct
25 Correct 15 ms 980 KB Output is correct
26 Correct 16 ms 1024 KB Output is correct
27 Correct 15 ms 1020 KB Output is correct
28 Correct 16 ms 1024 KB Output is correct
29 Correct 29 ms 1436 KB Output is correct
30 Correct 85 ms 2660 KB Output is correct
31 Correct 141 ms 4672 KB Output is correct
32 Correct 115 ms 4664 KB Output is correct
33 Correct 110 ms 4752 KB Output is correct
34 Correct 119 ms 4740 KB Output is correct
35 Correct 134 ms 4608 KB Output is correct
36 Correct 119 ms 4672 KB Output is correct
37 Correct 114 ms 4620 KB Output is correct
38 Correct 123 ms 3584 KB Output is correct
39 Correct 107 ms 3560 KB Output is correct
40 Correct 104 ms 3540 KB Output is correct
41 Correct 93 ms 3588 KB Output is correct
42 Correct 90 ms 3548 KB Output is correct
43 Correct 94 ms 3576 KB Output is correct
44 Correct 89 ms 3556 KB Output is correct
45 Correct 82 ms 3648 KB Output is correct
46 Correct 82 ms 3664 KB Output is correct
47 Correct 452 ms 15912 KB Output is correct
48 Runtime error 283 ms 50200 KB Execution killed with signal 11
49 Halted 0 ms 0 KB -