oj.uz

Submission #758540

# Submission time Handle Problem Language Result Execution time Memory
758540 2023-06-14T19:36:23 Z Hanksburger Bubble Sort 2 (JOI18_bubblesort2) C++17
60 / 100
 126 ms 19448 KB 
#include "bubblesort2.h"
#include <bits/stdc++.h>
using namespace std;
int seg[1000005], lazy[1000005];
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 2 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 4 ms 468 KB Output is correct
5 Correct 4 ms 468 KB Output is correct
6 Correct 6 ms 484 KB Output is correct
7 Correct 4 ms 504 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 448 KB Output is correct
12 Correct 4 ms 468 KB Output is correct
13 Correct 4 ms 468 KB Output is correct
14 Correct 4 ms 468 KB Output is correct
15 Correct 4 ms 476 KB Output is correct
16 Correct 4 ms 468 KB Output is correct
17 Correct 5 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 2 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 4 ms 468 KB Output is correct
5 Correct 4 ms 468 KB Output is correct
6 Correct 6 ms 484 KB Output is correct
7 Correct 4 ms 504 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 448 KB Output is correct
12 Correct 4 ms 468 KB Output is correct
13 Correct 4 ms 468 KB Output is correct
14 Correct 4 ms 468 KB Output is correct
15 Correct 4 ms 476 KB Output is correct
16 Correct 4 ms 468 KB Output is correct
17 Correct 5 ms 468 KB Output is correct
18 Correct 4 ms 468 KB Output is correct
19 Correct 17 ms 1140 KB Output is correct
20 Correct 16 ms 1212 KB Output is correct
21 Correct 15 ms 1216 KB Output is correct
22 Correct 16 ms 1224 KB Output is correct
23 Correct 15 ms 1188 KB Output is correct
24 Correct 15 ms 1108 KB Output is correct
25 Correct 16 ms 1108 KB Output is correct
26 Correct 14 ms 1184 KB Output is correct
27 Correct 15 ms 1180 KB Output is correct
28 Correct 14 ms 1196 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 1448 KB Output is correct
2 Correct 85 ms 3080 KB Output is correct
3 Correct 123 ms 5408 KB Output is correct
4 Correct 109 ms 5296 KB Output is correct
5 Correct 112 ms 5312 KB Output is correct
6 Correct 118 ms 5344 KB Output is correct
7 Correct 126 ms 5184 KB Output is correct
8 Correct 106 ms 5272 KB Output is correct
9 Correct 111 ms 5216 KB Output is correct
10 Correct 91 ms 4252 KB Output is correct
11 Correct 84 ms 4268 KB Output is correct
12 Correct 87 ms 4316 KB Output is correct
13 Correct 84 ms 4288 KB Output is correct
14 Correct 105 ms 4288 KB Output is correct
15 Correct 87 ms 4312 KB Output is correct
16 Correct 81 ms 4184 KB Output is correct
17 Correct 84 ms 4280 KB Output is correct
18 Correct 91 ms 4288 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 4 ms 468 KB Output is correct
5 Correct 4 ms 468 KB Output is correct
6 Correct 6 ms 484 KB Output is correct
7 Correct 4 ms 504 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 448 KB Output is correct
12 Correct 4 ms 468 KB Output is correct
13 Correct 4 ms 468 KB Output is correct
14 Correct 4 ms 468 KB Output is correct
15 Correct 4 ms 476 KB Output is correct
16 Correct 4 ms 468 KB Output is correct
17 Correct 5 ms 468 KB Output is correct
18 Correct 4 ms 468 KB Output is correct
19 Correct 17 ms 1140 KB Output is correct
20 Correct 16 ms 1212 KB Output is correct
21 Correct 15 ms 1216 KB Output is correct
22 Correct 16 ms 1224 KB Output is correct
23 Correct 15 ms 1188 KB Output is correct
24 Correct 15 ms 1108 KB Output is correct
25 Correct 16 ms 1108 KB Output is correct
26 Correct 14 ms 1184 KB Output is correct
27 Correct 15 ms 1180 KB Output is correct
28 Correct 14 ms 1196 KB Output is correct
29 Correct 22 ms 1448 KB Output is correct
30 Correct 85 ms 3080 KB Output is correct
31 Correct 123 ms 5408 KB Output is correct
32 Correct 109 ms 5296 KB Output is correct
33 Correct 112 ms 5312 KB Output is correct
34 Correct 118 ms 5344 KB Output is correct
35 Correct 126 ms 5184 KB Output is correct
36 Correct 106 ms 5272 KB Output is correct
37 Correct 111 ms 5216 KB Output is correct
38 Correct 91 ms 4252 KB Output is correct
39 Correct 84 ms 4268 KB Output is correct
40 Correct 87 ms 4316 KB Output is correct
41 Correct 84 ms 4288 KB Output is correct
42 Correct 105 ms 4288 KB Output is correct
43 Correct 87 ms 4312 KB Output is correct
44 Correct 81 ms 4184 KB Output is correct
45 Correct 84 ms 4280 KB Output is correct
46 Correct 91 ms 4288 KB Output is correct
47 Runtime error 87 ms 19448 KB Execution killed with signal 11
48 Halted 0 ms 0 KB -