답안 #831722

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
831722	2023-08-20T12:41:12 Z	Chal1shkan	Money (IZhO17_money)	C++14	100 / 100	157 ms	22748 KB

money

//Bismillahir-Rahmanir-Rahim
 
# include <bits/stdc++.h>
 
# define pb push_back
# define ff first
# define ss second
# define nl "\n"
# define sz(x) ((int)(x).size())
# define all(x) (x).begin(), (x).end()
# define deb(x) cerr << #x  << " = " << x << endl; 
# define pll pair <ll, ll>
# define pii pair <int, int>
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
 
const ll maxn = 1e6 + 7;
const ll inf = 2e18 + 0;
const ll mod = 1e9 + 7;
const ll dx[] = {-1, 1, 0, 0};
const ll dy[] = {0, 0, -1, 1};
 
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
struct fenwick {
	ll ft[maxn];
	void upd (ll id, ll x) {
		for (; id < maxn; id += (id & -id)) {
			ft[id] += x;
		}
	}
	ll get (ll id) {
		ll res = 0;
		for (; id > 0; id -= (id & -id)) {
			res += ft[id];
		}
		return res;
	}
	ll get (ll l, ll r) {
      if (l > r) return 0;
		return get(r) - get(l - 1);
	}
} st;
 
void ma1n (/* SABR */) {
	ll n;
	cin >> n;
	ll a[n + 3];
	for (ll i = 1; i <= n; ++i) {
		cin >> a[i];
	}
	ll ans = 0;
	for (ll i = 1; i <= n; ++i) {
		ll j = i;
		while (1) {
			if (j + 1 > n) break;
			if (a[j] > a[j + 1]) break;
			if (st.get(a[i] + 1, a[j + 1] - 1)) break;
			++j;
		}
		ans++;
		for (ll k = i; k <= j; ++k) st.upd(a[k], 1);
		i = j;
	}
	cout << ans << nl;
}
 
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
//  freopen("file.in", "r", stdin);
//  freopen("file.out", "w", stdout);
    int ttt = 1;
//  cin >> ttt;
    for (int test = 1; test <= ttt; ++test) {
//      cout << "Case " << test << ":" << '\n';
        ma1n();
    }
    return 0;
}
 
// 998batrr | BbIWEJI 3A TObOU!!!
// tourist  | BbIWEJI 3A TObOU!!!

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
55.0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	468 KB	Output is correct
16	Correct	1 ms	468 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	0 ms	468 KB	Output is correct
19	Correct	0 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	0 ms	468 KB	Output is correct
22	Correct	0 ms	336 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	0 ms	340 KB	Output is correct
25	Correct	1 ms	596 KB	Output is correct
26	Correct	1 ms	592 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	0 ms	340 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	468 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	464 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	0 ms	340 KB	Output is correct
37	Correct	1 ms	2004 KB	Output is correct
38	Correct	1 ms	2128 KB	Output is correct
39	Correct	52 ms	7264 KB	Output is correct
40	Correct	97 ms	11992 KB	Output is correct
41	Correct	45 ms	6036 KB	Output is correct
42	Correct	45 ms	5584 KB	Output is correct
43	Correct	28 ms	4132 KB	Output is correct
44	Correct	117 ms	14916 KB	Output is correct
45	Correct	112 ms	14908 KB	Output is correct
46	Correct	114 ms	15052 KB	Output is correct
47	Correct	100 ms	15028 KB	Output is correct
48	Correct	105 ms	15056 KB	Output is correct
49	Correct	142 ms	22748 KB	Output is correct
50	Correct	125 ms	22744 KB	Output is correct
51	Correct	132 ms	22676 KB	Output is correct
52	Correct	120 ms	22732 KB	Output is correct
53	Correct	130 ms	22716 KB	Output is correct
54	Correct	139 ms	22476 KB	Output is correct
55	Correct	142 ms	22604 KB	Output is correct
56	Correct	157 ms	22688 KB	Output is correct
57	Correct	148 ms	22604 KB	Output is correct
58	Correct	145 ms	22592 KB	Output is correct
59	Correct	147 ms	22692 KB	Output is correct
60	Correct	155 ms	22584 KB	Output is correct
61	Correct	155 ms	22592 KB	Output is correct
62	Correct	143 ms	22604 KB	Output is correct

답안 #831722

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