Submission #492878

#	Time	Username	Problem	Language	Result	Execution time	Memory
492878		Biaz	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	300 ms	151968 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
#define int long long
//#define double long double
#define Nanase_Kurumi_aka_menhera_chan_is_mine ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define pi pair<int, int>
#define ALL(i) i.begin(),i.end()
#define gcd(i,j) __gcd(i,j)
#define fi first
#define se second
#define eps 0.00000001
#define ist insert
#define DNE nullptr
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
//#pragma GCC optimize("O2")
int max(int x,int y){return x>=y?x:y;}
int min(int x,int y){return x>=y?y:x;}
using namespace std;
typedef int ll;
const int N=3005;
const int M=1000005;
const int MOD=1000000007;//998244353;
const int INF=1000000000000000000;//2147483647;

int n,m;
string s[N];
int co[N][N],ci[N][N];
inline void sol(){
    cin >>n>>m;
    for (int i=0;i<n;i++)
        cin >>s[i];
    for (int i=1;i<=n;i++){
        for (int j=1;j<=m;j++){
            if (s[i-1][j-1]=='O')
                co[i][j]++;
            co[i][j]+=co[i][j-1];
        }
    }
    for (int j=1;j<=m;j++){
        for (int i=1;i<=n;i++){
            if (s[i-1][j-1]=='I')
                ci[i][j]++;
            ci[i][j]+=ci[i-1][j];
        }
    }
    int ans=0;
    for (int i=1;i<=n;i++){
        for (int j=1;j<=m;j++)
            if (s[i-1][j-1]=='J')
                ans+=(co[i][m]-co[i][j])*(ci[n][j]-ci[i][j]);
    }
    cout <<ans<<'\n';
}
signed main(){
    Nanase_Kurumi_aka_menhera_chan_is_mine
    int _=1;
    //cin >>_;
    while (_--) sol();
    return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 50 / 50