답안 #909496

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
909496 2024-01-17T08:29:21 Z a_l_i_r_e_z_a Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
158 ms 89640 KB
// In the name of God

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pii;
typedef pair<ll, ll> pll;

#define pb push_back
#define S second
#define F first
#define mp make_pair
#define smax(x, y) (x) = max((x), (y))
#define smin(x, y) (x) = min((x), (y))
#define all(x) (x).begin(), (x).end()
#define len(x) ((ll)(x).size())

const int maxn = 3000 + 5;
const int inf = 1e9 + 7;
int n, m, orb[maxn][maxn], ing[maxn][maxn];
string a[maxn];

int32_t main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n >> m;
    for(int i = 0; i < n; i++) cin >> a[i];
    for(int i = 0; i < n; i++){
        for(int j = m - 1; j >= 0; j--) 
            orb[i][j] = orb[i][j + 1] + (a[i][j] == 'O');
    }
    ll ans = 0;
    for(int j = 0; j < m; j++){
        for(int i = n - 1; i >= 0; i--){
            ing[i][j] = ing[i + 1][j] + (a[i][j] == 'I');
            if(a[i][j] == 'J') ans += ing[i][j] * orb[i][j];
        }
    }
    cout << ans << '\n';

    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1368 KB Output is correct
9 Correct 1 ms 1372 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1368 KB Output is correct
9 Correct 1 ms 1372 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 6 ms 8540 KB Output is correct
15 Correct 2 ms 6448 KB Output is correct
16 Correct 3 ms 4700 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 6 ms 9052 KB Output is correct
19 Correct 5 ms 8792 KB Output is correct
20 Correct 5 ms 8796 KB Output is correct
21 Correct 7 ms 9068 KB Output is correct
22 Correct 5 ms 8796 KB Output is correct
23 Correct 5 ms 8796 KB Output is correct
24 Correct 6 ms 9052 KB Output is correct
25 Correct 4 ms 8796 KB Output is correct
26 Correct 4 ms 8796 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1368 KB Output is correct
9 Correct 1 ms 1372 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 6 ms 8540 KB Output is correct
15 Correct 2 ms 6448 KB Output is correct
16 Correct 3 ms 4700 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 6 ms 9052 KB Output is correct
19 Correct 5 ms 8792 KB Output is correct
20 Correct 5 ms 8796 KB Output is correct
21 Correct 7 ms 9068 KB Output is correct
22 Correct 5 ms 8796 KB Output is correct
23 Correct 5 ms 8796 KB Output is correct
24 Correct 6 ms 9052 KB Output is correct
25 Correct 4 ms 8796 KB Output is correct
26 Correct 4 ms 8796 KB Output is correct
27 Correct 158 ms 88540 KB Output is correct
28 Correct 10 ms 36704 KB Output is correct
29 Correct 7 ms 7884 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 122 ms 72116 KB Output is correct
32 Correct 126 ms 89308 KB Output is correct
33 Correct 141 ms 89344 KB Output is correct
34 Correct 135 ms 83452 KB Output is correct
35 Correct 141 ms 89344 KB Output is correct
36 Correct 142 ms 89300 KB Output is correct
37 Correct 158 ms 89640 KB Output is correct
38 Correct 97 ms 71824 KB Output is correct
39 Correct 95 ms 71588 KB Output is correct