oj.uz

Submission #256193

# Submission time Handle Problem Language Result Execution time Memory
256193 2020-08-02T11:15:08 Z IgorI Bubble Sort 2 (JOI18_bubblesort2) C++17
60 / 100
 9000 ms 14840 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ll> vll;

#define forn(i, n) for (int (i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define pb push_back
#define uniq(x) sort(all(x)); (x).resize(unique(all(x)) - (x).begin())

#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif // LOCAL

const int INF = 1e9 + 7;
const int K = 760;

struct Element{
    int x;
    int pos_order;
    int sp;
};

struct SegTree{
    vector<int> tree;
    vector<int> push;
    SegTree()
    {
        tree.resize(4 * K);
        push.resize(4 * K);
    }
    void Push(int V)
    {
        tree[2 * V + 1] += push[V];
        push[2 * V + 1] += push[V];
        tree[2 * V + 2] += push[V];
        push[2 * V + 2] += push[V];
        push[V] = 0;
    }
    void __Add(int l, int r, int x, int L, int R, int V)
    {
        if (l <= L && R <= r)
        {
            tree[V] += x;
            push[V] += x;
            return;
        }
        if (r <= L || R <= l)
        {
            return;
        }
        int M = (L + R) / 2;
        Push(V);
        __Add(l, r, x, L, M, 2 * V + 1);
        __Add(l, r, x, M, R, 2 * V + 2);
        tree[V] = max(tree[2 * V + 1], tree[2 * V + 2]);
    }
    int Add(int l, int r, int x)
    {
        __Add(l, r, x, 0, K, 0);
    }
    int __Get(int l, int r, int L, int R, int V)
    {
        if (l <= L && R <= r)
        {
            return tree[V];
        }
        if (r <= L || R <= l)
        {
            return 0;
        }
        int M = (L + R) / 2;
        Push(V);
        return max(__Get(l, r, L, M, 2 * V + 1), __Get(l, r, M, R, 2 * V + 2));
    }
    int Get(int l, int r)
    {
        return __Get(l, r, 0, K, 0);
    }
    void build(int L, int R, int V, vector<Element> &val)
    {
        if (L + 1 == R)
        {
            tree[V] = val[L].sp;
            push[V] = 0;
            return;
        }
        int M = (L + R) / 2;
        build(L, M, 2 * V + 1, val);
        build(M, R, 2 * V + 2, val);
        push[V] = 0;
        tree[V] = max(tree[2 * V + 1], tree[2 * V + 2]);
    }
    void destroy(int L, int R, int V, vector<Element> &val)
    {
        if (L + 1 == R)
        {
            val[L].sp = tree[V];
            return;
        }
        Push(V);
        int M = (L + R) / 2;
        destroy(L, M, 2 * V + 1, val);
        destroy(M, R, 2 * V + 2, val);
    }
};

bool comp(Element a, Element b)
{
    return a.x < b.x;
}

struct Block{
    SegTree d;
    vector<Element> a;
    Block()
    {
        a.resize(K);
        for (int i = 0; i < K; i++)
        {
            a[i].x = INF;
            a[i].pos_order = i;
        }
    }
    int cntmore(int x)
    {
        int L = -1, R = a.size();
        while (L + 1 < R)
        {
            int M = (L + R) / 2;
            if (a[M].x > x)
                R = M;
            else
                L = M;
        }
        return K - R;
    }
    void change(int pos_in_block, int initial, int A)
    {
        d.destroy(0, K, 0, a);
        int id = 0;
        for (int i = 0; i < K; i++)
        {
            if (a[i].pos_order == pos_in_block) id = i;
        }
        int Z = a[id].x;
        for (int i = 0; i < K; i++)
        {
            if (a[i].pos_order < pos_in_block)
            {
                if (a[i].x > A) initial++;
            }
            if (a[i].pos_order > pos_in_block)
            {
                a[i].sp -= Z > a[i].x;
                a[i].sp += A > a[i].x;
            }
        }
        a[id].x = A;
        a[id].sp = initial;
        sort(all(a), comp);
        d.build(0, K, 0, a);
    }
    void query(int x, int val)
    {
        int L = -1, R = K;
        while (L + 1 < R)
        {
            int M = (L + R) / 2;
            if (a[M].x < x)
                L = M;
            else
                R = M;
        }
        d.Add(0, L + 1, val);
    }
};

vi countScans(vi a, vi x, vi v)
{
    int n = a.size(), q = x.size();
    vi ans(q);
    vector<Block> data(n / K + 1);
    for (int i = 0; i < n; i++)
    {
        int bl = i / K;
        int ps = i % K;
        int initial = 0;
        for (int j = 0; j < bl; j++) initial += data[j].cntmore(a[i]);
        data[bl].change(ps, initial, a[i]);
    }
    for (int i = 0; i < q; i++)
    {
        int bl = x[i] / K;
        int ps = x[i] % K;
        int initial = 0;
        for (int j = 0; j < bl; j++) initial += data[j].cntmore(v[i]);
        data[bl].change(ps, initial, v[i]);
        int fr = a[x[i]];
        int to = v[i];
        a[x[i]] = v[i];
        for (int j = bl + 1; j < n / K + 1; j++) data[j].query(fr, -1);
        for (int j = bl + 1; j < n / K + 1; j++) data[j].query(to, 1);
        int answer = 0;
        for (int j = 0; j < n / K + 1; j++) answer = max(answer, data[j].d.Get(0, K));
        ans[i] = answer;
    }
    return ans;
}

#ifdef LOCAL
signed main()
{
    int n, q;
    cin >> n >> q;
    vi a(n), x(q), v(q);
    forn(i, n) cin >> a[i];
    forn(i, q) cin >> x[i] >> v[i];
    vi ans = countScans(a, x, v);
    forn(i, q) cout << ans[i] << "\n";
}
#endif // LOCAL

/*
10 10
1 2 3 4 5 1 2 3 4 5
0 10
1 9
2 8
3 7
4 6
5 5
6 4
7 3
8 2
9 1
*/

Compilation message

bubblesort2.cpp: In member function 'int SegTree::Add(int, int, int)':
bubblesort2.cpp:77:5: warning: no return statement in function returning non-void [-Wreturn-type]
     }
     ^

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 384 KB Output is correct
2 Correct 65 ms 448 KB Output is correct
3 Correct 152 ms 632 KB Output is correct
4 Correct 147 ms 512 KB Output is correct
5 Correct 165 ms 512 KB Output is correct
6 Correct 146 ms 512 KB Output is correct
7 Correct 156 ms 632 KB Output is correct
8 Correct 150 ms 512 KB Output is correct
9 Correct 146 ms 512 KB Output is correct
10 Correct 147 ms 548 KB Output is correct
11 Correct 157 ms 556 KB Output is correct
12 Correct 148 ms 512 KB Output is correct
13 Correct 145 ms 512 KB Output is correct
14 Correct 152 ms 512 KB Output is correct
15 Correct 162 ms 512 KB Output is correct
16 Correct 144 ms 512 KB Output is correct
17 Correct 142 ms 512 KB Output is correct
18 Correct 144 ms 512 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 384 KB Output is correct
2 Correct 65 ms 448 KB Output is correct
3 Correct 152 ms 632 KB Output is correct
4 Correct 147 ms 512 KB Output is correct
5 Correct 165 ms 512 KB Output is correct
6 Correct 146 ms 512 KB Output is correct
7 Correct 156 ms 632 KB Output is correct
8 Correct 150 ms 512 KB Output is correct
9 Correct 146 ms 512 KB Output is correct
10 Correct 147 ms 548 KB Output is correct
11 Correct 157 ms 556 KB Output is correct
12 Correct 148 ms 512 KB Output is correct
13 Correct 145 ms 512 KB Output is correct
14 Correct 152 ms 512 KB Output is correct
15 Correct 162 ms 512 KB Output is correct
16 Correct 144 ms 512 KB Output is correct
17 Correct 142 ms 512 KB Output is correct
18 Correct 144 ms 512 KB Output is correct
19 Correct 552 ms 1048 KB Output is correct
20 Correct 614 ms 1144 KB Output is correct
21 Correct 615 ms 1024 KB Output is correct
22 Correct 629 ms 1148 KB Output is correct
23 Correct 633 ms 1144 KB Output is correct
24 Correct 642 ms 1144 KB Output is correct
25 Correct 660 ms 1144 KB Output is correct
26 Correct 644 ms 1148 KB Output is correct
27 Correct 657 ms 1144 KB Output is correct
28 Correct 644 ms 1144 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1094 ms 1912 KB Output is correct
2 Correct 2715 ms 3224 KB Output is correct
3 Correct 4622 ms 4484 KB Output is correct
4 Correct 4636 ms 4472 KB Output is correct
5 Correct 4320 ms 4492 KB Output is correct
6 Correct 4380 ms 4496 KB Output is correct
7 Correct 4254 ms 4492 KB Output is correct
8 Correct 4233 ms 4600 KB Output is correct
9 Correct 4220 ms 4496 KB Output is correct
10 Correct 3265 ms 4576 KB Output is correct
11 Correct 3300 ms 4600 KB Output is correct
12 Correct 3394 ms 4600 KB Output is correct
13 Correct 3267 ms 4560 KB Output is correct
14 Correct 3257 ms 4600 KB Output is correct
15 Correct 3320 ms 4480 KB Output is correct
16 Correct 3214 ms 4600 KB Output is correct
17 Correct 3243 ms 4600 KB Output is correct
18 Correct 3223 ms 4552 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 384 KB Output is correct
2 Correct 65 ms 448 KB Output is correct
3 Correct 152 ms 632 KB Output is correct
4 Correct 147 ms 512 KB Output is correct
5 Correct 165 ms 512 KB Output is correct
6 Correct 146 ms 512 KB Output is correct
7 Correct 156 ms 632 KB Output is correct
8 Correct 150 ms 512 KB Output is correct
9 Correct 146 ms 512 KB Output is correct
10 Correct 147 ms 548 KB Output is correct
11 Correct 157 ms 556 KB Output is correct
12 Correct 148 ms 512 KB Output is correct
13 Correct 145 ms 512 KB Output is correct
14 Correct 152 ms 512 KB Output is correct
15 Correct 162 ms 512 KB Output is correct
16 Correct 144 ms 512 KB Output is correct
17 Correct 142 ms 512 KB Output is correct
18 Correct 144 ms 512 KB Output is correct
19 Correct 552 ms 1048 KB Output is correct
20 Correct 614 ms 1144 KB Output is correct
21 Correct 615 ms 1024 KB Output is correct
22 Correct 629 ms 1148 KB Output is correct
23 Correct 633 ms 1144 KB Output is correct
24 Correct 642 ms 1144 KB Output is correct
25 Correct 660 ms 1144 KB Output is correct
26 Correct 644 ms 1148 KB Output is correct
27 Correct 657 ms 1144 KB Output is correct
28 Correct 644 ms 1144 KB Output is correct
29 Correct 1094 ms 1912 KB Output is correct
30 Correct 2715 ms 3224 KB Output is correct
31 Correct 4622 ms 4484 KB Output is correct
32 Correct 4636 ms 4472 KB Output is correct
33 Correct 4320 ms 4492 KB Output is correct
34 Correct 4380 ms 4496 KB Output is correct
35 Correct 4254 ms 4492 KB Output is correct
36 Correct 4233 ms 4600 KB Output is correct
37 Correct 4220 ms 4496 KB Output is correct
38 Correct 3265 ms 4576 KB Output is correct
39 Correct 3300 ms 4600 KB Output is correct
40 Correct 3394 ms 4600 KB Output is correct
41 Correct 3267 ms 4560 KB Output is correct
42 Correct 3257 ms 4600 KB Output is correct
43 Correct 3320 ms 4480 KB Output is correct
44 Correct 3214 ms 4600 KB Output is correct
45 Correct 3243 ms 4600 KB Output is correct
46 Correct 3223 ms 4552 KB Output is correct
47 Execution timed out 9068 ms 14840 KB Time limit exceeded
48 Halted 0 ms 0 KB -