This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#ifdef NON_SUBMIT
#define TEST(n) (n)
#define tout cerr
#else
#define TEST(n) ((void)0)
#define tout cin
#endif
using namespace std;
vector<string> F;
int N, M, D[3];
bool valid_coord(int x, int y)
{
return 0<=x && x<N && 0<=y && y<M;
}
bool check_V(int x, int y)
{
return x && x+1<N && F[x-1][y]=='R' && F[x][y]=='G' && F[x+1][y]=='W';
}
bool check_H(int x, int y)
{
return y && y+1<M && F[x][y-1]=='R' && F[x][y]=='G' && F[x][y+1]=='W';
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
TEST(freopen("input.txt","r",stdin));
TEST(freopen("output.txt","w",stdout));
TEST(freopen("debug.txt","w",stderr));
int x, y, T[3], ans=0;
cin>>N>>M; F.resize(N);
for(int i=0;i<N;i++) cin>>F[i];
for(int i=0;i<N+M-1;i++) {
int mx=0;
for(int k=0;k<3;k++) D[k]=0;
for(int j=0;j<N;j++) if(valid_coord(x=j,y=i-j)) {
for(int k=0;k<3;k++) T[k]=D[k];
D[0]=max({T[0],T[1],T[2]});
if(check_V(x,y)) D[1]=max(T[0],T[1])+1;
if(check_H(x,y)) D[2]=max(T[0],T[2])+1;
mx=max({D[0],D[1],D[2]});
}
ans+=mx;
}
cout<<ans<<'\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |