Submission #1336008

#TimeUsernameProblemLanguageResultExecution timeMemory
1336008thaibaotran555Bitaro the Brave (JOI19_ho_t1)C++20
0 / 100
1 ms344 KiB
///TRAN THAI BAO :3

#include <iostream>
#include <cstdio>

using namespace std;

#define maxN 3007

string s[maxN];

int cntO[maxN] = {0}; //ngang
int cntI[maxN] = {0}; //doc

int n, m;

void readData()
{
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
    {
        cin >> s[i];
        s[i] = ' ' + s[i];
        for(int j = 1; j <= m; j++)
            if(s[i][j] == 'O')
                cntO[i]++;
            else if(s[i][j] == 'I')
                cntI[j]++;
    }
}

void solve()
{
    long long ans = 0;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            if(s[i][j] == 'J')
                ans = ans + cntO[i]*cntI[j];
    cout << ans;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    readData();
    solve();
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...