제출 #1274218

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1274218		quanduongxuan12	Bitaro the Brave (JOI19_ho_t1)	C++20	100 / 100	192 ms	79796 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;
#define name "bitaro"
#define MAXN 3003
#define pb push_back
#define pf push_front
#define ll long long
#define ii pair<int, int>
#define fs first
#define sc second
#define ill pair<int, ll>
#define lli pair<ll, int>
#define llll pair<ll, ll>
#define all(v) v.begin(),v.end()
#define uni(v) v.erase(unique(all(v)),v.end())
#define bit(n,i) (((n)>>(i))&1)
#define FOR(i,a,b) for (int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for (int i=(a),_b=(b); i>=_b; i--)
#define MASK(i) (1LL<<(i))
const int INF=1e9;
const int MOD=1e9+7;
void add(int &u, int v){
    u+=v;
    if (u>=MOD) u-=MOD;
}
void sub(int &u, int v){
    u-=v;
    if (u<0) u+=MOD;
}
void minimize(int &u, int v){
    u=min(u,v);
}
void maximize(int &u, int v){
    u=max(u,v);
}
long long Rand(long long l, long long r){
    ll tmp=0;
    FOR(i,1,4) tmp=((tmp<<15)^(((1<<15)-1)&rand()));
    return l+tmp%(r-l+1);
}
int n,m;
char a[MAXN][MAXN];
int sum[2][MAXN][MAXN];
int get(int type, int x, int y, int u, int v){
    if (x>u||y>v) return 0;
    return sum[type][u][v]-sum[type][x-1][v]-sum[type][u][y-1]+sum[type][x-1][y-1];
}
int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin>>n>>m;
    FOR(i,1,n) FOR(j,1,m) cin>>a[i][j];
    FOR(i,1,n){
        FOR(j,1,m){
            FOR(k,0,1) sum[k][i][j]=sum[k][i-1][j]+sum[k][i][j-1]-sum[k][i-1][j-1];
            if (a[i][j]=='O') sum[0][i][j]++;
            else if (a[i][j]=='I') sum[1][i][j]++;
        }
    }
    ll res=0;
    FOR(i,1,n){
        FOR(j,1,m) if (a[i][j]=='J'){
            res+=1LL*get(0,i,j,i,m)*get(1,i,j,n,j);
            //cout<<i<<" "<<j<<" "<<res<<"\n";
        }
    }
    cout<<res;
    return 0;
}

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