oj.uz

Submission #36447

# Submission time Handle Problem Language Result Execution time Memory
36447 2017-12-09T06:38:21 Z szawinis Money (IZhO17_money) C++14
45 / 100
 1500 ms 56960 KB 
#include <bits/stdc++.h>
using namespace std;
const int MAX = (1e6)+1;

int n, ans, a[MAX];
vector<pair<int,int> > segs;
set<int> st;
int main() {
	scanf("%d",&n);
	int curr = 0;
	for(int i = 0; i < n; i++) {
		scanf("%d",a+i);
		if(i && a[i] < a[i-1]) {
			segs.emplace_back(curr, i-1);
			curr = i;
		}
	}
	segs.emplace_back(curr, n-1);
	for(auto p: segs) {
		int l, r; tie(l, r) = p;
		int mn = a[l], mx = a[l];
		curr = l;
		for(int i = l; i <= r; i++) {
			mn = min(a[i], mn);
			mx = max(a[i], mx);
			auto itlf = st.upper_bound(mn);
			auto itrg = st.lower_bound(mx);
			if(mn != mx && itlf != itrg) {
				for(int j = curr; j < i; j++) st.insert(a[j]);
				++ans;
				mn = a[i];
				mx = a[i];
				curr = i;
			}
		}
		for(int j = curr; j <= r; j++) st.insert(a[j]);
		++ans;
	}
	printf("%d", ans);
}

Compilation message

money.cpp: In function 'int main()':
money.cpp:9:16: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
money.cpp:12:18: 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 106 ms 9080 KB Output is correct
40 Correct 179 ms 12152 KB Output is correct
41 Correct 76 ms 9080 KB Output is correct
42 Correct 69 ms 9080 KB Output is correct
43 Correct 59 ms 7544 KB Output is correct
44 Correct 219 ms 12152 KB Output is correct
45 Correct 183 ms 12152 KB Output is correct
46 Correct 219 ms 12152 KB Output is correct
47 Correct 199 ms 9080 KB Output is correct
48 Correct 209 ms 12152 KB Output is correct
49 Correct 849 ms 28448 KB Output is correct
50 Correct 983 ms 28448 KB Output is correct
51 Correct 973 ms 28448 KB Output is correct
52 Correct 1006 ms 28448 KB Output is correct
53 Correct 1006 ms 28448 KB Output is correct
54 Correct 929 ms 28448 KB Output is correct
55 Execution timed out 1500 ms 56960 KB Execution timed out
56 Halted 0 ms 0 KB -