Submission #492844

#	Time	Username	Problem	Language	Result	Execution time	Memory
492844		Karabasan	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	385 ms	81536 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
#define ll long long
#define fast1 ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,avx")
#pragma GCC optimize("unroll-loops")

int n,m;
char dizi[3005][3005];
vector<pair<int,int> > v;
int dp[3005][3005];
void solve()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
        {
            cin>>dizi[i][j];
            if(dizi[i][j]=='J')
                v.push_back({i,j});
        }
    for(int i=1;i<=n;i++)
    {
        int o=0;
        for(int j=m;j>=1;j--)
        {
            if(dizi[i][j]=='O')
                o++;
            else if(dizi[i][j]=='J')
                dp[i][j]=o;
        }
    }
    for(int i=1;i<=m;i++)
    {
        int o=0;
        for(int j=n;j>=1;j--)
        {
            if(dizi[j][i]=='I')
                o++;
            else if(dizi[j][i]=='J')
                dp[j][i]*=o;
        }
    }
    ll cvp=0;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
        cvp+=dp[i][j];
    cout<<cvp;
}
signed main()
{
    fast1
    //freopen ("lca.gir","r",stdin);
    //freopen ("lca.cik","w",stdout);
    int t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}

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