oj.uz

답안 #155642

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
155642 2019-09-29T14:05:28 Z popovicirobert Bitaro the Brave (JOI19_ho_t1) C++14
100 / 100
 118 ms 53384 KB 
#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long



#if 0
const int MOD = ;

inline int lgput(int a, int b) {
    int ans = 1;
    while(b > 0) {
        if(b & 1) ans = (1LL * ans * a) % MOD;
        b >>= 1;
        a = (1LL * a * a) % MOD;
    }
    return ans;
}

inline void mod(int &x) {
    if(x >= MOD)
        x -= MOD;
}

inline void add(int &x, int y) {
    x += y;
    mod(x);
}

inline void sub(int &x, int y) {
    x += MOD - y;
    mod(x);
}

inline void mul(int &x, int y) {
    x = (1LL * x * y) % MOD;
}

inline int inv(int x) {
    return lgput(x, MOD - 2);
}
#endif

#if 0
int fact[], invfact[];

inline void prec(int n) {
    fact[0] = 1;
    for(int i = 1; i <= n; i++) {
        fact[i] = (1LL * fact[i - 1] * i) % MOD;
    }
    invfact[n] = lgput(fact[n], MOD - 2);
    for(int i = n - 1; i >= 0; i--) {
        invfact[i] = (1LL * invfact[i + 1] * (i + 1)) % MOD;
    }
}

inline int comb(int n, int k) {
    if(n < k) return 0;
    return (1LL * fact[n] * (1LL * invfact[k] * invfact[n - k] % MOD)) % MOD;
}
#endif

using namespace std;

const int MAXN = 3005;

char mat[MAXN + 1][MAXN + 1];
int down[MAXN + 1][MAXN + 1];

int main() {
#if 0
    ifstream cin("A.in");
    ofstream cout("A.out");
#endif
    int i, j, n, m;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cin >> n >> m;
    for(i = 1; i <= n; i++) {
        cin >> mat[i] + 1;
    }

    for(i = n; i >= 1; i--) {
        for(j = 1; j <= m; j++) {
            down[i][j] = down[i + 1][j] + (mat[i][j] == 'I');
        }
    }

    ll ans = 0;
    for(i = 1; i <= n; i++) {
        int cnt = 0;
        for(j = m; j >= 1; j--) {
            if(mat[i][j] == 'J') {
                ans += 1LL * cnt * down[i][j];
            }
            cnt += (mat[i][j] == 'O');
        }
    }
    cout << ans;

    return 0;
}

Compilation message

joi2019_ho_t1.cpp: In function 'int main()':
joi2019_ho_t1.cpp:83:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
         cin >> mat[i] + 1;
                ~~~~~~~^~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 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 1016 KB Output is correct
6 Correct 2 ms 1016 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 3 ms 1016 KB Output is correct
9 Correct 2 ms 1028 KB Output is correct
10 Correct 2 ms 1016 KB Output is correct
11 Correct 3 ms 1116 KB Output is correct
12 Correct 3 ms 1016 KB Output is correct
13 Correct 3 ms 1016 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 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 1016 KB Output is correct
6 Correct 2 ms 1016 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 3 ms 1016 KB Output is correct
9 Correct 2 ms 1028 KB Output is correct
10 Correct 2 ms 1016 KB Output is correct
11 Correct 3 ms 1116 KB Output is correct
12 Correct 3 ms 1016 KB Output is correct
13 Correct 3 ms 1016 KB Output is correct
14 Correct 7 ms 4728 KB Output is correct
15 Correct 4 ms 3332 KB Output is correct
16 Correct 4 ms 2784 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 8 ms 5044 KB Output is correct
19 Correct 7 ms 5032 KB Output is correct
20 Correct 6 ms 4984 KB Output is correct
21 Correct 8 ms 5112 KB Output is correct
22 Correct 7 ms 5044 KB Output is correct
23 Correct 7 ms 4984 KB Output is correct
24 Correct 7 ms 5112 KB Output is correct
25 Correct 6 ms 4980 KB Output is correct
26 Correct 8 ms 4952 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 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 1016 KB Output is correct
6 Correct 2 ms 1016 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 3 ms 1016 KB Output is correct
9 Correct 2 ms 1028 KB Output is correct
10 Correct 2 ms 1016 KB Output is correct
11 Correct 3 ms 1116 KB Output is correct
12 Correct 3 ms 1016 KB Output is correct
13 Correct 3 ms 1016 KB Output is correct
14 Correct 7 ms 4728 KB Output is correct
15 Correct 4 ms 3332 KB Output is correct
16 Correct 4 ms 2784 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 8 ms 5044 KB Output is correct
19 Correct 7 ms 5032 KB Output is correct
20 Correct 6 ms 4984 KB Output is correct
21 Correct 8 ms 5112 KB Output is correct
22 Correct 7 ms 5044 KB Output is correct
23 Correct 7 ms 4984 KB Output is correct
24 Correct 7 ms 5112 KB Output is correct
25 Correct 6 ms 4980 KB Output is correct
26 Correct 8 ms 4952 KB Output is correct
27 Correct 98 ms 52856 KB Output is correct
28 Correct 16 ms 16676 KB Output is correct
29 Correct 8 ms 4728 KB Output is correct
30 Correct 4 ms 504 KB Output is correct
31 Correct 118 ms 43276 KB Output is correct
32 Correct 74 ms 53248 KB Output is correct
33 Correct 72 ms 53128 KB Output is correct
34 Correct 92 ms 50124 KB Output is correct
35 Correct 83 ms 53232 KB Output is correct
36 Correct 71 ms 53152 KB Output is correct
37 Correct 108 ms 53384 KB Output is correct
38 Correct 56 ms 43128 KB Output is correct
39 Correct 57 ms 43024 KB Output is correct