Submission #108783

#	Time	Username	Problem	Language	Result	Execution time	Memory
108783		thebes	Dango Maker (JOI18_dango_maker)	C++14	13 / 100	3 ms	428 KiB

dango_maker

#include <bits/stdc++.h>
using namespace std;

const int MN = 3005;
int a[MN][MN], n, m, i, j, ans;

int main(){
    for(scanf("%d%d",&n,&m),i=1;i<=n;i++){
        for(getchar(),j=1;j<=m;j++){
            char ch = getchar();
            if(ch=='G') a[i][j]=1;
            else if(ch=='W') a[i][j]=2;
        }
    }
    for(i=1;i<=n;i++){
        for(j=1;j<=m;j++){
            if(j+2<=m){
                if(a[i][j]==0&&a[i][j+1]==1&&a[i][j+2]==2){
                    ans++;
                    a[i][j]=a[i][j+1]=a[i][j+2]=-1;
                }
            }
            if(i+2<=n){
                if(a[i][j]==0&&a[i+1][j]==1&&a[i+2][j]==2){
                    ans++;
                    a[i][j]=a[i+1][j]=a[i+2][j]=-1;
                }
            }
        }
    }
    int tmp = ans; ans = 0;
    for(j=1;j<=m;j++){
        for(i=1;i<=n;i++){
            if(i+2<=n){
                if(a[i][j]==0&&a[i+1][j]==1&&a[i+2][j]==2){
                    ans++;
                    a[i][j]=a[i+1][j]=a[i+2][j]=-1;
                }
            }
            if(j+2<=m){
                if(a[i][j]==0&&a[i][j+1]==1&&a[i][j+2]==2){
                    ans++;
                    a[i][j]=a[i][j+1]=a[i][j+2]=-1;
                }
            }
        }
    }
    printf("%d\n",max(ans,tmp));
    return 0;
}

Compilation message (stderr)

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:8:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(scanf("%d%d",&n,&m),i=1;i<=n;i++){
         ~~~~~~~~~~~~~~~~~~~^~~~

• Subtask 1: 13 / 13
• Subtask 2: 0 / 20
• Subtask 3: 0 / 67