oj.uz

Submission #899307

# Submission time Handle Problem Language Result Execution time Memory
899307 2024-01-05T17:25:45 Z aykhn Bitaro the Brave (JOI19_ho_t1) C++17
0 / 100
 1 ms 7260 KB 
#include <bits/stdc++.h>
 
// author: aykhn
 
using namespace std;
typedef long long ll;
 
#define all(v) v.begin(), v.end()
#define pii pair<int, int>
#define mpr make_pair
#define eb emplace_back
#define pb push_back
#define ts to_string
#define fi first
#define se second
#define ins insert
#define int ll
#define inf 0x3F3F3F3F
#define infll 0x3F3F3F3F3F3F3F3FLL
#define bpc __builtin_popcount
 
const int MXN = 3e3 + 5;

char mat[MXN][MXN];
int pr[MXN][MXN];
int pc[MXN][MXN];
 
signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr);
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            cin >> mat[i][j];
            if (mat[i][j] == 'O') pr[i][j] = 1;
            else if (mat[i][j] == 'I') pc[i][j] = 1;
            pr[i][j] += pr[i][j - 1];
            pc[i][j] += pc[i - 1][j];
        }
    }
    int res = 0;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            if (mat[i][j] != 'J') continue;
            res += (pr[i][m] - pr[i][j]) * (pc[n][j] - pc[i][j]);
        }
    }
    cout << res << '\n';
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 3420 KB Output is correct
6 Correct 1 ms 7260 KB Output is correct
7 Incorrect 1 ms 5212 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 3420 KB Output is correct
6 Correct 1 ms 7260 KB Output is correct
7 Incorrect 1 ms 5212 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 3420 KB Output is correct
6 Correct 1 ms 7260 KB Output is correct
7 Incorrect 1 ms 5212 KB Output isn't correct
8 Halted 0 ms 0 KB -