# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
37389 | 2017-12-25T03:50:04 Z | HardNut | Money (IZhO17_money) | C++14 | 1500 ms | 5472 KB |
#include <stdio.h> #include <set> #include <algorithm> using namespace std; const int N = 1e6 + 5; typedef long long ll; int n, a[N], ans; set<int> st; bool us; int main() { scanf("%d", &n); for (int i = 1; i <= n; i++) { scanf("%d", &a[i]); } int i = 1; st.insert((int)1e9); while (i <= n) { int x = *upper_bound(st.begin(), st.end(), a[i]); int l = i; while (a[i + 1] >= a[i] && a[i + 1] <= x) { st.insert(a[i]); i++; } st.insert(a[i]); i++; ans++; } printf("%d", ans); } /** 6 1 5 2 5 5 6 **/
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 5076 KB | Output is correct |
2 | Correct | 0 ms | 5076 KB | Output is correct |
3 | Correct | 0 ms | 5076 KB | Output is correct |
4 | Correct | 0 ms | 5076 KB | Output is correct |
5 | Correct | 0 ms | 5076 KB | Output is correct |
6 | Correct | 0 ms | 5076 KB | Output is correct |
7 | Correct | 0 ms | 5076 KB | Output is correct |
8 | Correct | 0 ms | 5076 KB | Output is correct |
9 | Correct | 0 ms | 5076 KB | Output is correct |
10 | Correct | 0 ms | 5076 KB | Output is correct |
11 | Correct | 0 ms | 5076 KB | Output is correct |
12 | Correct | 0 ms | 5076 KB | Output is correct |
13 | Correct | 0 ms | 5076 KB | Output is correct |
14 | Correct | 0 ms | 5076 KB | Output is correct |
15 | Correct | 0 ms | 5076 KB | Output is correct |
16 | Correct | 0 ms | 5076 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 5076 KB | Output is correct |
2 | Correct | 0 ms | 5076 KB | Output is correct |
3 | Correct | 0 ms | 5076 KB | Output is correct |
4 | Correct | 0 ms | 5076 KB | Output is correct |
5 | Correct | 0 ms | 5076 KB | Output is correct |
6 | Correct | 0 ms | 5076 KB | Output is correct |
7 | Correct | 0 ms | 5076 KB | Output is correct |
8 | Correct | 0 ms | 5076 KB | Output is correct |
9 | Correct | 0 ms | 5076 KB | Output is correct |
10 | Correct | 0 ms | 5076 KB | Output is correct |
11 | Correct | 0 ms | 5076 KB | Output is correct |
12 | Correct | 0 ms | 5076 KB | Output is correct |
13 | Correct | 0 ms | 5076 KB | Output is correct |
14 | Correct | 0 ms | 5076 KB | Output is correct |
15 | Correct | 0 ms | 5076 KB | Output is correct |
16 | Correct | 0 ms | 5076 KB | Output is correct |
17 | Correct | 0 ms | 5076 KB | Output is correct |
18 | Correct | 0 ms | 5076 KB | Output is correct |
19 | Correct | 0 ms | 5076 KB | Output is correct |
20 | Correct | 0 ms | 5076 KB | Output is correct |
21 | Correct | 0 ms | 5076 KB | Output is correct |
22 | Correct | 0 ms | 5076 KB | Output is correct |
23 | Correct | 0 ms | 5076 KB | Output is correct |
24 | Correct | 0 ms | 5076 KB | Output is correct |
25 | Correct | 0 ms | 5076 KB | Output is correct |
26 | Correct | 0 ms | 5076 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 5076 KB | Output is correct |
2 | Correct | 0 ms | 5076 KB | Output is correct |
3 | Correct | 0 ms | 5076 KB | Output is correct |
4 | Correct | 0 ms | 5076 KB | Output is correct |
5 | Correct | 0 ms | 5076 KB | Output is correct |
6 | Correct | 0 ms | 5076 KB | Output is correct |
7 | Correct | 0 ms | 5076 KB | Output is correct |
8 | Correct | 0 ms | 5076 KB | Output is correct |
9 | Correct | 0 ms | 5076 KB | Output is correct |
10 | Correct | 0 ms | 5076 KB | Output is correct |
11 | Correct | 0 ms | 5076 KB | Output is correct |
12 | Correct | 0 ms | 5076 KB | Output is correct |
13 | Correct | 0 ms | 5076 KB | Output is correct |
14 | Correct | 0 ms | 5076 KB | Output is correct |
15 | Correct | 0 ms | 5076 KB | Output is correct |
16 | Correct | 0 ms | 5076 KB | Output is correct |
17 | Correct | 0 ms | 5076 KB | Output is correct |
18 | Correct | 0 ms | 5076 KB | Output is correct |
19 | Correct | 0 ms | 5076 KB | Output is correct |
20 | Correct | 0 ms | 5076 KB | Output is correct |
21 | Correct | 0 ms | 5076 KB | Output is correct |
22 | Correct | 0 ms | 5076 KB | Output is correct |
23 | Correct | 0 ms | 5076 KB | Output is correct |
24 | Correct | 0 ms | 5076 KB | Output is correct |
25 | Correct | 0 ms | 5076 KB | Output is correct |
26 | Correct | 0 ms | 5076 KB | Output is correct |
27 | Correct | 0 ms | 5076 KB | Output is correct |
28 | Correct | 0 ms | 5076 KB | Output is correct |
29 | Correct | 0 ms | 5076 KB | Output is correct |
30 | Correct | 0 ms | 5076 KB | Output is correct |
31 | Correct | 0 ms | 5076 KB | Output is correct |
32 | Correct | 0 ms | 5076 KB | Output is correct |
33 | Correct | 0 ms | 5076 KB | Output is correct |
34 | Correct | 0 ms | 5076 KB | Output is correct |
35 | Correct | 0 ms | 5076 KB | Output is correct |
36 | Correct | 0 ms | 5076 KB | Output is correct |
37 | Correct | 0 ms | 5076 KB | Output is correct |
38 | Correct | 0 ms | 5076 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 5076 KB | Output is correct |
2 | Correct | 0 ms | 5076 KB | Output is correct |
3 | Correct | 0 ms | 5076 KB | Output is correct |
4 | Correct | 0 ms | 5076 KB | Output is correct |
5 | Correct | 0 ms | 5076 KB | Output is correct |
6 | Correct | 0 ms | 5076 KB | Output is correct |
7 | Correct | 0 ms | 5076 KB | Output is correct |
8 | Correct | 0 ms | 5076 KB | Output is correct |
9 | Correct | 0 ms | 5076 KB | Output is correct |
10 | Correct | 0 ms | 5076 KB | Output is correct |
11 | Correct | 0 ms | 5076 KB | Output is correct |
12 | Correct | 0 ms | 5076 KB | Output is correct |
13 | Correct | 0 ms | 5076 KB | Output is correct |
14 | Correct | 0 ms | 5076 KB | Output is correct |
15 | Correct | 0 ms | 5076 KB | Output is correct |
16 | Correct | 0 ms | 5076 KB | Output is correct |
17 | Correct | 0 ms | 5076 KB | Output is correct |
18 | Correct | 0 ms | 5076 KB | Output is correct |
19 | Correct | 0 ms | 5076 KB | Output is correct |
20 | Correct | 0 ms | 5076 KB | Output is correct |
21 | Correct | 0 ms | 5076 KB | Output is correct |
22 | Correct | 0 ms | 5076 KB | Output is correct |
23 | Correct | 0 ms | 5076 KB | Output is correct |
24 | Correct | 0 ms | 5076 KB | Output is correct |
25 | Correct | 0 ms | 5076 KB | Output is correct |
26 | Correct | 0 ms | 5076 KB | Output is correct |
27 | Correct | 0 ms | 5076 KB | Output is correct |
28 | Correct | 0 ms | 5076 KB | Output is correct |
29 | Correct | 0 ms | 5076 KB | Output is correct |
30 | Correct | 0 ms | 5076 KB | Output is correct |
31 | Correct | 0 ms | 5076 KB | Output is correct |
32 | Correct | 0 ms | 5076 KB | Output is correct |
33 | Correct | 0 ms | 5076 KB | Output is correct |
34 | Correct | 0 ms | 5076 KB | Output is correct |
35 | Correct | 0 ms | 5076 KB | Output is correct |
36 | Correct | 0 ms | 5076 KB | Output is correct |
37 | Correct | 0 ms | 5076 KB | Output is correct |
38 | Correct | 0 ms | 5076 KB | Output is correct |
39 | Correct | 109 ms | 5076 KB | Output is correct |
40 | Correct | 229 ms | 5076 KB | Output is correct |
41 | Correct | 83 ms | 5076 KB | Output is correct |
42 | Correct | 113 ms | 5076 KB | Output is correct |
43 | Correct | 89 ms | 5076 KB | Output is correct |
44 | Correct | 253 ms | 5076 KB | Output is correct |
45 | Correct | 239 ms | 5076 KB | Output is correct |
46 | Correct | 286 ms | 5076 KB | Output is correct |
47 | Correct | 163 ms | 5076 KB | Output is correct |
48 | Correct | 159 ms | 5076 KB | Output is correct |
49 | Execution timed out | 1500 ms | 5472 KB | Execution timed out |
50 | Halted | 0 ms | 0 KB | - |