제출 #1312740

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

joi2019_ho_t1

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pb push_back
#define pf push_front
#define in insert
#define all(v) v.begin(),v.end()
const int sz=1000000,INF=1000000000;
using namespace std;
void solve()
{
    ll n,m,ans=0;
    cin>>n>>m;
    vector<vector<char>>grid(n+1,vector<char>(m+1));
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
        {
            cin>>grid[i][j];
        }
    }
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
        {
            for(int k=i+1;k<n;k++)
            {
                for(int l=j+1;l<m;l++)
                {
                    if(grid[i][j]=='J' && grid[i][l]=='O' && grid[k][j]=='I')
                    {
                        ans++;
                    }
                }
            }
        }
    }
    cout<<ans;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    ll t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
}

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