oj.uz

Submission #1044398

# Submission time Handle Problem Language Result Execution time Memory
1044398 2024-08-05T09:18:23 Z underwaterkillerwhale Bubble Sort 2 (JOI18_bubblesort2) C++17
100 / 100
 1434 ms 202428 KB 
#include <bits/stdc++.h>
#define ll long long
#define rep(i,m,n) for(int i=(m); i<=(n); i++)
#define reb(i,m,n) for(int i=(m); i>=(n); i--)
#define MP make_pair
#define fs first
#define se second
#define bit(msk, i) ((msk >> i) & 1)
#define iter(id, v) for(auto id : v)
#define SZ(v) (int)v.size()
#define ALL(v) v.begin(),v.end()

using namespace std;

mt19937_64 rd(chrono :: steady_clock :: now ().time_since_epoch().count());
ll Rand (ll l, ll r) { return uniform_int_distribution<ll> (l, r) (rd); }

const int N = 1e6 + 7;
const int Mod = 1e9 + 7;
const int INF = 2e9;
const ll BASE = 137;

int n, nval, Q;
int a[N];
pair<int, int> qr[N];
vector<int> vals;
set<int, greater<int>> pos[N];

struct Segment_Tree {
    struct Node {
        int val, fs;
        Node () : fs(0), val(0) {};
    };
    int m;
    Node st[N << 2];
    int lz[N << 2];

    void init (int n) {
        m = n;
    }

    void down (int id) {
        rep (i, id << 1, id << 1 | 1) {
            st[i].val += lz[id];
            lz[i] += lz[id];
        }
        lz[id] = 0;
    }

    void update (int id, int l, int r, int u, int v, int val) {
        if (l > v || r < u) return;
        if (l >= u && r <= v) {
            st[id].val += val;
            lz[id] += val;
            return;
        }
        int mid = l + r >> 1;
        down(id);
        update (id << 1, l, mid, u, v, val);
        update (id << 1 | 1, mid + 1, r, u, v, val);
        st[id].val = max(st[id << 1].val, st[id << 1 | 1].val);
    }

    void Assign (int id, int l, int r, int pos, int val) {
        if (l > pos || r < pos) return;
        if (l == r) {
            st[id].val += val - st[id].fs;
            st[id].fs = val;
            return;
        }
        int mid = l + r >> 1;
        down(id);
        Assign (id << 1, l, mid, pos, val);
        Assign (id << 1 | 1, mid + 1, r, pos, val);
        st[id].val = max(st[id << 1].val, st[id << 1 | 1].val);
    }

    void update (int u, int v, int val) {
        update (1, 1, m, u, v, val);
    }

    void Assign (int pos, int val) {
        Assign (1, 1, m, pos, val);
    }
}ST;

int cps (int X) {
    return lower_bound(ALL(vals), X) - vals.begin() + 1;
}

//void solution() {
vector<int> countScans(vector<int> A, vector<int> X, vector<int> V) {
//    cin >> n;
//    rep (i, 1, n) cin >> a[i];
//    cin >> Q;
//    rep (i, 1, Q) cin >> qr[i].fs >> qr[i].se;
    n = SZ(A);
    Q = SZ(X);
    rep (i, 1, n) a[i] = A[i - 1];
    rep (i, 1, Q) qr[i].fs = X[i - 1], qr[i].se = V[i - 1];

    rep (i, 1, n) vals.push_back(a[i]);
    rep (i, 1, Q) vals.push_back(qr[i].se);
    sort (ALL(vals));
    vals.resize(nval =  (ALL(vals)) - vals.begin());
    rep (i, 1, n) a[i] = cps(a[i]);
    rep (i, 1, Q) qr[i].se = cps(qr[i].se);
    ST.init(nval);
    rep (i, 1, n) {
        pos[a[i]].insert(i);
        ST.Assign(a[i], i);
        ST.update (a[i], nval, -1);
    }
    rep (i, 1, nval) pos[i].insert(0);
    vector<int> Ans;
    rep (i, 1, Q) {
        int p, val;
        tie(p, val) = qr[i];
        ++p;
        pos[a[p]].erase(p);
        pos[val].insert(p);
        ST.Assign(a[p], *pos[a[p]].begin());
        ST.update(a[p], nval, 1);
        ST.Assign(val, *pos[val].begin());
        ST.update(val, nval, -1);
        a[p] = val;
        Ans.push_back(ST.st[1].val);
//        cout << ST.st[1].val <<"\n";
    }
    return Ans;

}

//#define file(name) freopen(name".inp","r",stdin); \
//freopen(name".out","w",stdout);
//int main () {
////    file("c");
//    ios_base :: sync_with_stdio(false); cin.tie(0); cout.tie(0);
//    int num_Test = 1;
////    cin >> num_Test;
//    while (num_Test--)
//        solution();
//}
/*
no bug challenge +2
4
1 2 3 4
2
0 3
2 1
*/

Compilation message

bubblesort2.cpp:134:1: warning: multi-line comment [-Wcomment]
  134 | //#define file(name) freopen(name".inp","r",stdin); \
      | ^
bubblesort2.cpp: In constructor 'Segment_Tree::Node::Node()':
bubblesort2.cpp:6:12: warning: 'Segment_Tree::Node::first' will be initialized after [-Wreorder]
    6 | #define fs first
      |            ^~~~~
bubblesort2.cpp:31:18: note: in expansion of macro 'fs'
   31 |         int val, fs;
      |                  ^~
bubblesort2.cpp:31:13: warning:   'int Segment_Tree::Node::val' [-Wreorder]
   31 |         int val, fs;
      |             ^~~
bubblesort2.cpp:32:9: warning:   when initialized here [-Wreorder]
   32 |         Node () : fs(0), val(0) {};
      |         ^~~~
bubblesort2.cpp: In member function 'void Segment_Tree::update(int, int, int, int, int, int)':
bubblesort2.cpp:57:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   57 |         int mid = l + r >> 1;
      |                   ~~^~~
bubblesort2.cpp: In member function 'void Segment_Tree::Assign(int, int, int, int, int)':
bubblesort2.cpp:71:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   71 |         int mid = l + r >> 1;
      |                   ~~^~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 84828 KB Output is correct
2 Correct 13 ms 84672 KB Output is correct
3 Correct 15 ms 85004 KB Output is correct
4 Correct 14 ms 85076 KB Output is correct
5 Correct 18 ms 85080 KB Output is correct
6 Correct 14 ms 85084 KB Output is correct
7 Correct 14 ms 85084 KB Output is correct
8 Correct 14 ms 84920 KB Output is correct
9 Correct 14 ms 85080 KB Output is correct
10 Correct 13 ms 85084 KB Output is correct
11 Correct 13 ms 85004 KB Output is correct
12 Correct 13 ms 85140 KB Output is correct
13 Correct 14 ms 85084 KB Output is correct
14 Correct 14 ms 85084 KB Output is correct
15 Correct 13 ms 85000 KB Output is correct
16 Correct 14 ms 85084 KB Output is correct
17 Correct 15 ms 84920 KB Output is correct
18 Correct 16 ms 84956 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 84828 KB Output is correct
2 Correct 13 ms 84672 KB Output is correct
3 Correct 15 ms 85004 KB Output is correct
4 Correct 14 ms 85076 KB Output is correct
5 Correct 18 ms 85080 KB Output is correct
6 Correct 14 ms 85084 KB Output is correct
7 Correct 14 ms 85084 KB Output is correct
8 Correct 14 ms 84920 KB Output is correct
9 Correct 14 ms 85080 KB Output is correct
10 Correct 13 ms 85084 KB Output is correct
11 Correct 13 ms 85004 KB Output is correct
12 Correct 13 ms 85140 KB Output is correct
13 Correct 14 ms 85084 KB Output is correct
14 Correct 14 ms 85084 KB Output is correct
15 Correct 13 ms 85000 KB Output is correct
16 Correct 14 ms 85084 KB Output is correct
17 Correct 15 ms 84920 KB Output is correct
18 Correct 16 ms 84956 KB Output is correct
19 Correct 21 ms 86108 KB Output is correct
20 Correct 22 ms 86364 KB Output is correct
21 Correct 21 ms 86364 KB Output is correct
22 Correct 23 ms 86328 KB Output is correct
23 Correct 27 ms 86352 KB Output is correct
24 Correct 22 ms 86364 KB Output is correct
25 Correct 21 ms 86360 KB Output is correct
26 Correct 21 ms 86276 KB Output is correct
27 Correct 21 ms 86104 KB Output is correct
28 Correct 22 ms 86104 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 87876 KB Output is correct
2 Correct 54 ms 91184 KB Output is correct
3 Correct 99 ms 94348 KB Output is correct
4 Correct 92 ms 94412 KB Output is correct
5 Correct 83 ms 94180 KB Output is correct
6 Correct 90 ms 94160 KB Output is correct
7 Correct 93 ms 94200 KB Output is correct
8 Correct 89 ms 94144 KB Output is correct
9 Correct 86 ms 94240 KB Output is correct
10 Correct 67 ms 94300 KB Output is correct
11 Correct 70 ms 94412 KB Output is correct
12 Correct 69 ms 94408 KB Output is correct
13 Correct 66 ms 94408 KB Output is correct
14 Correct 64 ms 94424 KB Output is correct
15 Correct 67 ms 94408 KB Output is correct
16 Correct 76 ms 94412 KB Output is correct
17 Correct 62 ms 94412 KB Output is correct
18 Correct 62 ms 94232 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 84828 KB Output is correct
2 Correct 13 ms 84672 KB Output is correct
3 Correct 15 ms 85004 KB Output is correct
4 Correct 14 ms 85076 KB Output is correct
5 Correct 18 ms 85080 KB Output is correct
6 Correct 14 ms 85084 KB Output is correct
7 Correct 14 ms 85084 KB Output is correct
8 Correct 14 ms 84920 KB Output is correct
9 Correct 14 ms 85080 KB Output is correct
10 Correct 13 ms 85084 KB Output is correct
11 Correct 13 ms 85004 KB Output is correct
12 Correct 13 ms 85140 KB Output is correct
13 Correct 14 ms 85084 KB Output is correct
14 Correct 14 ms 85084 KB Output is correct
15 Correct 13 ms 85000 KB Output is correct
16 Correct 14 ms 85084 KB Output is correct
17 Correct 15 ms 84920 KB Output is correct
18 Correct 16 ms 84956 KB Output is correct
19 Correct 21 ms 86108 KB Output is correct
20 Correct 22 ms 86364 KB Output is correct
21 Correct 21 ms 86364 KB Output is correct
22 Correct 23 ms 86328 KB Output is correct
23 Correct 27 ms 86352 KB Output is correct
24 Correct 22 ms 86364 KB Output is correct
25 Correct 21 ms 86360 KB Output is correct
26 Correct 21 ms 86276 KB Output is correct
27 Correct 21 ms 86104 KB Output is correct
28 Correct 22 ms 86104 KB Output is correct
29 Correct 29 ms 87876 KB Output is correct
30 Correct 54 ms 91184 KB Output is correct
31 Correct 99 ms 94348 KB Output is correct
32 Correct 92 ms 94412 KB Output is correct
33 Correct 83 ms 94180 KB Output is correct
34 Correct 90 ms 94160 KB Output is correct
35 Correct 93 ms 94200 KB Output is correct
36 Correct 89 ms 94144 KB Output is correct
37 Correct 86 ms 94240 KB Output is correct
38 Correct 67 ms 94300 KB Output is correct
39 Correct 70 ms 94412 KB Output is correct
40 Correct 69 ms 94408 KB Output is correct
41 Correct 66 ms 94408 KB Output is correct
42 Correct 64 ms 94424 KB Output is correct
43 Correct 67 ms 94408 KB Output is correct
44 Correct 76 ms 94412 KB Output is correct
45 Correct 62 ms 94412 KB Output is correct
46 Correct 62 ms 94232 KB Output is correct
47 Correct 330 ms 121944 KB Output is correct
48 Correct 1295 ms 192444 KB Output is correct
49 Correct 1409 ms 201916 KB Output is correct
50 Correct 1370 ms 201956 KB Output is correct
51 Correct 1377 ms 201912 KB Output is correct
52 Correct 1434 ms 201840 KB Output is correct
53 Correct 1374 ms 201972 KB Output is correct
54 Correct 1250 ms 202172 KB Output is correct
55 Correct 1314 ms 202168 KB Output is correct
56 Correct 1194 ms 202280 KB Output is correct
57 Correct 1284 ms 202392 KB Output is correct
58 Correct 1236 ms 202428 KB Output is correct
59 Correct 1094 ms 200700 KB Output is correct
60 Correct 1087 ms 200760 KB Output is correct
61 Correct 1118 ms 200832 KB Output is correct
62 Correct 1110 ms 200664 KB Output is correct
63 Correct 1162 ms 200764 KB Output is correct
64 Correct 1136 ms 200716 KB Output is correct
65 Correct 1012 ms 200564 KB Output is correct
66 Correct 1051 ms 200380 KB Output is correct
67 Correct 1022 ms 200556 KB Output is correct