oj.uz

Submission #1115652

# Submission time Handle Problem Language Result Execution time Memory
1115652 2024-11-20T18:06:14 Z staszic_ojuz Dango Maker (JOI18_dango_maker) C++17
13 / 100
 1 ms 336 KB 
#include <iostream>
#include <vector>
using namespace std;
bool odw[3001][3001];
int main()
{
    int64_t n,m;
    cin >> n >> m;
    int64_t wyn=0;
    vector<string> v(n);
    for (int64_t i=0; i<n; i++) cin >> v[i];
    for (int64_t i=0; i<n; i++){
        for (int64_t j=0; j<m; j++){
            //cout << i << ' ' << j << '\n';
            if (v[i][j]=='R' and v[i][min(j+1,m-1)]=='G' and v[i][min(j+2,m-1)]=='W' and !odw[i][j] and !odw[i][min(j+1,n-1)] and !odw[i][min(j+2,m-1)]){
                if (v[i][min(j+1,m-1)]=='G' and v[max(i-1,int64_t(0))][min(j+1,m-1)]=='R' and v[min(i+1,n-1)][min(j+1,m-1)]=='W' and !odw[i][min(j+1,m-1)] and !odw[max(i-1,int64_t(0))][min(j+1,m-1)] and !odw[min(i+1,n-1)][min(j+1,m-1)]){
                    odw[i][j]=odw[i-1][j]=odw[i+1][j]=1;
                    wyn++;
                }
                else{
                    //cout << i << ' ' << j << '\n';
                    odw[i][j]=odw[i][j+1]=odw[i][j+2]=1;
                    wyn++;
                }
            }
            else if (v[i][j]=='G' and v[max(i-1,int64_t(0))][j]=='R' and v[min(i+1,n-1)][j]=='W' and !odw[i][j] and !odw[max(i-1,int64_t(0))][j] and !odw[min(i+1,n-1)][j]){
                //cout << i << ' ' << j << '\n';
                odw[i][j]=odw[i-1][j]=odw[i+1][j]=1;
                wyn++;
            }
        }
    }
    cout << wyn;
    return 0;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 67.0

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