제출 #235750

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
235750		Autoratch	Dango Maker (JOI18_dango_maker)	C++14	13 / 100	5 ms	568 KiB

dango_maker

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

const int N = 3002;

int m,n,ans;
string c[N];
bool visited[N][N],val[N][N][2];

void solve(int x,int y)
{
    int hor = 0,ver = 0;
    for(int i = x,j = y;i>=1 and j>=1 and i<=m and j<=n;i++,j--)
    {
        if(i!=x)
        {
            if(c[i][j]!='G') break;
            if(!((val[i][j][1] and val[i-1][j+1][0])or(val[i][j][0] and val[i-1][j+1][1]))) break;
        }
        visited[i][j] = true;
        if(val[i][j][0]) ver++;
        if(val[i][j][1]) hor++;
    }
    for(int i = x-1,j = y+1;i>=1 and j>=1 and i<=m and j<=n;i--,j++)
    {
        if(c[i][j]!='G') break;
        if(!((val[i][j][1] and val[i+1][j-1][0])or(val[i][j][0] and val[i+1][j-1][1]))) break;
        visited[i][j] = true;
        if(val[i][j][0]) ver++;
        if(val[i][j][1]) hor++;
    }
    ans+=max(hor,ver);
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> m >> n;
    for(int i = 1;i <= m;i++) cin >> c[i],c[i] = " "+c[i];
    for(int i = 1;i <= m;i++) for(int j = 1;j <= n;j++) 
    {
        if(c[i-1][j]=='R' and c[i][j]=='G' and c[i+1][j]=='W') val[i][j][0] = true;
        if(c[i][j-1]=='R' and c[i][j]=='G' and c[i][j+1]=='W') val[i][j][1] = true;
    }
    for(int i = 1;i <= m;i++) for(int j = 1;j <= n;j++) if(!visited[i][j] and c[i][j]=='G') solve(i,j);
    cout << ans;
}

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