oj.uz

Submission #1099452

# Submission time Handle Problem Language Result Execution time Memory
1099452 2024-10-11T10:09:37 Z mihaihvh Bitaro the Brave (JOI19_ho_t1) C++14
20 / 100
 1000 ms 860 KB 
#include <iostream>
#include <set>
#include <queue>
#include <vector>
#include <cmath>
#include <algorithm>

using namespace std;

char v[501][501];

set<vector<int>> sol;

int main() {
    int n, m, ans = 0;
    cin >> n >> m;
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= m; ++j)
            cin >> v[i][j];

    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            if (v[i][j] == 'J') {
                for (int k = 1; k <= n; ++k) {
                    if (v[k][j] == 'I') {
                        for (int l = 1; l <= m; ++l) {
                            if (v[i][l] == 'O' && i < k && j < l) {
                                ++ans;
                            }
                        }
                    }
                }
            }
        }
    }
    cout << ans;
    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 7 ms 500 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 7 ms 452 KB Output is correct
8 Correct 8 ms 348 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 8 ms 348 KB Output is correct
11 Correct 7 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 6 ms 496 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 7 ms 500 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 7 ms 452 KB Output is correct
8 Correct 8 ms 348 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 8 ms 348 KB Output is correct
11 Correct 7 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 6 ms 496 KB Output is correct
14 Execution timed out 1075 ms 860 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 7 ms 500 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 7 ms 452 KB Output is correct
8 Correct 8 ms 348 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 8 ms 348 KB Output is correct
11 Correct 7 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 6 ms 496 KB Output is correct
14 Execution timed out 1075 ms 860 KB Time limit exceeded
15 Halted 0 ms 0 KB -