oj.uz

Submission #335778

# Submission time Handle Problem Language Result Execution time Memory
335778 2020-12-14T02:05:28 Z ChrisT None (JOI16_ho_t2) C++17
100 / 100
 5 ms 3692 KB 
#include <bits/stdc++.h>
using namespace std;
const int MN = 1e5 + 5;
char s[MN];
long long jo[MN], oi[MN], jj[MN], ii[MN];
int main() { 
	int n;
	scanf ("%d\n%s",&n,s+1);
	long long j = 0, o = 0, i = 0;
	for (int k = 1; k <= n; k++) {
		if (s[k] == 'J') ++j;
		else if (s[k] == 'O') o += j;
		else i += o;
		jo[k] = o; jj[k] = j;
	}
	long long tot = i, ret = i;
	j = o = i = 0;
	for (int k = n; k >= 1; k--) {
		if (s[k] == 'I') ++i;
		else if (s[k] == 'O') o += i;
		else j += o;
		oi[k] = o; ii[k] = i;
	}
	for (int k = 0; k <= n; k++) {
		ret = max({ret,tot + oi[k+1],tot + jj[k]*ii[k+1],tot+jo[k]});
	}
	printf ("%lld\n",ret);
	return 0;
}

Compilation message

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

Subtask #1
30.0 / 30.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
50.0 / 50.0

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