oj.uz

Submission #860239

# Submission time Handle Problem Language Result Execution time Memory
860239 2023-10-12T09:36:12 Z StefanSebez Dango Maker (JOI18_dango_maker) C++14
0 / 100
 1 ms 600 KB 
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n,m;cin>>n>>m;
    int a[n+10][m+10];
    memset(a,-1,sizeof(a));
    for(int i=1;i<=n;i++)
	{
		string s;cin>>s;
		for(int j=0;j<m;j++)
		{
			if(s[j]=='R') a[i][j+1]=0;
			if(s[j]=='G') a[i][j+1]=1;
			if(s[j]=='W') a[i][j+1]=2;
		}
	}
	int res=0;
	for(int d=3;d<=n+m-1;d++)
	{
		int i=1,j=d-1,ct=1;
		int dp[n+m+10][3];
		memset(dp,0,sizeof(dp));
		while(i<=n && j>=1)
		{
			if(j>m)
			{
				i++;
				j--;
				continue;
			}
			dp[ct][0]=max(dp[ct-1][0],max(dp[ct-1][1],dp[ct-1][2]));
			dp[ct][1]=dp[ct][2]=0;
			if(a[i][j-1]==0 && a[i][j]==1 && a[i][j+1]==2)
			{
				dp[ct][1]=max(dp[ct-1][0],dp[ct-1][2])+1;
			}
			if(a[i-1][j]==0 && a[i][j]==1 && a[i+1][j]==2)
			{
				dp[ct][2]=max(dp[ct-1][0],dp[ct-1][1])+1;
			}
			i++;
			j--;
			ct++;
		}
		ct--;
		res+=max(dp[ct][0],max(dp[ct][1],dp[ct][2]));
	}
	cout<<res<<endl;
    return 0;
}

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Incorrect 1 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Incorrect 1 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Incorrect 1 ms 348 KB Output isn't correct
9 Halted 0 ms 0 KB -