oj.uz

답안 #732820

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
732820 2023-04-29T10:21:14 Z flappybird 스탬프 수집 (JOI16_ho_t2) C++17
100 / 100
 6 ms 4184 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define MAX 201010
#define MAXS 20
#define INF 1000000000000000001
#define bb ' '
#define ln '\n'
#define Ln '\n'
int arr[MAX];
ll pj[MAX];
ll pjo[MAX];
ll si[MAX];
ll soi[MAX];
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int N;
	cin >> N;
	string s;
	cin >> s;
	int i;
	for (i = 1; i <= N; i++) if (s[i - 1] != 'J') arr[i] = s[i - 1] == 'O' ? 1 : 2;
	for (i = 1; i <= N; i++) {
		if (!arr[i]) pj[i] = 1;
		pj[i] += pj[i - 1];
		if (arr[i] == 1) pjo[i] += pj[i - 1];
		pjo[i] += pjo[i - 1];
	}
	for (i = N; i >= 1; i--) {
		if (arr[i] == 2) si[i] = 1;
		si[i] += si[i + 1];
		if (arr[i] == 1) soi[i] += si[i + 1];
		soi[i] += soi[i + 1];
	}
	ll ans = 0;
	for (i = 1; i <= N; i++) if (arr[i] == 1) ans += pj[i] * si[i];
	ll mx = 0;
	for (i = 1; i < N; i++) mx = max(mx, pj[i] * si[i + 1]);
	mx = max(mx, soi[1]);
	mx = max(mx, pjo[N]);
	cout << ans + mx << ln;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 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 340 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 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 340 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 484 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 456 KB Output is correct
24 Correct 1 ms 456 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 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 340 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 484 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 456 KB Output is correct
24 Correct 1 ms 456 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 4 ms 4020 KB Output is correct
32 Correct 4 ms 4056 KB Output is correct
33 Correct 5 ms 3668 KB Output is correct
34 Correct 4 ms 4092 KB Output is correct
35 Correct 4 ms 4180 KB Output is correct
36 Correct 5 ms 4076 KB Output is correct
37 Correct 6 ms 4184 KB Output is correct
38 Correct 4 ms 4180 KB Output is correct
39 Correct 4 ms 4180 KB Output is correct
40 Correct 4 ms 4180 KB Output is correct
41 Correct 5 ms 4172 KB Output is correct
42 Correct 4 ms 4092 KB Output is correct
43 Correct 5 ms 4180 KB Output is correct
44 Correct 5 ms 4180 KB Output is correct
45 Correct 4 ms 4180 KB Output is correct