oj.uz

Submission #136956

# Submission time Handle Problem Language Result Execution time Memory
136956 2019-07-26T16:34:39 Z ksmzzang2003 None (JOI16_ho_t2) C++14
100 / 100
 11 ms 2212 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
string A;
ll pj[100003],rpi[100003];
ll o,ret=0;
int main() {
    cin>>N>>A;
    for(ll i=0; i<N; i++) pj[i] = ((i>0)?pj[i-1]:0) +(A[i]=='J');
    for(ll i=N-1; i>=0; i--) rpi[i] = rpi[i+1]+(A[i]=='I');
    for(ll i=0; i<N-1; i++) o=max(o, pj[i]*rpi[i+1]);
    for(ll i=0;i<N;i++) if(A[i]=='O') o+=pj[i]*rpi[i]; ret = max(ret,o);
    o=0;
    for(ll i=0;i<N;i++) if(A[i]=='O') o+=(pj[i]+1)*rpi[i];  ret = max(ret,o);
    o=0;for(ll i=0;i<N;i++) if(A[i]=='O') o+=pj[i]*(rpi[i]+1); ret = max(ret,o);
    printf("%lld",ret);
}

Compilation message

2016_ho_t2.cpp: In function 'int main()':
2016_ho_t2.cpp:13:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for(ll i=0;i<N;i++) if(A[i]=='O') o+=pj[i]*rpi[i]; ret = max(ret,o);
     ^~~
2016_ho_t2.cpp:13:56: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
     for(ll i=0;i<N;i++) if(A[i]=='O') o+=pj[i]*rpi[i]; ret = max(ret,o);
                                                        ^~~
2016_ho_t2.cpp:15:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for(ll i=0;i<N;i++) if(A[i]=='O') o+=(pj[i]+1)*rpi[i];  ret = max(ret,o);
     ^~~
2016_ho_t2.cpp:15:61: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
     for(ll i=0;i<N;i++) if(A[i]=='O') o+=(pj[i]+1)*rpi[i];  ret = max(ret,o);
                                                             ^~~

Subtask #1
30.0 / 30.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 380 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 10 ms 2040 KB Output is correct
32 Correct 10 ms 2068 KB Output is correct
33 Correct 10 ms 2040 KB Output is correct
34 Correct 11 ms 2168 KB Output is correct
35 Correct 11 ms 2172 KB Output is correct
36 Correct 11 ms 2212 KB Output is correct
37 Correct 11 ms 2152 KB Output is correct
38 Correct 11 ms 2128 KB Output is correct
39 Correct 11 ms 2040 KB Output is correct
40 Correct 11 ms 2168 KB Output is correct
41 Correct 10 ms 2040 KB Output is correct
42 Correct 11 ms 2040 KB Output is correct
43 Correct 11 ms 2044 KB Output is correct
44 Correct 11 ms 2168 KB Output is correct
45 Correct 10 ms 2168 KB Output is correct