oj.uz

Submission #339467

# Submission time Handle Problem Language Result Execution time Memory
339467 2020-12-25T11:05:17 Z bigDuck Bitaro the Brave (JOI19_ho_t1) C++14
20 / 100
 12 ms 7788 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


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]++;
        }
    }
}

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



return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 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 1 ms 1516 KB Output is correct
6 Correct 1 ms 1516 KB Output is correct
7 Correct 1 ms 1388 KB Output is correct
8 Correct 1 ms 1516 KB Output is correct
9 Correct 1 ms 1516 KB Output is correct
10 Correct 1 ms 1388 KB Output is correct
11 Correct 1 ms 1516 KB Output is correct
12 Correct 2 ms 1516 KB Output is correct
13 Correct 1 ms 1388 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 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 1 ms 1516 KB Output is correct
6 Correct 1 ms 1516 KB Output is correct
7 Correct 1 ms 1388 KB Output is correct
8 Correct 1 ms 1516 KB Output is correct
9 Correct 1 ms 1516 KB Output is correct
10 Correct 1 ms 1388 KB Output is correct
11 Correct 1 ms 1516 KB Output is correct
12 Correct 2 ms 1516 KB Output is correct
13 Correct 1 ms 1388 KB Output is correct
14 Correct 10 ms 7404 KB Output is correct
15 Correct 3 ms 5100 KB Output is correct
16 Correct 5 ms 4204 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 12 ms 7788 KB Output is correct
19 Correct 10 ms 7788 KB Output is correct
20 Incorrect 9 ms 7660 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 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 1 ms 1516 KB Output is correct
6 Correct 1 ms 1516 KB Output is correct
7 Correct 1 ms 1388 KB Output is correct
8 Correct 1 ms 1516 KB Output is correct
9 Correct 1 ms 1516 KB Output is correct
10 Correct 1 ms 1388 KB Output is correct
11 Correct 1 ms 1516 KB Output is correct
12 Correct 2 ms 1516 KB Output is correct
13 Correct 1 ms 1388 KB Output is correct
14 Correct 10 ms 7404 KB Output is correct
15 Correct 3 ms 5100 KB Output is correct
16 Correct 5 ms 4204 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 12 ms 7788 KB Output is correct
19 Correct 10 ms 7788 KB Output is correct
20 Incorrect 9 ms 7660 KB Output isn't correct
21 Halted 0 ms 0 KB -