oj.uz

Submission #898048

# Submission time Handle Problem Language Result Execution time Memory
898048 2024-01-04T09:05:53 Z andrei_iorgulescu Dango Maker (JOI18_dango_maker) C++14
13 / 100
 1 ms 2648 KB 
#include <bits/stdc++.h>

using namespace std;

int n,m;
char a[3005][3005];
bool viz[3005][3005];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            cin >> a[i][j];
    int ans = 0;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m - 2; j++)
        {
            if (a[i][j] == 'R' and a[i][j + 1] == 'G' and a[i][j + 2] == 'W' and !viz[i][j] and !viz[i][j + 1] and !viz[i][j + 2])
            {
                ans++;
                viz[i][j] = true;
                viz[i][j + 1] = true;
                viz[i][j + 2] = true;
            }
        }
    }
    for (int j = 1; j <= m; j++)
    {
        for (int i = 1; i <= n - 2; i++)
        {
            if (a[i][j] == 'R' and a[i + 1][j] == 'G' and a[i + 2][j] == 'W' and !viz[i][j] and !viz[i + 1][j] and !viz[i + 2][j])
            {
                ans++;
                viz[i][j] = true;
                viz[i + 1][j] = true;
                viz[i + 2][j] = true;
            }
        }
    }
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            viz[i][j] = false;
    int ans2 = 0;
    for (int j = 1; j <= m; j++)
    {
        for (int i = 1; i <= n - 2; i++)
        {
            if (a[i][j] == 'R' and a[i + 1][j] == 'G' and a[i + 2][j] == 'W' and !viz[i][j] and !viz[i + 1][j] and !viz[i + 2][j])
            {
                ans2++;
                viz[i][j] = true;
                viz[i + 1][j] = true;
                viz[i + 2][j] = true;
            }
        }
    }
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m - 2; j++)
        {
            if (a[i][j] == 'R' and a[i][j + 1] == 'G' and a[i][j + 2] == 'W' and !viz[i][j] and !viz[i][j + 1] and !viz[i][j + 2])
            {
                ans2++;
                viz[i][j] = true;
                viz[i][j + 1] = true;
                viz[i][j + 2] = true;
            }
        }
    }
    cout << max(ans,ans2);
    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 0 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 0 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2648 KB Output is correct
20 Incorrect 1 ms 2396 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 0 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2648 KB Output is correct
20 Incorrect 1 ms 2396 KB Output isn't correct
21 Halted 0 ms 0 KB -