Submission #473051

#	Time	Username	Problem	Language	Result	Execution time	Memory
473051		Blobo2_Blobo2	Bitaro the Brave (JOI19_ho_t1)	C++14	100 / 100	136 ms	18952 KiB

joi2019_ho_t1

/*
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 / 20
• Subtask 2: 30 / 30
• Subtask 3: 50 / 50