Submission #996439

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
996439	2024-06-10T15:29:24 Z	yanb	Bitaro the Brave (JOI19_ho_t1)	C++14	0 / 100	0 ms	604 KB

joi2019_ho_t1

#include <bits/stdc++.h>
    
using namespace std;
    
#define int long long
#define pii pair<long long, long long>
#define t3i tuple<long long, long long, long long>

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int n, m;
    cin >> n >> m;
    vector<vector<char>> a(n, vector<char>(m));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> a[i][j];
        }
    }

    vector<vector<int>> os(n, vector<int>(m + 1)), is(n + 1, vector<int>(m));
    for (int i = 0; i < n; i++) {
        for (int j = m - 1; j >= 0; j--) {
            os[i][j] = os[i][j + 1] + (a[i][j] == 'O');
        }
    }
    for (int j = 0; j < m; j++) {
        for (int i = n - 1; i >= 0; i--) {
            is[i][j] = is[i + 1][j] + (a[i][j] == 'I');
        }
    }

    int ans = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (a[i][j] == 'J') {
                ans += os[i][j] * is[i][j];
            }
        }
    }

    cout << ans << "\n";
}   

Subtask #1

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	600 KB	Output is correct
6	Correct	0 ms	604 KB	Output is correct
7	Incorrect	0 ms	604 KB	Output isn't correct
8	Halted	0 ms	0 KB	-

Subtask #2

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	600 KB	Output is correct
6	Correct	0 ms	604 KB	Output is correct
7	Incorrect	0 ms	604 KB	Output isn't correct
8	Halted	0 ms	0 KB	-

Subtask #3

0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	600 KB	Output is correct
6	Correct	0 ms	604 KB	Output is correct
7	Incorrect	0 ms	604 KB	Output isn't correct
8	Halted	0 ms	0 KB	-