Submission #1099320

#	Time	Username	Problem	Language	Result	Execution time	Memory
1099320		Zflop	Bitaro the Brave (JOI19_ho_t1)	C++14	0 / 100	1 ms	348 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(x) x.begin(),x.end()
#define sor(x) sort(all(x))
#define pi pair<int,int>
#define vi vector<int>


int N,M;
vector<string>A;

void solve() {
    cin >> N >> M;
    A = vector<string>(N);
    for (int i = 0; i < N;++i)
        cin >> A[i];
    int cnt = 0;
    for (int i = 0; i < N;++i)
        for (int j = 0; j < N;++j)
            for (int z = i + 1; z < N;++z)
                for (int y = j + 1; y < N;++y)
                    if (A[i][j] == 'J' && A[z][y] == 'I' && A[i][y] == 'O')
                        ++cnt;

    cout << cnt;
}

int main(){
    solve();
    return 0;
}

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