oj.uz

Submission #928411

# Submission time Handle Problem Language Result Execution time Memory
928411 2024-02-16T10:47:21 Z Art_ogo Bitaro the Brave (JOI19_ho_t1) C++17
0 / 100
 1 ms 444 KB 
#include <bits/stdc++.h>

#define ll long long
#define fi first
#define se second
#define ve vector
#define all(x) x.begin(), x.end()

using namespace std;

typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

#pragma GCC optimize("O3")

signed main(){
    int n, m;
    cin >> n >> m;
    ve<string> v(n);
    for(auto& i : v)
        cin >> i;
    /* for(auto i : v) */
    /*     cout << i << endl; */
    ve<ve<int> > os(n, ve<int>(m, 0)), is(n, ve<int>(m, 0));
    for(int i = 0; i < n; i++){
        os[i][m - 1] = v[i][m - 1] == 'O';
        for(int j = m - 2; j >= 0; j--)
            os[i][j] = os[i][j + 1] + int(v[i][j] == 'O');
    }
    for(int j = 0; j < m; j++){
        is[n - 1][j] = v[n - 1][j] == 'I';
        for(int i = n - 2; i >= 0; i--)
            is[i][j] = is[i + 1][j] + int(v[i][j] == 'I');
    }
    ll res = 0;
    for(int i = 0; i < n; i++)
        for(int j = 0; j < n; j++)
            if(v[i][j] == 'J')
                res += os[i][j]*is[i][j];
    cout << res;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 444 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Incorrect 1 ms 348 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 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 444 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Incorrect 1 ms 348 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 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 444 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Incorrect 1 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -