oj.uz

Submission #256204

# Submission time Handle Problem Language Result Execution time Memory
256204 2020-08-02T11:26:57 Z IgorI Bubble Sort 2 (JOI18_bubblesort2) C++17
60 / 100
 9000 ms 11256 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 = 1000;

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;
        while (id > 0 && a[id - 1].x > a[id].x) swap(a[id - 1], a[id]), id--;
        while (id + 1 < K && a[id + 1].x < a[id].x) swap(a[id + 1], a[id]), id++;
        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 26 ms 504 KB Output is correct
2 Correct 42 ms 384 KB Output is correct
3 Correct 96 ms 512 KB Output is correct
4 Correct 98 ms 632 KB Output is correct
5 Correct 93 ms 512 KB Output is correct
6 Correct 91 ms 540 KB Output is correct
7 Correct 89 ms 512 KB Output is correct
8 Correct 96 ms 540 KB Output is correct
9 Correct 97 ms 512 KB Output is correct
10 Correct 94 ms 512 KB Output is correct
11 Correct 93 ms 512 KB Output is correct
12 Correct 92 ms 512 KB Output is correct
13 Correct 92 ms 632 KB Output is correct
14 Correct 94 ms 512 KB Output is correct
15 Correct 94 ms 548 KB Output is correct
16 Correct 92 ms 512 KB Output is correct
17 Correct 95 ms 512 KB Output is correct
18 Correct 123 ms 512 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 504 KB Output is correct
2 Correct 42 ms 384 KB Output is correct
3 Correct 96 ms 512 KB Output is correct
4 Correct 98 ms 632 KB Output is correct
5 Correct 93 ms 512 KB Output is correct
6 Correct 91 ms 540 KB Output is correct
7 Correct 89 ms 512 KB Output is correct
8 Correct 96 ms 540 KB Output is correct
9 Correct 97 ms 512 KB Output is correct
10 Correct 94 ms 512 KB Output is correct
11 Correct 93 ms 512 KB Output is correct
12 Correct 92 ms 512 KB Output is correct
13 Correct 92 ms 632 KB Output is correct
14 Correct 94 ms 512 KB Output is correct
15 Correct 94 ms 548 KB Output is correct
16 Correct 92 ms 512 KB Output is correct
17 Correct 95 ms 512 KB Output is correct
18 Correct 123 ms 512 KB Output is correct
19 Correct 357 ms 896 KB Output is correct
20 Correct 409 ms 896 KB Output is correct
21 Correct 372 ms 968 KB Output is correct
22 Correct 395 ms 964 KB Output is correct
23 Correct 380 ms 972 KB Output is correct
24 Correct 378 ms 896 KB Output is correct
25 Correct 380 ms 1016 KB Output is correct
26 Correct 388 ms 896 KB Output is correct
27 Correct 370 ms 1016 KB Output is correct
28 Correct 374 ms 896 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 715 ms 1792 KB Output is correct
2 Correct 1843 ms 2936 KB Output is correct
3 Correct 3144 ms 3944 KB Output is correct
4 Correct 3063 ms 3832 KB Output is correct
5 Correct 2960 ms 3960 KB Output is correct
6 Correct 2955 ms 4040 KB Output is correct
7 Correct 2960 ms 4032 KB Output is correct
8 Correct 3051 ms 3968 KB Output is correct
9 Correct 2863 ms 4032 KB Output is correct
10 Correct 2379 ms 4020 KB Output is correct
11 Correct 2301 ms 4028 KB Output is correct
12 Correct 2300 ms 4088 KB Output is correct
13 Correct 2320 ms 4032 KB Output is correct
14 Correct 2379 ms 4060 KB Output is correct
15 Correct 2449 ms 4032 KB Output is correct
16 Correct 2266 ms 4024 KB Output is correct
17 Correct 2255 ms 4028 KB Output is correct
18 Correct 2306 ms 4036 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 504 KB Output is correct
2 Correct 42 ms 384 KB Output is correct
3 Correct 96 ms 512 KB Output is correct
4 Correct 98 ms 632 KB Output is correct
5 Correct 93 ms 512 KB Output is correct
6 Correct 91 ms 540 KB Output is correct
7 Correct 89 ms 512 KB Output is correct
8 Correct 96 ms 540 KB Output is correct
9 Correct 97 ms 512 KB Output is correct
10 Correct 94 ms 512 KB Output is correct
11 Correct 93 ms 512 KB Output is correct
12 Correct 92 ms 512 KB Output is correct
13 Correct 92 ms 632 KB Output is correct
14 Correct 94 ms 512 KB Output is correct
15 Correct 94 ms 548 KB Output is correct
16 Correct 92 ms 512 KB Output is correct
17 Correct 95 ms 512 KB Output is correct
18 Correct 123 ms 512 KB Output is correct
19 Correct 357 ms 896 KB Output is correct
20 Correct 409 ms 896 KB Output is correct
21 Correct 372 ms 968 KB Output is correct
22 Correct 395 ms 964 KB Output is correct
23 Correct 380 ms 972 KB Output is correct
24 Correct 378 ms 896 KB Output is correct
25 Correct 380 ms 1016 KB Output is correct
26 Correct 388 ms 896 KB Output is correct
27 Correct 370 ms 1016 KB Output is correct
28 Correct 374 ms 896 KB Output is correct
29 Correct 715 ms 1792 KB Output is correct
30 Correct 1843 ms 2936 KB Output is correct
31 Correct 3144 ms 3944 KB Output is correct
32 Correct 3063 ms 3832 KB Output is correct
33 Correct 2960 ms 3960 KB Output is correct
34 Correct 2955 ms 4040 KB Output is correct
35 Correct 2960 ms 4032 KB Output is correct
36 Correct 3051 ms 3968 KB Output is correct
37 Correct 2863 ms 4032 KB Output is correct
38 Correct 2379 ms 4020 KB Output is correct
39 Correct 2301 ms 4028 KB Output is correct
40 Correct 2300 ms 4088 KB Output is correct
41 Correct 2320 ms 4032 KB Output is correct
42 Correct 2379 ms 4060 KB Output is correct
43 Correct 2449 ms 4032 KB Output is correct
44 Correct 2266 ms 4024 KB Output is correct
45 Correct 2255 ms 4028 KB Output is correct
46 Correct 2306 ms 4036 KB Output is correct
47 Execution timed out 9082 ms 11256 KB Time limit exceeded
48 Halted 0 ms 0 KB -