Submission #383989

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

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second

typedef long long ll;
typedef pair<int,int> ii;

const int N = 3e3;
int n, m;
char a[N+2][N+2];
ll orb[N+2], ingot[N+2];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> a[i][j];
            orb[i] += (a[i][j] == 'O');
            ingot[j] += (a[i][j] == 'I');
        }
    }
    ll ans = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (a[i][j] == 'J') {
                ans += orb[i]*ingot[j];
            }
        }
    }
    cout << ans << '\n';
    return 0;
}

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