oj.uz

답안 #339465

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
339465 2020-12-25T11:02:34 Z bigDuck Bitaro the Brave (JOI19_ho_t1) C++14
100 / 100
 493 ms 159468 KB 
#include<bits/stdc++.h>
using namespace std;
#define INIT  ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
#define int ll

char a[3010][3010];
int n, m;
int ing[3010][3010], orb[3010][3010];



int32_t main(){
INIT
cin>>n>>m;
for(int i=1; i<=n; i++){
    for(int j=1; j<=m; j++){
        cin>>a[i][j];
        if(a[i][j]=='I'){
            ing[i][j]++;
        }
        if(a[i][j]=='O'){
            orb[i][j]++;
        }
    }
}

for(int i=1; i<=n; i++){
    for(int j=1; j<=m; j++){
        orb[i][j]=orb[i][j-1]+orb[i][j];
    }
}
for(int j=1; j<=m; j++){
    for(int i=1; i<=n; i++){
        ing[i][j]=ing[i-1][j]+ing[i][j];
    }
}



int res=0;
for(int i=1; i<=n; i++){
    for(int j=1; j<=m; j++){
        if(a[i][j]=='J'){
            res+=(ing[n][j]-ing[i][j])*(orb[i][m]-orb[i][j]);
        }
    }
}
cout<<res;
return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 2 ms 1644 KB Output is correct
6 Correct 1 ms 1644 KB Output is correct
7 Correct 2 ms 1516 KB Output is correct
8 Correct 2 ms 1644 KB Output is correct
9 Correct 2 ms 1644 KB Output is correct
10 Correct 1 ms 1516 KB Output is correct
11 Correct 2 ms 1644 KB Output is correct
12 Correct 1 ms 1644 KB Output is correct
13 Correct 2 ms 1516 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 2 ms 1644 KB Output is correct
6 Correct 1 ms 1644 KB Output is correct
7 Correct 2 ms 1516 KB Output is correct
8 Correct 2 ms 1644 KB Output is correct
9 Correct 2 ms 1644 KB Output is correct
10 Correct 1 ms 1516 KB Output is correct
11 Correct 2 ms 1644 KB Output is correct
12 Correct 1 ms 1644 KB Output is correct
13 Correct 2 ms 1516 KB Output is correct
14 Correct 13 ms 9068 KB Output is correct
15 Correct 3 ms 5100 KB Output is correct
16 Correct 7 ms 5356 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 16 ms 9964 KB Output is correct
19 Correct 12 ms 9856 KB Output is correct
20 Correct 11 ms 9836 KB Output is correct
21 Correct 15 ms 9964 KB Output is correct
22 Correct 12 ms 9836 KB Output is correct
23 Correct 11 ms 9836 KB Output is correct
24 Correct 16 ms 9964 KB Output is correct
25 Correct 12 ms 9836 KB Output is correct
26 Correct 11 ms 9836 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 2 ms 1644 KB Output is correct
6 Correct 1 ms 1644 KB Output is correct
7 Correct 2 ms 1516 KB Output is correct
8 Correct 2 ms 1644 KB Output is correct
9 Correct 2 ms 1644 KB Output is correct
10 Correct 1 ms 1516 KB Output is correct
11 Correct 2 ms 1644 KB Output is correct
12 Correct 1 ms 1644 KB Output is correct
13 Correct 2 ms 1516 KB Output is correct
14 Correct 13 ms 9068 KB Output is correct
15 Correct 3 ms 5100 KB Output is correct
16 Correct 7 ms 5356 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 16 ms 9964 KB Output is correct
19 Correct 12 ms 9856 KB Output is correct
20 Correct 11 ms 9836 KB Output is correct
21 Correct 15 ms 9964 KB Output is correct
22 Correct 12 ms 9836 KB Output is correct
23 Correct 11 ms 9836 KB Output is correct
24 Correct 16 ms 9964 KB Output is correct
25 Correct 12 ms 9836 KB Output is correct
26 Correct 11 ms 9836 KB Output is correct
27 Correct 478 ms 158828 KB Output is correct
28 Correct 16 ms 26368 KB Output is correct
29 Correct 22 ms 13932 KB Output is correct
30 Correct 2 ms 876 KB Output is correct
31 Correct 364 ms 131820 KB Output is correct
32 Correct 411 ms 159340 KB Output is correct
33 Correct 362 ms 158828 KB Output is correct
34 Correct 408 ms 152684 KB Output is correct
35 Correct 432 ms 159340 KB Output is correct
36 Correct 359 ms 159212 KB Output is correct
37 Correct 493 ms 159468 KB Output is correct
38 Correct 282 ms 130924 KB Output is correct
39 Correct 260 ms 131180 KB Output is correct