oj.uz

Submission #117157

# Submission time Handle Problem Language Result Execution time Memory
117157 2019-06-15T04:45:55 Z onjo0127 None (JOI16_ho_t2) C++11
100 / 100
 34 ms 1380 KB 
#include <bits/stdc++.h>
using namespace std;

char S[100009];
int J[100009], I[100009];

int main() {
    int N; scanf("%d",&N);
    for(int i=1; i<=N; i++) scanf(" %c", &S[i]);
    for(int i=1; i<=N; i++) J[i] = J[i-1] + (S[i] == 'J');
    for(int i=N; i>=1; i--) I[i] = I[i+1] + (S[i] == 'I');
    long long s1 = 0, s2 = 0, s3 = 0, mx = 0;
    for(int i=1; i<=N; i++) {
        if(S[i] == 'O') {
            s1 += 1LL * (J[i] + 1) * I[i];
            s2 += 1LL * J[i] * (I[i] + 1);
            s3 += 1LL * J[i] * I[i];
        }
        mx = max(mx, 1LL * J[i] * I[i]);
    }
    printf("%lld", max({s1, s2, s3 + mx}));
    return 0;
}

Compilation message

2016_ho_t2.cpp: In function 'int main()':
2016_ho_t2.cpp:8:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     int N; scanf("%d",&N);
            ~~~~~^~~~~~~~~
2016_ho_t2.cpp:9:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=1; i<=N; i++) scanf(" %c", &S[i]);
                             ~~~~~^~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
50.0 / 50.0

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