oj.uz

Submission #170213

# Submission time Handle Problem Language Result Execution time Memory
170213 2019-12-24T08:50:20 Z theboatman Simple game (IZhO17_game) C++17
22 / 100
 1000 ms 201076 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>

#define y1 theboatman
#define make_struct(args...) {args}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
template <typename T> using ordset = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const long long INF = ll(1e18) + 10;
const int inf = int(1e9) + 10;
const int N = int(1e6) + 10;

struct Tree {
    int n, timer;
    vector <ordset <pair <int, int> > > t;

    void init(int _n) {
        n = _n;
        timer = 0;

        t.resize(n + 1);
    }

    void add(int pos, int val) {
        for(int i = pos; i <= n; i += i & -i) {
            t[i].insert({val, timer++});
        }
    }

    void del(int pos, int val) {
        for(int i = pos; i <= n; i += i & -i) {
            t[i].erase(t[i].lower_bound({val, -inf}));
        }
    }

    int get(int pos, int r) {
        int ans = 0;
        for(int i = pos; i > 0; i -= i & -i) {
            ans += t[i].size() - t[i].order_of_key({r + 1, -inf});
        }

        return ans;
    }
};

void brute() {
    int n, m;
    cin >> n >> m;

    vector <int> a(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
    }

    while(m--) {
        int type;
        cin >> type;

        if (type == 1) {
            int pos, val;
            cin >> pos >> val;
            pos--;

            a[pos] = val;
        }
        else {
            int x;
            cin >> x;

            int ans = 0;
            for(auto i : a) {
                if (i == x) {
                    ans++;
                }
            }

            for(int i = 1; i < n; i++) {
                int l = min(a[i], a[i - 1]);
                int r = max(a[i], a[i - 1]);

                if (l < x && x < r) {
                    ans++;
                }
            }

            cout << ans << "\n";
        }
    }
}

int main() {
    //freopen("game.in", "r", stdin);
    //freopen("game.out", "w", stdout);

    cin.tie(0);
    ios::sync_with_stdio(0);

    int n, m;
    cin >> n >> m;

    vector <int> a(n);
    for(int i = 0; i < n; i++) {
        cin >> a[i];
    }

    Tree osu;
    osu.init(N);

    for(int i = 1; i < n; i++) {
        osu.add(min(a[i], a[i - 1]), max(a[i], a[i - 1]));
    }

    vector <int> cnt(N);
    for(int i = 0; i < n; i++) {
        cnt[a[i]]++;
    }

    for(int iq = 0; iq < m; iq++) {
        int type;
        cin >> type;

        if (type == 2) {
            int x;
            cin >> x;

            cout << cnt[x] + osu.get(x - 1, x) << "\n";
        }
        else {
            int pos, val;
            cin >> pos >> val;
            pos--;

            if (pos > 0) {
                osu.del(min(a[pos], a[pos - 1]), max(a[pos], a[pos - 1]));
            }

            if (pos < n - 1) {
                osu.del(min(a[pos], a[pos + 1]), max(a[pos], a[pos + 1]));
            }

            cnt[a[pos]]--;
            a[pos] = val;
            cnt[a[pos]]++;

            if (pos > 0) {
                osu.add(min(a[pos], a[pos - 1]), max(a[pos], a[pos - 1]));
            }

            if (pos < n - 1) {
                osu.add(min(a[pos], a[pos + 1]), max(a[pos], a[pos + 1]));
            }
        }
    }

    return 0;
}

/*
*/

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 98264 KB Output is correct
2 Correct 135 ms 98880 KB Output is correct
3 Correct 132 ms 98808 KB Output is correct
4 Correct 133 ms 98792 KB Output is correct
5 Correct 133 ms 98808 KB Output is correct
6 Correct 135 ms 98824 KB Output is correct
7 Correct 133 ms 99420 KB Output is correct

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 98264 KB Output is correct
2 Correct 135 ms 98880 KB Output is correct
3 Correct 132 ms 98808 KB Output is correct
4 Correct 133 ms 98792 KB Output is correct
5 Correct 133 ms 98808 KB Output is correct
6 Correct 135 ms 98824 KB Output is correct
7 Correct 133 ms 99420 KB Output is correct
8 Execution timed out 1096 ms 201076 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 98264 KB Output is correct
2 Correct 135 ms 98880 KB Output is correct
3 Correct 132 ms 98808 KB Output is correct
4 Correct 133 ms 98792 KB Output is correct
5 Correct 133 ms 98808 KB Output is correct
6 Correct 135 ms 98824 KB Output is correct
7 Correct 133 ms 99420 KB Output is correct
8 Execution timed out 1096 ms 201076 KB Time limit exceeded
9 Halted 0 ms 0 KB -