# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
920063 | 2024-02-02T03:07:33 Z | thunopro | Bitaro the Brave (JOI19_ho_t1) | C++14 | 303 ms | 115540 KB |
#include<bits/stdc++.h> using namespace std ; #define maxn 3009 #define ll long long #define fi first #define se second #define pb push_back #define left id<<1 #define right id<<1|1 #define re exit(0); const int mod = 1e9+7; const int INF = 1e9; typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pii> vii; typedef vector<ll> vl; void add ( int &a , int b ) { a += b ; if ( a > mod ) a -= mod ; if ( a < 0 ) a += mod ; } template <typename T> void chkmin ( T &a , T b ) { if ( a > b ) a = b ; } template <typename T> void chkmax ( T &a , T b ) { if ( a < b ) a = b ; } int _pow ( int a , int n ) { if ( n == 0 ) return 1 ; int res = _pow (a,n/2) ; if ( n % 2 ) return 1ll*res*res%mod*a%mod ; else return 1ll*res*res%mod ; } void rf () { freopen ("bai1.inp","r",stdin) ; } int n , m ; int row [maxn][maxn] , col [maxn][maxn] ; int a [maxn][maxn] ; int main () { ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0); // rf () ; cin >> n >> m ; for ( int i = 1 ; i <= n ; i ++ ) for ( int j = 1 ; j <= m ; j ++ ) { char c ; cin >> c ; if ( c == 'J' ) a [i][j] = 0 ; else if ( c == 'O' ) a [i][j] = 1 ; else a [i][j] = 2 ; } for ( int i = 1 ; i <= n ; i ++ ) for ( int j = m ; j >= 1 ; j -- ) row [i][j] = row [i][j+1] + (a[i][j]==1) ; for ( int j = 1 ; j <= m ; j ++ ) for ( int i = n ; i >= 1 ; i -- ) col [i][j] = col [i+1][j] + (a[i][j]==2) ; ll res = 0 ; for ( int i = 1 ; i <= n ; i ++ ) for ( int j = 1 ; j <= m ; j ++ ) { if ( a [i][j] == 0 ) res += 1ll*row[i][j]*col[i][j] ; } cout << res ; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 344 KB | Output is correct |
4 | Correct | 1 ms | 344 KB | Output is correct |
5 | Correct | 2 ms | 3416 KB | Output is correct |
6 | Correct | 1 ms | 3416 KB | Output is correct |
7 | Correct | 1 ms | 3160 KB | Output is correct |
8 | Correct | 2 ms | 3416 KB | Output is correct |
9 | Correct | 1 ms | 3416 KB | Output is correct |
10 | Correct | 2 ms | 3416 KB | Output is correct |
11 | Correct | 2 ms | 3420 KB | Output is correct |
12 | Correct | 1 ms | 3416 KB | Output is correct |
13 | Correct | 1 ms | 3288 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 344 KB | Output is correct |
4 | Correct | 1 ms | 344 KB | Output is correct |
5 | Correct | 2 ms | 3416 KB | Output is correct |
6 | Correct | 1 ms | 3416 KB | Output is correct |
7 | Correct | 1 ms | 3160 KB | Output is correct |
8 | Correct | 2 ms | 3416 KB | Output is correct |
9 | Correct | 1 ms | 3416 KB | Output is correct |
10 | Correct | 2 ms | 3416 KB | Output is correct |
11 | Correct | 2 ms | 3420 KB | Output is correct |
12 | Correct | 1 ms | 3416 KB | Output is correct |
13 | Correct | 1 ms | 3288 KB | Output is correct |
14 | Correct | 8 ms | 15868 KB | Output is correct |
15 | Correct | 3 ms | 12888 KB | Output is correct |
16 | Correct | 4 ms | 9052 KB | Output is correct |
17 | Correct | 1 ms | 600 KB | Output is correct |
18 | Correct | 11 ms | 15960 KB | Output is correct |
19 | Correct | 8 ms | 15960 KB | Output is correct |
20 | Correct | 9 ms | 15960 KB | Output is correct |
21 | Correct | 11 ms | 15960 KB | Output is correct |
22 | Correct | 8 ms | 15960 KB | Output is correct |
23 | Correct | 8 ms | 15960 KB | Output is correct |
24 | Correct | 11 ms | 15960 KB | Output is correct |
25 | Correct | 8 ms | 15960 KB | Output is correct |
26 | Correct | 7 ms | 15960 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 344 KB | Output is correct |
4 | Correct | 1 ms | 344 KB | Output is correct |
5 | Correct | 2 ms | 3416 KB | Output is correct |
6 | Correct | 1 ms | 3416 KB | Output is correct |
7 | Correct | 1 ms | 3160 KB | Output is correct |
8 | Correct | 2 ms | 3416 KB | Output is correct |
9 | Correct | 1 ms | 3416 KB | Output is correct |
10 | Correct | 2 ms | 3416 KB | Output is correct |
11 | Correct | 2 ms | 3420 KB | Output is correct |
12 | Correct | 1 ms | 3416 KB | Output is correct |
13 | Correct | 1 ms | 3288 KB | Output is correct |
14 | Correct | 8 ms | 15868 KB | Output is correct |
15 | Correct | 3 ms | 12888 KB | Output is correct |
16 | Correct | 4 ms | 9052 KB | Output is correct |
17 | Correct | 1 ms | 600 KB | Output is correct |
18 | Correct | 11 ms | 15960 KB | Output is correct |
19 | Correct | 8 ms | 15960 KB | Output is correct |
20 | Correct | 9 ms | 15960 KB | Output is correct |
21 | Correct | 11 ms | 15960 KB | Output is correct |
22 | Correct | 8 ms | 15960 KB | Output is correct |
23 | Correct | 8 ms | 15960 KB | Output is correct |
24 | Correct | 11 ms | 15960 KB | Output is correct |
25 | Correct | 8 ms | 15960 KB | Output is correct |
26 | Correct | 7 ms | 15960 KB | Output is correct |
27 | Correct | 293 ms | 114732 KB | Output is correct |
28 | Correct | 14 ms | 65488 KB | Output is correct |
29 | Correct | 13 ms | 11864 KB | Output is correct |
30 | Correct | 1 ms | 600 KB | Output is correct |
31 | Correct | 221 ms | 96788 KB | Output is correct |
32 | Correct | 215 ms | 115280 KB | Output is correct |
33 | Correct | 195 ms | 115060 KB | Output is correct |
34 | Correct | 252 ms | 111188 KB | Output is correct |
35 | Correct | 219 ms | 115444 KB | Output is correct |
36 | Correct | 189 ms | 115028 KB | Output is correct |
37 | Correct | 303 ms | 115540 KB | Output is correct |
38 | Correct | 149 ms | 96632 KB | Output is correct |
39 | Correct | 142 ms | 96500 KB | Output is correct |