oj.uz

Submission #37381

# Submission time Handle Problem Language Result Execution time Memory
37381 2017-12-25T03:23:43 Z HardNut Money (IZhO17_money) C++14
45 / 100
 1500 ms 48824 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 5;

typedef long long ll;

int n, a[N], ans, lst;
set<pair<int, int>> st;
bool us;

int main() {
//    freopen("money.in", "r", stdin);
//    freopen("money.out", "w", stdout);
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
        if (lst == a[i]) {
            if (us)
                st.erase({a[i], i});
            else
                st.insert({a[i], i});
            continue;
        }
        st.insert({a[i], i});
        us = 0;
        lst = a[i];
        auto id = st.find({a[i], i});
        if (id == st.begin()) {
            ans++;
            continue;
        }
        id--;
        if ((*id).second == i - 1) {
            continue;
        }
        id = st.lower_bound(make_pair(a[i], -1));
        if (id == st.begin()) {
            ans++;
            continue;
        }
        id--;
        if ((*id).second == i - 1) {
            us = 1;
            st.erase({a[i], i});
            continue;
        }
        ans++;
    }
    printf("%d", ans);
}
/**
6
1 5 2 5 5 6
**/

Compilation message

money.cpp: In function 'int main()':
money.cpp:16:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
money.cpp:18:27: 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 5924 KB Output is correct
2 Correct 0 ms 5924 KB Output is correct
3 Correct 0 ms 5924 KB Output is correct
4 Correct 0 ms 5924 KB Output is correct
5 Correct 0 ms 5924 KB Output is correct
6 Correct 0 ms 5924 KB Output is correct
7 Correct 0 ms 5924 KB Output is correct
8 Correct 0 ms 5924 KB Output is correct
9 Correct 0 ms 5924 KB Output is correct
10 Correct 0 ms 5924 KB Output is correct
11 Correct 0 ms 5924 KB Output is correct
12 Correct 0 ms 5924 KB Output is correct
13 Correct 0 ms 5924 KB Output is correct
14 Correct 0 ms 5924 KB Output is correct
15 Correct 0 ms 5924 KB Output is correct
16 Correct 0 ms 5924 KB Output is correct

Subtask #2
16.0 / 16.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5924 KB Output is correct
2 Correct 0 ms 5924 KB Output is correct
3 Correct 0 ms 5924 KB Output is correct
4 Correct 0 ms 5924 KB Output is correct
5 Correct 0 ms 5924 KB Output is correct
6 Correct 0 ms 5924 KB Output is correct
7 Correct 0 ms 5924 KB Output is correct
8 Correct 0 ms 5924 KB Output is correct
9 Correct 0 ms 5924 KB Output is correct
10 Correct 0 ms 5924 KB Output is correct
11 Correct 0 ms 5924 KB Output is correct
12 Correct 0 ms 5924 KB Output is correct
13 Correct 0 ms 5924 KB Output is correct
14 Correct 0 ms 5924 KB Output is correct
15 Correct 0 ms 5924 KB Output is correct
16 Correct 0 ms 5924 KB Output is correct
17 Correct 0 ms 5924 KB Output is correct
18 Correct 0 ms 5924 KB Output is correct
19 Correct 0 ms 5924 KB Output is correct
20 Correct 0 ms 5924 KB Output is correct
21 Correct 0 ms 5924 KB Output is correct
22 Correct 0 ms 5924 KB Output is correct
23 Correct 0 ms 5924 KB Output is correct
24 Correct 0 ms 5924 KB Output is correct
25 Correct 0 ms 5924 KB Output is correct
26 Correct 0 ms 5924 KB Output is correct
27 Correct 0 ms 5924 KB Output is correct
28 Correct 0 ms 5924 KB Output is correct
29 Correct 0 ms 5924 KB Output is correct
30 Correct 0 ms 5924 KB Output is correct
31 Correct 0 ms 5924 KB Output is correct
32 Correct 0 ms 5924 KB Output is correct
33 Correct 0 ms 5924 KB Output is correct
34 Correct 0 ms 5924 KB Output is correct
35 Correct 0 ms 5924 KB Output is correct
36 Correct 0 ms 5924 KB Output is correct
37 Correct 0 ms 5924 KB Output is correct
38 Correct 0 ms 5924 KB Output is correct
39 Correct 376 ms 24668 KB Output is correct
40 Correct 776 ms 39848 KB Output is correct
41 Correct 276 ms 20444 KB Output is correct
42 Correct 366 ms 20972 KB Output is correct
43 Correct 196 ms 16616 KB Output is correct
44 Correct 913 ms 47636 KB Output is correct
45 Correct 846 ms 46052 KB Output is correct
46 Correct 883 ms 47636 KB Output is correct
47 Correct 836 ms 29420 KB Output is correct
48 Correct 706 ms 41168 KB Output is correct
49 Execution timed out 1500 ms 48824 KB Execution timed out
50 Halted 0 ms 0 KB -