oj.uz

답안 #888382

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
888382 2023-12-17T08:35:34 Z hafo Bitaro the Brave (JOI19_ho_t1) C++14
100 / 100
 170 ms 48980 KB 
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pb push_back
#define pa pair<int, int>
#define pall pair<ll, int>
#define fi first
#define se second
#define TASK "test"
#define Size(x) (int) x.size()
#define all(x) x.begin(), x.end()
using namespace std;

template<typename T1, typename T2> bool mini (T1 &a, T2 b) {if(a > b) a = b; else return 0; return 1;}
template<typename T1, typename T2> bool maxi (T1 &a, T2 b) {if(a < b) a = b; else return 0; return 1;}

const int MOD = 1e9 + 7;
const int LOG = 20;
const int maxn = 3e3 + 7;
const ll oo = 1e18 + 69;

int n, m, col[maxn][maxn];
char a[maxn][maxn];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    //freopen(TASK".inp", "r", stdin);
    //freopen(TASK".out", "w", stdout);

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

    for(int i = 1; i <= m; i++) {
        for(int j = n; j >= 1; j--) {
            col[i][j] = col[i][j + 1];
            if(a[j][i] == 'I') col[i][j]++;
        }
    }

    ll ans = 0;
    for(int i = 1; i <= n; i++) {
        ll sum = 0;
        for(int j = 1; j <= m; j++) {
            if(a[i][j] == 'J') sum += col[j][i + 1];
            if(a[i][j] == 'O') ans += sum;
        }
    }
    cout<<ans;
    return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 0 ms 460 KB Output is correct
5 Correct 1 ms 2908 KB Output is correct
6 Correct 1 ms 2908 KB Output is correct
7 Correct 2 ms 2908 KB Output is correct
8 Correct 1 ms 2908 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 1 ms 2908 KB Output is correct
11 Correct 1 ms 2904 KB Output is correct
12 Correct 1 ms 2908 KB Output is correct
13 Correct 1 ms 2908 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 0 ms 460 KB Output is correct
5 Correct 1 ms 2908 KB Output is correct
6 Correct 1 ms 2908 KB Output is correct
7 Correct 2 ms 2908 KB Output is correct
8 Correct 1 ms 2908 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 1 ms 2908 KB Output is correct
11 Correct 1 ms 2904 KB Output is correct
12 Correct 1 ms 2908 KB Output is correct
13 Correct 1 ms 2908 KB Output is correct
14 Correct 5 ms 4956 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 3 ms 5212 KB Output is correct
17 Correct 1 ms 1628 KB Output is correct
18 Correct 6 ms 5792 KB Output is correct
19 Correct 5 ms 5720 KB Output is correct
20 Correct 5 ms 5792 KB Output is correct
21 Correct 6 ms 5724 KB Output is correct
22 Correct 5 ms 5592 KB Output is correct
23 Correct 5 ms 5724 KB Output is correct
24 Correct 6 ms 5720 KB Output is correct
25 Correct 5 ms 5976 KB Output is correct
26 Correct 6 ms 5724 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 0 ms 460 KB Output is correct
5 Correct 1 ms 2908 KB Output is correct
6 Correct 1 ms 2908 KB Output is correct
7 Correct 2 ms 2908 KB Output is correct
8 Correct 1 ms 2908 KB Output is correct
9 Correct 1 ms 2908 KB Output is correct
10 Correct 1 ms 2908 KB Output is correct
11 Correct 1 ms 2904 KB Output is correct
12 Correct 1 ms 2908 KB Output is correct
13 Correct 1 ms 2908 KB Output is correct
14 Correct 5 ms 4956 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 3 ms 5212 KB Output is correct
17 Correct 1 ms 1628 KB Output is correct
18 Correct 6 ms 5792 KB Output is correct
19 Correct 5 ms 5720 KB Output is correct
20 Correct 5 ms 5792 KB Output is correct
21 Correct 6 ms 5724 KB Output is correct
22 Correct 5 ms 5592 KB Output is correct
23 Correct 5 ms 5724 KB Output is correct
24 Correct 6 ms 5720 KB Output is correct
25 Correct 5 ms 5976 KB Output is correct
26 Correct 6 ms 5724 KB Output is correct
27 Correct 164 ms 46948 KB Output is correct
28 Correct 2 ms 8792 KB Output is correct
29 Correct 16 ms 15708 KB Output is correct
30 Correct 4 ms 9820 KB Output is correct
31 Correct 120 ms 41344 KB Output is correct
32 Correct 138 ms 48868 KB Output is correct
33 Correct 140 ms 48980 KB Output is correct
34 Correct 136 ms 42356 KB Output is correct
35 Correct 144 ms 48976 KB Output is correct
36 Correct 135 ms 48976 KB Output is correct
37 Correct 170 ms 48976 KB Output is correct
38 Correct 88 ms 41336 KB Output is correct
39 Correct 95 ms 41984 KB Output is correct