oj.uz

Submission #1115673

# Submission time Handle Problem Language Result Execution time Memory
1115673 2024-11-20T18:43:36 Z staszic_ojuz Dango Maker (JOI18_dango_maker) C++17
13 / 100
 1 ms 504 KB 
#include <iostream>
#include <vector>
using namespace std;
int main()
{
    int n,m;
    cin >> n >> m;
    int wyn=0;
    vector<string> v(n+2);
    for (int64_t i=0; i<m+2; i++) v[0]+='#';
    for (int64_t i=1; i<n+1; i++){
        v[i]+='#';
        string akt;
        cin >> akt;
        v[i]+=akt;
        v[i]+='#';
    }
    for (int64_t i=0; i<m+2; i++) v[n+1]+='#';
    //for (auto it:v) cout << it << '\n';
    //cout << '\n';
    for (int i=1; i<n+1; i++){
        for (int j=1; j<m+1; j++){
            //cout << i << ' ' << j << '\n';
            if (v[i][j]=='G' and v[i][j-1]=='R' and v[i][j+1]=='W'){
                if (v[i][j]=='G' and v[i-1][j]=='R' and v[i+1][j]=='W'){
                    v[i][j]=v[i][j+1]=v[i+1][j]='#';
                    wyn++;
                    //cout << i << ' ' << j << '\n';
                }
                else{
                    //cout << i << ' ' << j << '\n';
                    v[i][j]=v[i][j+1]=v[i][j-1]='#';
                    wyn++;
                    //cout << i << ' ' << j << '\n';
                }
            }
            else if (v[i][j]=='G' and v[i-1][j]=='R' and v[i+1][j]=='W'){
                //cout << i << ' ' << j << '\n';
                v[i][j]=v[i-1][j]=v[i+1][j]='#';
                wyn++;
                //cout << i << ' ' << j << '\n';
            }
        }
    }
    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 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 504 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Incorrect 1 ms 336 KB Output isn't correct
23 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 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 504 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Incorrect 1 ms 336 KB Output isn't correct
23 Halted 0 ms 0 KB -