oj.uz

답안 #892498

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
892498 2023-12-25T12:21:20 Z raul2008487 Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 203 ms 159060 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define eb emplace_back
#define vl vector<ll>
#define fi first
#define se second
#define in insert
#define mpr make_pair
#define lg(x) __lg(x)
#define bpc(x) __builtin_popcount(x)
#define all(v) v.begin(), v.end()
#define endl "\n"
using namespace std;
const int sz = 2e5+5;
const int mod = 998244353;
const ll inf = 1000000000000000;
void solve()
{
    ll n, m, i, j;
    cin>>n>>m;
    char a[n+1][m+1];
    ll sc[n+2][m+2], sr[n+2][m+2];
    for(i=1;i<=n;i++){
        for(j=1;j<=m;j++){
            cin>>a[i][j];
        }
    }
    for(i=1;i<=n;i++){sr[i][m+1] = 0;}
    for(i=1;i<=m;i++){sc[n+1][i] = 0;}
    ll ans = 0;
    for(i=n;i>0;i--){
        for(j=m;j>0;j--){
            sr[i][j] = sr[i][j+1];
            sc[i][j] = sc[i+1][j];
            if(a[i][j] == 'O'){sr[i][j]++;}
            else if(a[i][j] == 'I'){sc[i][j]++;}
            else{
                ans += (sr[i][j] * sc[i][j]);
            }
        }
    }
    /*for(i=1;i<=n;i++){
        for(j=1;j<=m;j++){
            cout << sr[i][j] << ' ';
        }
        cout << endl;
    }*/
    cout << ans << endl;
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    //precomp();
    ll tst=1;
    //cin>>tst;
    while(tst--){
        solve();
    }
}
/*
1
3 2
2 2 2
1 6
1 5
*/

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 5 ms 3676 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 2648 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 7 ms 4880 KB Output is correct
19 Correct 5 ms 5208 KB Output is correct
20 Correct 5 ms 4700 KB Output is correct
21 Correct 6 ms 4892 KB Output is correct
22 Correct 5 ms 4708 KB Output is correct
23 Correct 5 ms 4700 KB Output is correct
24 Correct 6 ms 4700 KB Output is correct
25 Correct 5 ms 4700 KB Output is correct
26 Correct 5 ms 4700 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 5 ms 3676 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 2648 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 7 ms 4880 KB Output is correct
19 Correct 5 ms 5208 KB Output is correct
20 Correct 5 ms 4700 KB Output is correct
21 Correct 6 ms 4892 KB Output is correct
22 Correct 5 ms 4708 KB Output is correct
23 Correct 5 ms 4700 KB Output is correct
24 Correct 6 ms 4700 KB Output is correct
25 Correct 5 ms 4700 KB Output is correct
26 Correct 5 ms 4700 KB Output is correct
27 Correct 200 ms 150248 KB Output is correct
28 Correct 1 ms 860 KB Output is correct
29 Correct 14 ms 12124 KB Output is correct
30 Correct 1 ms 856 KB Output is correct
31 Correct 145 ms 110444 KB Output is correct
32 Correct 170 ms 158036 KB Output is correct
33 Correct 168 ms 158520 KB Output is correct
34 Correct 168 ms 128300 KB Output is correct
35 Correct 195 ms 158032 KB Output is correct
36 Correct 178 ms 158804 KB Output is correct
37 Correct 203 ms 159060 KB Output is correct
38 Correct 133 ms 109648 KB Output is correct
39 Correct 121 ms 110188 KB Output is correct