답안 #632573

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
632573	2022-08-20T10:52:08 Z	KiriLL1ca	Money (IZhO17_money)	C++14	100 / 100	1008 ms	57992 KB

money

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fr first
#define sc second
#define all(x) (x).begin(), (x).end()
#define pw(x) (1ll << x)
#define sz(x) (int)((x).size())
#define pb push_back
#define endl '\n'

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

template <typename T> inline bool umin (T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; }
template <typename T> inline bool umax (T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template <typename T>
using oset = tree<T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;

const int N = 3e5 + 10;

inline void solve () {
        int n; cin >> n;
        vector <int> a (n);
        for (auto &i : a) cin >> i;
        set <int> s; s.insert(1e9);
        int q = 1e9;
        int res = 0;
        for (int i = 0; i < n; ++i) {
                if (i && a[i] == a[i - 1]) continue;
                auto x = s.lower_bound(a[i]);
                if (!i || a[i - 1] > a[i] || *x != q) {
                        ++res; q = *s.upper_bound(a[i]);
                }
                s.insert(a[i]);
        }
        cout << res << endl;

}

signed main() {
        ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
        int t = 1; // cin >> t;
        while (t--) solve();
        return 0;
}

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	324 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	324 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	320 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	324 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	324 KB	Output is correct

Subtask #2
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	324 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	324 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	320 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	324 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	324 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	296 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	0 ms	320 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct

Subtask #3
20.0 / 20.0

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

Subtask #4
55.0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	324 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	324 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	320 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	324 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	324 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	296 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	0 ms	320 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	0 ms	340 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	0 ms	212 KB	Output is correct
34	Correct	0 ms	212 KB	Output is correct
35	Correct	0 ms	212 KB	Output is correct
36	Correct	1 ms	324 KB	Output is correct
37	Correct	0 ms	212 KB	Output is correct
38	Correct	0 ms	212 KB	Output is correct
39	Correct	46 ms	5388 KB	Output is correct
40	Correct	82 ms	8652 KB	Output is correct
41	Correct	40 ms	4400 KB	Output is correct
42	Correct	48 ms	3960 KB	Output is correct
43	Correct	37 ms	2924 KB	Output is correct
44	Correct	107 ms	10868 KB	Output is correct
45	Correct	97 ms	10876 KB	Output is correct
46	Correct	105 ms	11084 KB	Output is correct
47	Correct	82 ms	11016 KB	Output is correct
48	Correct	96 ms	11012 KB	Output is correct
49	Correct	449 ms	29400 KB	Output is correct
50	Correct	468 ms	29496 KB	Output is correct
51	Correct	422 ms	29432 KB	Output is correct
52	Correct	476 ms	29464 KB	Output is correct
53	Correct	414 ms	29452 KB	Output is correct
54	Correct	444 ms	29316 KB	Output is correct
55	Correct	995 ms	57844 KB	Output is correct
56	Correct	984 ms	57968 KB	Output is correct
57	Correct	990 ms	57932 KB	Output is correct
58	Correct	957 ms	57992 KB	Output is correct
59	Correct	1008 ms	57856 KB	Output is correct
60	Correct	988 ms	57888 KB	Output is correct
61	Correct	996 ms	57856 KB	Output is correct
62	Correct	990 ms	57888 KB	Output is correct

답안 #632573

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