oj.uz

Submission #779454

# Submission time Handle Problem Language Result Execution time Memory
779454 2023-07-11T12:39:45 Z borisAngelov Bitaro the Brave (JOI19_ho_t1) C++17
50 / 100
 1000 ms 17352 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxn = 3005;

int n, m;

char table[maxn][maxn];

void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int main()
{
    fastIO();

    cin >> n >> m;

    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= m; ++j)
        {
            cin >> table[i][j];
        }
    }

    long long ans = 0;

    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= m; ++j)
        {
            if (table[i][j] == 'J')
            {
                int cnt1 = 0;

                for (int l = j + 1; l <= m; ++l)
                {
                    if (table[i][l] == 'O')
                    {
                        ++cnt1;
                    }
                }

                int cnt2 = 0;

                for (int k = i + 1; k <= n; ++k)
                {
                    if (table[k][j] == 'I')
                    {
                        ++cnt2;
                    }
                }

                ans += (cnt1 * cnt2);
            }
        }
    }

    cout << ans << endl;

    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 25 ms 1976 KB Output is correct
15 Correct 2 ms 1492 KB Output is correct
16 Correct 14 ms 1224 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 34 ms 1992 KB Output is correct
19 Correct 10 ms 2004 KB Output is correct
20 Correct 39 ms 1876 KB Output is correct
21 Correct 32 ms 2028 KB Output is correct
22 Correct 37 ms 2024 KB Output is correct
23 Correct 39 ms 2004 KB Output is correct
24 Correct 38 ms 2004 KB Output is correct
25 Correct 13 ms 2044 KB Output is correct
26 Correct 39 ms 1972 KB Output is correct

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 25 ms 1976 KB Output is correct
15 Correct 2 ms 1492 KB Output is correct
16 Correct 14 ms 1224 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 34 ms 1992 KB Output is correct
19 Correct 10 ms 2004 KB Output is correct
20 Correct 39 ms 1876 KB Output is correct
21 Correct 32 ms 2028 KB Output is correct
22 Correct 37 ms 2024 KB Output is correct
23 Correct 39 ms 2004 KB Output is correct
24 Correct 38 ms 2004 KB Output is correct
25 Correct 13 ms 2044 KB Output is correct
26 Correct 39 ms 1972 KB Output is correct
27 Execution timed out 1049 ms 17352 KB Time limit exceeded
28 Halted 0 ms 0 KB -