oj.uz

Submission #38269

# Submission time Handle Problem Language Result Execution time Memory
38269 2018-01-03T09:19:21 Z Just_Solve_The_Problem Money (IZhO17_money) C++11
100 / 100
 296 ms 9828 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = (int)1e6 + 7;

int a[N], tree[N], n, ans;

void upd (int pos) {
    for (; pos < N; pos += pos & -pos) {
        tree[pos]++;
    }
}

int get (int r) {
    int res = 0;
    for (; r > 0; r -= r & -r) {
        res += tree[r];
    }
    return res;
}

main () {
    scanf ("%d", &n);
    for (int i = 1; i <= n; i++) {
        scanf ("%d", &a[i]);
    }
    for (int i = 2, pos = 1; i <= n; i++) {
        if (a[i - 1] > a[i] || get(a[i] - 1) - get(a[pos]) > 0) {
            ans++;
            while (pos < i) upd(a[pos++]);
        }
    }
    cout << ans + 1;
}

Compilation message

money.cpp:23:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^
money.cpp: In function 'int main()':
money.cpp:24:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf ("%d", &n);
                     ^
money.cpp:26:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf ("%d", &a[i]);
                            ^

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 9828 KB Output is correct
2 Correct 0 ms 9828 KB Output is correct
3 Correct 0 ms 9828 KB Output is correct
4 Correct 0 ms 9828 KB Output is correct
5 Correct 0 ms 9828 KB Output is correct
6 Correct 0 ms 9828 KB Output is correct
7 Correct 0 ms 9828 KB Output is correct
8 Correct 0 ms 9828 KB Output is correct
9 Correct 0 ms 9828 KB Output is correct
10 Correct 0 ms 9828 KB Output is correct
11 Correct 0 ms 9828 KB Output is correct
12 Correct 0 ms 9828 KB Output is correct
13 Correct 0 ms 9828 KB Output is correct
14 Correct 0 ms 9828 KB Output is correct
15 Correct 0 ms 9828 KB Output is correct
16 Correct 0 ms 9828 KB Output is correct
17 Correct 0 ms 9828 KB Output is correct
18 Correct 0 ms 9828 KB Output is correct
19 Correct 0 ms 9828 KB Output is correct
20 Correct 0 ms 9828 KB Output is correct
21 Correct 0 ms 9828 KB Output is correct
22 Correct 0 ms 9828 KB Output is correct
23 Correct 0 ms 9828 KB Output is correct
24 Correct 0 ms 9828 KB Output is correct
25 Correct 0 ms 9828 KB Output is correct
26 Correct 0 ms 9828 KB Output is correct
27 Correct 0 ms 9828 KB Output is correct
28 Correct 0 ms 9828 KB Output is correct
29 Correct 0 ms 9828 KB Output is correct
30 Correct 0 ms 9828 KB Output is correct
31 Correct 0 ms 9828 KB Output is correct
32 Correct 0 ms 9828 KB Output is correct
33 Correct 0 ms 9828 KB Output is correct
34 Correct 0 ms 9828 KB Output is correct
35 Correct 0 ms 9828 KB Output is correct
36 Correct 0 ms 9828 KB Output is correct
37 Correct 0 ms 9828 KB Output is correct
38 Correct 0 ms 9828 KB Output is correct
39 Correct 113 ms 9828 KB Output is correct
40 Correct 183 ms 9828 KB Output is correct
41 Correct 93 ms 9828 KB Output is correct
42 Correct 96 ms 9828 KB Output is correct
43 Correct 69 ms 9828 KB Output is correct
44 Correct 223 ms 9828 KB Output is correct
45 Correct 189 ms 9828 KB Output is correct
46 Correct 219 ms 9828 KB Output is correct
47 Correct 193 ms 9828 KB Output is correct
48 Correct 173 ms 9828 KB Output is correct
49 Correct 246 ms 9828 KB Output is correct
50 Correct 239 ms 9828 KB Output is correct
51 Correct 203 ms 9828 KB Output is correct
52 Correct 256 ms 9828 KB Output is correct
53 Correct 279 ms 9828 KB Output is correct
54 Correct 233 ms 9828 KB Output is correct
55 Correct 243 ms 9828 KB Output is correct
56 Correct 283 ms 9828 KB Output is correct
57 Correct 269 ms 9828 KB Output is correct
58 Correct 296 ms 9828 KB Output is correct
59 Correct 243 ms 9828 KB Output is correct
60 Correct 283 ms 9828 KB Output is correct
61 Correct 226 ms 9828 KB Output is correct
62 Correct 279 ms 9828 KB Output is correct