oj.uz

Submission #473051

# Submission time Handle Problem Language Result Execution time Memory
473051 2021-09-14T21:12:15 Z Blobo2_Blobo2 Bitaro the Brave (JOI19_ho_t1) C++14
100 / 100
 136 ms 18952 KB 
/*
Editor: Abdelrahman Hossam
Nickname: Blobo2_Blobo2
IOI next year isA :)
*/
/*#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-funroll-all-loops,-fpeel-loops,-funswitch-loops")*/

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define all(v)  v.begin(),v.end()
#define gen(arr,n,nxt)  generate(arr,arr+n,nxt)
#define Blobo2_el_7akim_elly_3ayz_yro7_IOI_w_3ayz_yakol_jilaty ios_base::sync_with_stdio(false);cin.tie(0);
#define EPS 0.00000001

const int mo=1e9+7,INF=1e18;
int nxt(){int x;cin>>x;return x;}

signed main(){
    Blobo2_el_7akim_elly_3ayz_yro7_IOI_w_3ayz_yakol_jilaty
    int n=nxt(),m=nxt();
    string grid[n];
    for(int i=0;i<n;i++)cin>>grid[i];
    int o[n],I[m];
    memset(o,0,sizeof o);
    memset(I,0,sizeof I);
    for(int i=0;i<n;i++){
        int c=0;
        for(int j=0;j<m;j++) c+= grid[i][j] == 'O';
        o[i] = c;
    }
    for(int i=0;i<m;i++){
        int c=0;
        for(int j=0;j<n;j++) c+= grid[j][i] == 'I';
        I[i] = c;
    }
    int cnt=0;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(grid[i][j] == 'J'){
                cnt+= I[j] * o[i];
            }
            o[i]-=grid[i][j] == 'O';
            I[j]-=grid[i][j] == 'I';
        }
    }
    cout<<cnt<<endl;
    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 3 ms 716 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 3 ms 716 KB Output is correct
19 Correct 2 ms 716 KB Output is correct
20 Correct 2 ms 716 KB Output is correct
21 Correct 3 ms 844 KB Output is correct
22 Correct 2 ms 716 KB Output is correct
23 Correct 2 ms 716 KB Output is correct
24 Correct 3 ms 844 KB Output is correct
25 Correct 2 ms 716 KB Output is correct
26 Correct 2 ms 716 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 3 ms 716 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 3 ms 716 KB Output is correct
19 Correct 2 ms 716 KB Output is correct
20 Correct 2 ms 716 KB Output is correct
21 Correct 3 ms 844 KB Output is correct
22 Correct 2 ms 716 KB Output is correct
23 Correct 2 ms 716 KB Output is correct
24 Correct 3 ms 844 KB Output is correct
25 Correct 2 ms 716 KB Output is correct
26 Correct 2 ms 716 KB Output is correct
27 Correct 127 ms 17848 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 5 ms 1612 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 78 ms 13180 KB Output is correct
32 Correct 104 ms 18756 KB Output is correct
33 Correct 96 ms 18836 KB Output is correct
34 Correct 100 ms 15220 KB Output is correct
35 Correct 102 ms 18784 KB Output is correct
36 Correct 99 ms 18892 KB Output is correct
37 Correct 136 ms 18952 KB Output is correct
38 Correct 58 ms 13004 KB Output is correct
39 Correct 60 ms 13012 KB Output is correct