Submission #36061

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
36061	2017-12-05T02:13:39 Z	UncleGrandpa925	Money (IZhO17_money)	C++14	100 / 100	296 ms	9828 KB

money

/*input
4
4 6 1 7
*/
#include <bits/stdc++.h>
using namespace std;
#define sp ' '
#define endl '\n'
#define fi first
#define se second
#define mp make_pair
#define N 1000005
#define bit(x,y) ((x>>y)&1LL)
#define na(x) (#x) << ":" << x
ostream& operator << (ostream &os, vector<int>&x) {
	for (int i = 0; i < x.size(); i++) os << x[i] << sp;
	return os;
}
ostream& operator << (ostream &os, pair<int, int> x) {
	cout << x.fi << sp << x.se << sp;
	return os;
}
ostream& operator << (ostream &os, vector<pair<int, int> >&x) {
	for (int i = 0; i < x.size(); i++) os << x[i] << endl;
	return os;
}

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

void update(int i, int val) {
	for (; i; i -= i & -i) tree[i] = min(tree[i], val);
}

int get(int i) {
	int ret = 1e9;
	for (; i <= N - 5; i += i & -i) {
		ret = min(ret, tree[i]);
	}
	return ret;
}

signed main() {
	memset(tree, 127, sizeof(tree));
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		int t; scanf("%d", &a[i]);
	}
	int last = a[0], ans = 0;
	int mx = 1e9;
	update(a[0] - 1, a[0]);
	int len = 1;
	for (int i = 1; i < n; i++) {
		if (a[i] < last) {
			ans++;
			mx = get(a[i]);
		}
		else if (a[i] > mx) {
			ans++;
			mx = get(a[i]);
		}
		last = a[i];
		update(a[i] - 1, a[i]);
	}
	ans++;
	printf("%d\n", ans);
}

Compilation message

money.cpp: In function 'std::ostream& operator<<(std::ostream&, std::vector<int>&)':
money.cpp:16:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < x.size(); i++) os << x[i] << sp;
                    ^
money.cpp: In function 'std::ostream& operator<<(std::ostream&, std::vector<std::pair<int, int> >&)':
money.cpp:24:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < x.size(); i++) os << x[i] << endl;
                    ^
money.cpp: In function 'int main()':
money.cpp:48:7: warning: unused variable 't' [-Wunused-variable]
   int t; scanf("%d", &a[i]);
       ^
money.cpp:53:6: warning: unused variable 'len' [-Wunused-variable]
  int len = 1;
      ^
money.cpp:46:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
money.cpp:48:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int t; 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	3 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	3 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	3 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	3 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	3 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	3 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	3 ms	9828 KB	Output is correct
38	Correct	3 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	3 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	3 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	3 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	3 ms	9828 KB	Output is correct
38	Correct	3 ms	9828 KB	Output is correct
39	Correct	113 ms	9828 KB	Output is correct
40	Correct	206 ms	9828 KB	Output is correct
41	Correct	86 ms	9828 KB	Output is correct
42	Correct	69 ms	9828 KB	Output is correct
43	Correct	49 ms	9828 KB	Output is correct
44	Correct	229 ms	9828 KB	Output is correct
45	Correct	206 ms	9828 KB	Output is correct
46	Correct	233 ms	9828 KB	Output is correct
47	Correct	223 ms	9828 KB	Output is correct
48	Correct	199 ms	9828 KB	Output is correct
49	Correct	283 ms	9828 KB	Output is correct
50	Correct	246 ms	9828 KB	Output is correct
51	Correct	259 ms	9828 KB	Output is correct
52	Correct	266 ms	9828 KB	Output is correct
53	Correct	296 ms	9828 KB	Output is correct
54	Correct	213 ms	9828 KB	Output is correct
55	Correct	233 ms	9828 KB	Output is correct
56	Correct	253 ms	9828 KB	Output is correct
57	Correct	239 ms	9828 KB	Output is correct
58	Correct	219 ms	9828 KB	Output is correct
59	Correct	259 ms	9828 KB	Output is correct
60	Correct	216 ms	9828 KB	Output is correct
61	Correct	273 ms	9828 KB	Output is correct
62	Correct	249 ms	9828 KB	Output is correct

Submission #36061

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 16.0 / 16.0

Subtask #3 20.0 / 20.0

Subtask #4 55.0 / 55.0

Subtask #1
9.0 / 9.0

Subtask #2
16.0 / 16.0

Subtask #3
20.0 / 20.0

Subtask #4
55.0 / 55.0