Submission #36056

# Submission time Handle Problem Language Result Execution time Memory
36056 2017-12-05T01:57:46 Z UncleGrandpa925 Money (IZhO17_money) C++14
45 / 100
1500 ms 57268 KB
/*input
1
3
*/
#include <bits/stdc++.h>
using namespace std;
#define sp ' '
#define endl '\n'
#define fi first
#define se second
#define mp make_pair
#define int long long
#define N
#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;
vector<int> a;
set<int> st;
signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		int t; cin >> t;
		a.push_back(t);
	}
	int last = a.front(), ans = 0;
	int mx = 1e9;
	st.insert(a.front());
	int len = 1;
	for (int i = 1; i < a.size(); i++) {
		if (a[i] < last) {
			ans++;
			auto it = st.upper_bound(a[i]);
			if (it == st.end()) mx = 1e9;
			else mx = *it;
		}
		else if (a[i] > mx) {
			ans++;
			auto it = st.upper_bound(a[i]);
			if (it == st.end()) mx = 1e9;
			else mx = *it;
		}
		last = a[i];
		st.insert(a[i]);
	}
	ans++;
	cout << ans << endl;
}

Compilation message

money.cpp: In function 'std::ostream& operator<<(std::ostream&, std::vector<long long int>&)':
money.cpp:17: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<long long int, long long int> >&)':
money.cpp:25: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:43:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 1; i < a.size(); i++) {
                    ^
money.cpp:42:6: warning: unused variable 'len' [-Wunused-variable]
  int len = 1;
      ^
# Verdict Execution time Memory Grader output
1 Correct 0 ms 2180 KB Output is correct
2 Correct 0 ms 2180 KB Output is correct
3 Correct 0 ms 2180 KB Output is correct
4 Correct 0 ms 2180 KB Output is correct
5 Correct 0 ms 2180 KB Output is correct
6 Correct 0 ms 2180 KB Output is correct
7 Correct 0 ms 2180 KB Output is correct
8 Correct 0 ms 2180 KB Output is correct
9 Correct 0 ms 2180 KB Output is correct
10 Correct 0 ms 2180 KB Output is correct
11 Correct 0 ms 2180 KB Output is correct
12 Correct 0 ms 2180 KB Output is correct
13 Correct 0 ms 2180 KB Output is correct
14 Correct 0 ms 2180 KB Output is correct
15 Correct 0 ms 2180 KB Output is correct
16 Correct 0 ms 2180 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 2180 KB Output is correct
2 Correct 0 ms 2180 KB Output is correct
3 Correct 0 ms 2180 KB Output is correct
4 Correct 0 ms 2180 KB Output is correct
5 Correct 0 ms 2180 KB Output is correct
6 Correct 0 ms 2180 KB Output is correct
7 Correct 0 ms 2180 KB Output is correct
8 Correct 0 ms 2180 KB Output is correct
9 Correct 0 ms 2180 KB Output is correct
10 Correct 0 ms 2180 KB Output is correct
11 Correct 0 ms 2180 KB Output is correct
12 Correct 0 ms 2180 KB Output is correct
13 Correct 0 ms 2180 KB Output is correct
14 Correct 0 ms 2180 KB Output is correct
15 Correct 0 ms 2180 KB Output is correct
16 Correct 0 ms 2180 KB Output is correct
17 Correct 0 ms 2180 KB Output is correct
18 Correct 0 ms 2180 KB Output is correct
19 Correct 0 ms 2180 KB Output is correct
20 Correct 0 ms 2180 KB Output is correct
21 Correct 0 ms 2180 KB Output is correct
22 Correct 0 ms 2180 KB Output is correct
23 Correct 0 ms 2180 KB Output is correct
24 Correct 0 ms 2180 KB Output is correct
25 Correct 0 ms 2180 KB Output is correct
26 Correct 0 ms 2180 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 2180 KB Output is correct
2 Correct 0 ms 2180 KB Output is correct
3 Correct 0 ms 2180 KB Output is correct
4 Correct 0 ms 2180 KB Output is correct
5 Correct 0 ms 2180 KB Output is correct
6 Correct 0 ms 2180 KB Output is correct
7 Correct 0 ms 2180 KB Output is correct
8 Correct 0 ms 2180 KB Output is correct
9 Correct 0 ms 2180 KB Output is correct
10 Correct 0 ms 2180 KB Output is correct
11 Correct 0 ms 2180 KB Output is correct
12 Correct 0 ms 2180 KB Output is correct
13 Correct 0 ms 2180 KB Output is correct
14 Correct 0 ms 2180 KB Output is correct
15 Correct 0 ms 2180 KB Output is correct
16 Correct 0 ms 2180 KB Output is correct
17 Correct 0 ms 2180 KB Output is correct
18 Correct 0 ms 2180 KB Output is correct
19 Correct 0 ms 2180 KB Output is correct
20 Correct 0 ms 2180 KB Output is correct
21 Correct 0 ms 2180 KB Output is correct
22 Correct 0 ms 2180 KB Output is correct
23 Correct 0 ms 2180 KB Output is correct
24 Correct 0 ms 2180 KB Output is correct
25 Correct 0 ms 2180 KB Output is correct
26 Correct 0 ms 2180 KB Output is correct
27 Correct 0 ms 2180 KB Output is correct
28 Correct 0 ms 2180 KB Output is correct
29 Correct 0 ms 2180 KB Output is correct
30 Correct 0 ms 2180 KB Output is correct
31 Correct 0 ms 2180 KB Output is correct
32 Correct 0 ms 2180 KB Output is correct
33 Correct 0 ms 2180 KB Output is correct
34 Correct 0 ms 2180 KB Output is correct
35 Correct 0 ms 2180 KB Output is correct
36 Correct 0 ms 2180 KB Output is correct
37 Correct 0 ms 2180 KB Output is correct
38 Correct 0 ms 2180 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 2180 KB Output is correct
2 Correct 0 ms 2180 KB Output is correct
3 Correct 0 ms 2180 KB Output is correct
4 Correct 0 ms 2180 KB Output is correct
5 Correct 0 ms 2180 KB Output is correct
6 Correct 0 ms 2180 KB Output is correct
7 Correct 0 ms 2180 KB Output is correct
8 Correct 0 ms 2180 KB Output is correct
9 Correct 0 ms 2180 KB Output is correct
10 Correct 0 ms 2180 KB Output is correct
11 Correct 0 ms 2180 KB Output is correct
12 Correct 0 ms 2180 KB Output is correct
13 Correct 0 ms 2180 KB Output is correct
14 Correct 0 ms 2180 KB Output is correct
15 Correct 0 ms 2180 KB Output is correct
16 Correct 0 ms 2180 KB Output is correct
17 Correct 0 ms 2180 KB Output is correct
18 Correct 0 ms 2180 KB Output is correct
19 Correct 0 ms 2180 KB Output is correct
20 Correct 0 ms 2180 KB Output is correct
21 Correct 0 ms 2180 KB Output is correct
22 Correct 0 ms 2180 KB Output is correct
23 Correct 0 ms 2180 KB Output is correct
24 Correct 0 ms 2180 KB Output is correct
25 Correct 0 ms 2180 KB Output is correct
26 Correct 0 ms 2180 KB Output is correct
27 Correct 0 ms 2180 KB Output is correct
28 Correct 0 ms 2180 KB Output is correct
29 Correct 0 ms 2180 KB Output is correct
30 Correct 0 ms 2180 KB Output is correct
31 Correct 0 ms 2180 KB Output is correct
32 Correct 0 ms 2180 KB Output is correct
33 Correct 0 ms 2180 KB Output is correct
34 Correct 0 ms 2180 KB Output is correct
35 Correct 0 ms 2180 KB Output is correct
36 Correct 0 ms 2180 KB Output is correct
37 Correct 0 ms 2180 KB Output is correct
38 Correct 0 ms 2180 KB Output is correct
39 Correct 76 ms 8364 KB Output is correct
40 Correct 109 ms 14508 KB Output is correct
41 Correct 53 ms 8364 KB Output is correct
42 Correct 53 ms 8364 KB Output is correct
43 Correct 39 ms 5292 KB Output is correct
44 Correct 146 ms 14508 KB Output is correct
45 Correct 139 ms 14508 KB Output is correct
46 Correct 139 ms 14508 KB Output is correct
47 Correct 109 ms 14508 KB Output is correct
48 Correct 119 ms 14508 KB Output is correct
49 Correct 773 ms 28756 KB Output is correct
50 Correct 749 ms 28756 KB Output is correct
51 Correct 836 ms 28756 KB Output is correct
52 Correct 799 ms 28756 KB Output is correct
53 Correct 756 ms 28756 KB Output is correct
54 Correct 753 ms 28756 KB Output is correct
55 Execution timed out 1500 ms 57268 KB Execution timed out
56 Halted 0 ms 0 KB -