oj.uz

Submission #156198

# Submission time Handle Problem Language Result Execution time Memory
156198 2019-10-04T11:29:41 Z theboatman Money (IZhO17_money) C++11
45 / 100
 1500 ms 56220 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
#pragma comment(linker, "/stack:200000000")

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

using namespace std;

const int inf = 1e9 + 10;
const int N = 1e6 + 10;

struct tree {
    int n;
    vector <int> t, f;

    void init(int temp) {
        n = temp;
        t.resize(n);
        f.resize(n);
    }

    void inc(int pos) {
        if(f[pos])return;
        f[pos] = 1;
        for(int i = pos; i <= n; i += i & -i) {
            t[i] += 1;
        }
    }

    int get(int pos) {
        int res = 0;
        for(int i = pos; i > 0; i -= i & -i) {
            res += t[i];
        }

        return res;
    }

    int get(int l, int r) {
        return get(r) - get(l - 1);
    }
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);

    int n;
    cin >> n;

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

    int now = 0, x = 0;
    while(now < n && x <= a[now]) {
        x = a[now];
        now++;
    }

    tree bank;
    bank.init(N);

    set <int> s;
    int l = inf, r = -inf;
    for(int i = 0; i < now; i++) {
        bank.inc(a[i]);

        l = min(l, a[i]);
        r = max(r, a[i]);

        s.insert(a[i]);
    }


    int ans = 0;
    for(int i = now; i < n; i++) {
        ans++;

        if (a[i] >= r) {
            int x = 0;
            while(i < n && x <= a[i]) {
                x = a[i];

                l = min(l, a[i]);
                r = max(r, a[i]);


                bank.inc(x);
                s.insert(x);

                i++;
            }
            i--;
        }
        else {
            vector <int> lazy;
            if (a[i] < l) {
                int x = 0;
                while(i < n && x <= a[i] && a[i] <= l) {
                    x = a[i];
                    lazy.push_back(x);
                    i++;
                }
                i--;
            }
            else {
                int x = 0;
                int les = *--s.upper_bound(a[i]);

                while(i < n && x <= a[i]) {
                    auto more = s.lower_bound(a[i]);
                    if (more == s.end()) {
                        break;
                    }

                    int pos = bank.get(1, les);
                    int pos1 = bank.get(1, *more);

                    //cout << les << " " << *more << " " << pos << " " << pos1 << " " << i << endl;

                    if (pos1 - pos <= 1) {
                        x = a[i];
                        lazy.push_back(x);
                        i++;
                    }
                    else {
                        break;
                    }
                }

                i--;
            }

            for(auto it : lazy) {
                bank.inc(it);
                s.insert(it);

                l = min(l, it);
                r = max(r, it);

            }
        }
    }

    cout << ans + 1 << "\n";
    return 0;
}

/*
find_by_order(X) k -> элемент, нумерация с нуля
order_of_key(X) кол-во < чем X
*/

Compilation message

money.cpp:5:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/stack:200000000")

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8184 KB Output is correct
2 Correct 9 ms 8184 KB Output is correct
3 Correct 9 ms 8184 KB Output is correct
4 Correct 9 ms 8184 KB Output is correct
5 Correct 9 ms 8184 KB Output is correct
6 Correct 9 ms 8184 KB Output is correct
7 Correct 9 ms 8184 KB Output is correct
8 Correct 9 ms 8184 KB Output is correct
9 Correct 9 ms 8184 KB Output is correct
10 Correct 9 ms 8184 KB Output is correct
11 Correct 9 ms 8184 KB Output is correct
12 Correct 9 ms 8184 KB Output is correct
13 Correct 9 ms 8184 KB Output is correct
14 Correct 9 ms 8184 KB Output is correct
15 Correct 9 ms 8184 KB Output is correct
16 Correct 9 ms 8184 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8184 KB Output is correct
2 Correct 9 ms 8184 KB Output is correct
3 Correct 9 ms 8184 KB Output is correct
4 Correct 9 ms 8184 KB Output is correct
5 Correct 9 ms 8184 KB Output is correct
6 Correct 9 ms 8184 KB Output is correct
7 Correct 9 ms 8184 KB Output is correct
8 Correct 9 ms 8184 KB Output is correct
9 Correct 9 ms 8184 KB Output is correct
10 Correct 9 ms 8184 KB Output is correct
11 Correct 9 ms 8184 KB Output is correct
12 Correct 9 ms 8184 KB Output is correct
13 Correct 9 ms 8184 KB Output is correct
14 Correct 9 ms 8184 KB Output is correct
15 Correct 9 ms 8184 KB Output is correct
16 Correct 9 ms 8184 KB Output is correct
17 Correct 8 ms 8184 KB Output is correct
18 Correct 8 ms 8184 KB Output is correct
19 Correct 9 ms 8184 KB Output is correct
20 Correct 9 ms 8184 KB Output is correct
21 Correct 9 ms 8184 KB Output is correct
22 Correct 9 ms 8128 KB Output is correct
23 Correct 9 ms 8232 KB Output is correct
24 Correct 9 ms 8156 KB Output is correct
25 Correct 9 ms 8184 KB Output is correct
26 Correct 9 ms 8184 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8184 KB Output is correct
2 Correct 9 ms 8184 KB Output is correct
3 Correct 9 ms 8184 KB Output is correct
4 Correct 9 ms 8184 KB Output is correct
5 Correct 9 ms 8184 KB Output is correct
6 Correct 9 ms 8184 KB Output is correct
7 Correct 9 ms 8184 KB Output is correct
8 Correct 9 ms 8184 KB Output is correct
9 Correct 9 ms 8184 KB Output is correct
10 Correct 9 ms 8184 KB Output is correct
11 Correct 9 ms 8184 KB Output is correct
12 Correct 9 ms 8184 KB Output is correct
13 Correct 9 ms 8184 KB Output is correct
14 Correct 9 ms 8184 KB Output is correct
15 Correct 9 ms 8184 KB Output is correct
16 Correct 9 ms 8184 KB Output is correct
17 Correct 8 ms 8184 KB Output is correct
18 Correct 8 ms 8184 KB Output is correct
19 Correct 9 ms 8184 KB Output is correct
20 Correct 9 ms 8184 KB Output is correct
21 Correct 9 ms 8184 KB Output is correct
22 Correct 9 ms 8128 KB Output is correct
23 Correct 9 ms 8232 KB Output is correct
24 Correct 9 ms 8156 KB Output is correct
25 Correct 9 ms 8184 KB Output is correct
26 Correct 9 ms 8184 KB Output is correct
27 Correct 9 ms 8184 KB Output is correct
28 Correct 9 ms 8184 KB Output is correct
29 Correct 9 ms 8184 KB Output is correct
30 Correct 9 ms 8188 KB Output is correct
31 Correct 9 ms 8184 KB Output is correct
32 Correct 9 ms 8184 KB Output is correct
33 Correct 9 ms 8184 KB Output is correct
34 Correct 9 ms 8188 KB Output is correct
35 Correct 9 ms 8176 KB Output is correct
36 Correct 9 ms 8184 KB Output is correct
37 Correct 9 ms 8184 KB Output is correct
38 Correct 9 ms 8184 KB Output is correct

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8184 KB Output is correct
2 Correct 9 ms 8184 KB Output is correct
3 Correct 9 ms 8184 KB Output is correct
4 Correct 9 ms 8184 KB Output is correct
5 Correct 9 ms 8184 KB Output is correct
6 Correct 9 ms 8184 KB Output is correct
7 Correct 9 ms 8184 KB Output is correct
8 Correct 9 ms 8184 KB Output is correct
9 Correct 9 ms 8184 KB Output is correct
10 Correct 9 ms 8184 KB Output is correct
11 Correct 9 ms 8184 KB Output is correct
12 Correct 9 ms 8184 KB Output is correct
13 Correct 9 ms 8184 KB Output is correct
14 Correct 9 ms 8184 KB Output is correct
15 Correct 9 ms 8184 KB Output is correct
16 Correct 9 ms 8184 KB Output is correct
17 Correct 8 ms 8184 KB Output is correct
18 Correct 8 ms 8184 KB Output is correct
19 Correct 9 ms 8184 KB Output is correct
20 Correct 9 ms 8184 KB Output is correct
21 Correct 9 ms 8184 KB Output is correct
22 Correct 9 ms 8128 KB Output is correct
23 Correct 9 ms 8232 KB Output is correct
24 Correct 9 ms 8156 KB Output is correct
25 Correct 9 ms 8184 KB Output is correct
26 Correct 9 ms 8184 KB Output is correct
27 Correct 9 ms 8184 KB Output is correct
28 Correct 9 ms 8184 KB Output is correct
29 Correct 9 ms 8184 KB Output is correct
30 Correct 9 ms 8188 KB Output is correct
31 Correct 9 ms 8184 KB Output is correct
32 Correct 9 ms 8184 KB Output is correct
33 Correct 9 ms 8184 KB Output is correct
34 Correct 9 ms 8188 KB Output is correct
35 Correct 9 ms 8176 KB Output is correct
36 Correct 9 ms 8184 KB Output is correct
37 Correct 9 ms 8184 KB Output is correct
38 Correct 9 ms 8184 KB Output is correct
39 Correct 114 ms 10120 KB Output is correct
40 Correct 194 ms 11284 KB Output is correct
41 Correct 89 ms 9720 KB Output is correct
42 Correct 95 ms 9544 KB Output is correct
43 Correct 69 ms 9080 KB Output is correct
44 Correct 230 ms 12116 KB Output is correct
45 Correct 225 ms 12152 KB Output is correct
46 Correct 233 ms 12172 KB Output is correct
47 Correct 204 ms 12152 KB Output is correct
48 Correct 196 ms 12124 KB Output is correct
49 Correct 991 ms 30676 KB Output is correct
50 Correct 943 ms 30624 KB Output is correct
51 Correct 981 ms 30708 KB Output is correct
52 Correct 936 ms 30648 KB Output is correct
53 Correct 919 ms 30712 KB Output is correct
54 Correct 936 ms 30628 KB Output is correct
55 Execution timed out 1565 ms 56220 KB Time limit exceeded
56 Halted 0 ms 0 KB -