oj.uz

Submission #287462

# Submission time Handle Problem Language Result Execution time Memory
287462 2020-08-31T17:11:25 Z Namnamseo None (JOI16_ho_t2) C++17
100 / 100
 4 ms 3672 KB 
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;

char s[100010];
ll pj[100010];
ll po[100010];

ll si[100010];
ll so[100010];

int main(){
	int n;
	scanf("%d%s", &n, s+1);
	ll z = 0;
	for(int i=1; i<=n; ++i){
		pj[i] = pj[i-1] + (s[i] == 'J');
		po[i] = po[i-1] + (s[i] == 'O' ? pj[i] : 0);
		if(s[i] == 'I') z += po[i];
	}
	for(int i=n; 1<=i; --i){
		si[i] = si[i+1] + (s[i] == 'I');
		so[i] = so[i+1] + (s[i] == 'O' ? si[i] : 0);
	}
	ll ans = 0;
	for(int i=0; i<=n; ++i){
		ans = max(ans, so[i+1]);
		ans = max(ans, pj[i] * si[i+1]);
		ans = max(ans, po[i]);
	}
	printf("%lld\n", ans + z);
	return 0;
}

Compilation message

2016_ho_t2.cpp: In function 'int main()':
2016_ho_t2.cpp:15:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   15 |  scanf("%d%s", &n, s+1);
      |  ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 360 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 356 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 360 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 356 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 360 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 356 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 3 ms 3584 KB Output is correct
32 Correct 3 ms 3584 KB Output is correct
33 Correct 3 ms 3672 KB Output is correct
34 Correct 3 ms 3584 KB Output is correct
35 Correct 3 ms 3584 KB Output is correct
36 Correct 3 ms 3584 KB Output is correct
37 Correct 3 ms 3584 KB Output is correct
38 Correct 3 ms 3584 KB Output is correct
39 Correct 3 ms 3584 KB Output is correct
40 Correct 3 ms 3584 KB Output is correct
41 Correct 3 ms 3584 KB Output is correct
42 Correct 3 ms 3584 KB Output is correct
43 Correct 4 ms 3584 KB Output is correct
44 Correct 4 ms 3584 KB Output is correct
45 Correct 3 ms 3584 KB Output is correct