oj.uz

Submission #668786

# Submission time Handle Problem Language Result Execution time Memory
668786 2022-12-05T01:17:35 Z Darren0724 Dango Maker (JOI18_dango_maker) C++17
0 / 100
 1 ms 316 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(),x.end()
#define x first
#define y second
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n,m;cin>>n>>m;
    vector<vector<char>> v(n,vector<char>(m));
    vector<vector<bool>> vis(n,vector<bool>(m));
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            cin>>v[i][j];
        }
    }
    int ans=0;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(v[i][j]!='R'){
                continue;
            }
            if(i>1){
                if(v[i-1][j]=='G'&&v[i-2][j]=='W'&&vis[i-1][j]==0&&vis[i-2][j]==0){
                    vis[i][j]=1;
                    vis[i-1][j]=1;
                    vis[i-2][j]=1;
                    ans++;
                    continue;
                }
            }
            if(j>1){
                if(v[i][j-1]=='G'&&v[i][j-2]=='W'&&vis[i][j-1]==0&&vis[i][j-2]==0){
                    vis[i][j]=1;
                    vis[i][j-1]=1;
                    vis[i][j-2]=1;
                    ans++;
                    continue;
                }
            }
            if(j<n-2){
                if(v[i][j+1]=='G'&&v[i][j+2]=='W'&&vis[i][j+1]==0&&vis[i][j+2]==0){
                    vis[i][j]=1;
                    vis[i][j+1]=1;
                    vis[i][j+2]=1;
                    ans++;
                    continue;
                }
            }
            if(i<n-2){
                if(v[i+1][j]=='G'&&v[i+2][j]=='W'&&vis[i+1][j]==0&&vis[i+2][j]==0){
                    vis[i][j]=1;
                    vis[i+1][j]=1;
                    vis[i+2][j]=1;
                    ans++;
                    continue;
                }
            }
        }
    }
    cout<<ans<<endl;

    return 0;
}

Subtask #1
0 / 13.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 67.0

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