답안 #36057 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
36057	2017-12-05T02:00:02 Z	UncleGrandpa925	Money (IZhO17_money)	C++14	45 / 100	1500 ms	52784 KB

money

/*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 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];
set<int> st;
signed main() {
	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;
	st.insert(a[0]);
	int len = 1;
	for (int i = 1; i < n; 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++;
	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:34:7: warning: unused variable 't' [-Wunused-variable]
   int t; scanf("%d", &a[i]);
       ^
money.cpp:39:6: warning: unused variable 'len' [-Wunused-variable]
  int len = 1;
      ^
money.cpp:32:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
money.cpp:34: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

#	결과	메모리	Grader output
1	Correct	5924 KB	Output is correct
2	Correct	5924 KB	Output is correct
3	Correct	5924 KB	Output is correct
4	Correct	5924 KB	Output is correct
5	Correct	5924 KB	Output is correct
6	Correct	5924 KB	Output is correct
7	Correct	5924 KB	Output is correct
8	Correct	5924 KB	Output is correct
9	Correct	5924 KB	Output is correct
10	Correct	5924 KB	Output is correct
11	Correct	5924 KB	Output is correct
12	Correct	5924 KB	Output is correct
13	Correct	5924 KB	Output is correct
14	Correct	5924 KB	Output is correct
15	Correct	5924 KB	Output is correct
16	Correct	5924 KB	Output is correct

Subtask #2
16.0 / 16.0

#	결과	메모리	Grader output
1	Correct	5924 KB	Output is correct
2	Correct	5924 KB	Output is correct
3	Correct	5924 KB	Output is correct
4	Correct	5924 KB	Output is correct
5	Correct	5924 KB	Output is correct
6	Correct	5924 KB	Output is correct
7	Correct	5924 KB	Output is correct
8	Correct	5924 KB	Output is correct
9	Correct	5924 KB	Output is correct
10	Correct	5924 KB	Output is correct
11	Correct	5924 KB	Output is correct
12	Correct	5924 KB	Output is correct
13	Correct	5924 KB	Output is correct
14	Correct	5924 KB	Output is correct
15	Correct	5924 KB	Output is correct
16	Correct	5924 KB	Output is correct
17	Correct	5924 KB	Output is correct
18	Correct	5924 KB	Output is correct
19	Correct	5924 KB	Output is correct
20	Correct	5924 KB	Output is correct
21	Correct	5924 KB	Output is correct
22	Correct	5924 KB	Output is correct
23	Correct	5924 KB	Output is correct
24	Correct	5924 KB	Output is correct
25	Correct	5924 KB	Output is correct
26	Correct	5924 KB	Output is correct

Subtask #3
20.0 / 20.0

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

Subtask #4
0 / 55.0

#	결과	실행 시간	메모리	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	96 ms	5924 KB	Output is correct
40	Correct	139 ms	5924 KB	Output is correct
41	Correct	93 ms	5924 KB	Output is correct
42	Correct	63 ms	5924 KB	Output is correct
43	Correct	46 ms	5924 KB	Output is correct
44	Correct	189 ms	5924 KB	Output is correct
45	Correct	166 ms	5924 KB	Output is correct
46	Correct	179 ms	5924 KB	Output is correct
47	Correct	166 ms	5924 KB	Output is correct
48	Correct	229 ms	5924 KB	Output is correct
49	Correct	753 ms	24404 KB	Output is correct
50	Correct	756 ms	24404 KB	Output is correct
51	Correct	749 ms	24404 KB	Output is correct
52	Correct	763 ms	24404 KB	Output is correct
53	Correct	806 ms	24404 KB	Output is correct
54	Correct	763 ms	24404 KB	Output is correct
55	Execution timed out	1500 ms	52784 KB	Execution timed out
56	Halted	0 ms	0 KB	-

답안 #36057

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 16.0 / 16.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 55.0

Subtask #1
9.0 / 9.0

Subtask #2
16.0 / 16.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 55.0