답안 #156197

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
156197	2019-10-04T11:27:27 Z	theboatman	Money (IZhO17_money)	C++11	45 / 100	1500 ms	77268 KB

money

#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 * 4);
        f.resize(n * 4);
    }

    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;
    for(int i = 0; i < now; i++) {
        bank.inc(a[i]);

        s.insert(a[i]);
    }

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

        int l = *s.begin(), r = *--s.end();
        //cout << a[i] << " " << l << " " << r << endl;
        if (a[i] >= r) {
            int x = 0;
            while(i < n && x <= a[i]) {
                x = 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);
            }
        }
    }

    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

#	결과	실행 시간	메모리	Grader output
1	Correct	30 ms	31740 KB	Output is correct
2	Correct	30 ms	31608 KB	Output is correct
3	Correct	29 ms	31736 KB	Output is correct
4	Correct	30 ms	31608 KB	Output is correct
5	Correct	29 ms	31728 KB	Output is correct
6	Correct	30 ms	31608 KB	Output is correct
7	Correct	30 ms	31608 KB	Output is correct
8	Correct	29 ms	31644 KB	Output is correct
9	Correct	29 ms	31652 KB	Output is correct
10	Correct	30 ms	31736 KB	Output is correct
11	Correct	32 ms	31628 KB	Output is correct
12	Correct	30 ms	31740 KB	Output is correct
13	Correct	30 ms	31708 KB	Output is correct
14	Correct	29 ms	31736 KB	Output is correct
15	Correct	30 ms	31736 KB	Output is correct
16	Correct	29 ms	31608 KB	Output is correct

Subtask #2
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	30 ms	31740 KB	Output is correct
2	Correct	30 ms	31608 KB	Output is correct
3	Correct	29 ms	31736 KB	Output is correct
4	Correct	30 ms	31608 KB	Output is correct
5	Correct	29 ms	31728 KB	Output is correct
6	Correct	30 ms	31608 KB	Output is correct
7	Correct	30 ms	31608 KB	Output is correct
8	Correct	29 ms	31644 KB	Output is correct
9	Correct	29 ms	31652 KB	Output is correct
10	Correct	30 ms	31736 KB	Output is correct
11	Correct	32 ms	31628 KB	Output is correct
12	Correct	30 ms	31740 KB	Output is correct
13	Correct	30 ms	31708 KB	Output is correct
14	Correct	29 ms	31736 KB	Output is correct
15	Correct	30 ms	31736 KB	Output is correct
16	Correct	29 ms	31608 KB	Output is correct
17	Correct	29 ms	31608 KB	Output is correct
18	Correct	29 ms	31608 KB	Output is correct
19	Correct	29 ms	31580 KB	Output is correct
20	Correct	29 ms	31608 KB	Output is correct
21	Correct	30 ms	31864 KB	Output is correct
22	Correct	30 ms	31608 KB	Output is correct
23	Correct	29 ms	31736 KB	Output is correct
24	Correct	30 ms	31736 KB	Output is correct
25	Correct	30 ms	31608 KB	Output is correct
26	Correct	30 ms	31608 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	30 ms	31740 KB	Output is correct
2	Correct	30 ms	31608 KB	Output is correct
3	Correct	29 ms	31736 KB	Output is correct
4	Correct	30 ms	31608 KB	Output is correct
5	Correct	29 ms	31728 KB	Output is correct
6	Correct	30 ms	31608 KB	Output is correct
7	Correct	30 ms	31608 KB	Output is correct
8	Correct	29 ms	31644 KB	Output is correct
9	Correct	29 ms	31652 KB	Output is correct
10	Correct	30 ms	31736 KB	Output is correct
11	Correct	32 ms	31628 KB	Output is correct
12	Correct	30 ms	31740 KB	Output is correct
13	Correct	30 ms	31708 KB	Output is correct
14	Correct	29 ms	31736 KB	Output is correct
15	Correct	30 ms	31736 KB	Output is correct
16	Correct	29 ms	31608 KB	Output is correct
17	Correct	29 ms	31608 KB	Output is correct
18	Correct	29 ms	31608 KB	Output is correct
19	Correct	29 ms	31580 KB	Output is correct
20	Correct	29 ms	31608 KB	Output is correct
21	Correct	30 ms	31864 KB	Output is correct
22	Correct	30 ms	31608 KB	Output is correct
23	Correct	29 ms	31736 KB	Output is correct
24	Correct	30 ms	31736 KB	Output is correct
25	Correct	30 ms	31608 KB	Output is correct
26	Correct	30 ms	31608 KB	Output is correct
27	Correct	30 ms	31608 KB	Output is correct
28	Correct	29 ms	31696 KB	Output is correct
29	Correct	29 ms	31736 KB	Output is correct
30	Correct	30 ms	31708 KB	Output is correct
31	Correct	30 ms	31608 KB	Output is correct
32	Correct	29 ms	31608 KB	Output is correct
33	Correct	30 ms	31612 KB	Output is correct
34	Correct	30 ms	31736 KB	Output is correct
35	Correct	31 ms	31596 KB	Output is correct
36	Correct	34 ms	31736 KB	Output is correct
37	Correct	31 ms	31716 KB	Output is correct
38	Correct	34 ms	31668 KB	Output is correct

Subtask #4
0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	30 ms	31740 KB	Output is correct
2	Correct	30 ms	31608 KB	Output is correct
3	Correct	29 ms	31736 KB	Output is correct
4	Correct	30 ms	31608 KB	Output is correct
5	Correct	29 ms	31728 KB	Output is correct
6	Correct	30 ms	31608 KB	Output is correct
7	Correct	30 ms	31608 KB	Output is correct
8	Correct	29 ms	31644 KB	Output is correct
9	Correct	29 ms	31652 KB	Output is correct
10	Correct	30 ms	31736 KB	Output is correct
11	Correct	32 ms	31628 KB	Output is correct
12	Correct	30 ms	31740 KB	Output is correct
13	Correct	30 ms	31708 KB	Output is correct
14	Correct	29 ms	31736 KB	Output is correct
15	Correct	30 ms	31736 KB	Output is correct
16	Correct	29 ms	31608 KB	Output is correct
17	Correct	29 ms	31608 KB	Output is correct
18	Correct	29 ms	31608 KB	Output is correct
19	Correct	29 ms	31580 KB	Output is correct
20	Correct	29 ms	31608 KB	Output is correct
21	Correct	30 ms	31864 KB	Output is correct
22	Correct	30 ms	31608 KB	Output is correct
23	Correct	29 ms	31736 KB	Output is correct
24	Correct	30 ms	31736 KB	Output is correct
25	Correct	30 ms	31608 KB	Output is correct
26	Correct	30 ms	31608 KB	Output is correct
27	Correct	30 ms	31608 KB	Output is correct
28	Correct	29 ms	31696 KB	Output is correct
29	Correct	29 ms	31736 KB	Output is correct
30	Correct	30 ms	31708 KB	Output is correct
31	Correct	30 ms	31608 KB	Output is correct
32	Correct	29 ms	31608 KB	Output is correct
33	Correct	30 ms	31612 KB	Output is correct
34	Correct	30 ms	31736 KB	Output is correct
35	Correct	31 ms	31596 KB	Output is correct
36	Correct	34 ms	31736 KB	Output is correct
37	Correct	31 ms	31716 KB	Output is correct
38	Correct	34 ms	31668 KB	Output is correct
39	Correct	134 ms	33804 KB	Output is correct
40	Correct	221 ms	34716 KB	Output is correct
41	Correct	110 ms	33148 KB	Output is correct
42	Correct	147 ms	33100 KB	Output is correct
43	Correct	91 ms	32632 KB	Output is correct
44	Correct	252 ms	35832 KB	Output is correct
45	Correct	245 ms	35576 KB	Output is correct
46	Correct	264 ms	35576 KB	Output is correct
47	Correct	222 ms	35596 KB	Output is correct
48	Correct	217 ms	35576 KB	Output is correct
49	Correct	1033 ms	54196 KB	Output is correct
50	Correct	945 ms	54160 KB	Output is correct
51	Correct	937 ms	54128 KB	Output is correct
52	Correct	970 ms	54108 KB	Output is correct
53	Correct	986 ms	54204 KB	Output is correct
54	Correct	1105 ms	54264 KB	Output is correct
55	Execution timed out	1546 ms	77268 KB	Time limit exceeded
56	Halted	0 ms	0 KB	-

답안 #156197

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 16.0 / 16.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 55.0

Subtask #1
9.0 / 9.0

Subtask #2
16.0 / 16.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 55.0