oj.uz

Submission #708821

# Submission time Handle Problem Language Result Execution time Memory
708821 2023-03-12T11:52:28 Z myrcella Dango Maker (JOI18_dango_maker) C++17
0 / 100
 17 ms 35796 KB 
//by szh
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}

const int maxn = 3010;

int n,m;
int grid[maxn][maxn];
int dp[maxn][maxn][2];

int main() {
//	freopen("input.txt","r",stdin);	
	std::ios::sync_with_stdio(false);cin.tie(0);
	cin>>n>>m;
	memset(grid,-1,sizeof(grid));
	rep(i,1,n+1) {
		string s;cin>>s;
		rep(j,1,m+1) {
			if (s[j-1]=='R') grid[i][j]=0;
			else if (s[j-1]=='G') grid[i][j]=1;
			else grid[i][j]=2;
		}
	}
	int ans = 0;
	rep(i,1,n+1)
		rep(j,1,m+1) {
			if (grid[i][j]==1) {
				dp[i][j][0] = dp[i][j][1] = max(dp[i-1][j+1][1],dp[i-1][j+1][0]);
				if (grid[i-1][j]==0 and grid[i+1][j]==2) dp[i][j][0] = max(dp[i][j][0],dp[i-1][j+1][1] + 1);
				if (grid[i][j-1]==0 and grid[i][j+1]==2) dp[i][j][1] = max(dp[i][j][1],dp[i-1][j+1][0] + 1);
				if (grid[i+1][j-1]!=1) ans += max(dp[i][j][0],dp[i][j][1]);
			}
		}
	cout<<ans;
	return 0;
}

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 35720 KB Output is correct
2 Correct 15 ms 35776 KB Output is correct
3 Correct 15 ms 35668 KB Output is correct
4 Correct 15 ms 35752 KB Output is correct
5 Correct 17 ms 35736 KB Output is correct
6 Correct 15 ms 35796 KB Output is correct
7 Correct 15 ms 35796 KB Output is correct
8 Incorrect 15 ms 35680 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 35720 KB Output is correct
2 Correct 15 ms 35776 KB Output is correct
3 Correct 15 ms 35668 KB Output is correct
4 Correct 15 ms 35752 KB Output is correct
5 Correct 17 ms 35736 KB Output is correct
6 Correct 15 ms 35796 KB Output is correct
7 Correct 15 ms 35796 KB Output is correct
8 Incorrect 15 ms 35680 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 35720 KB Output is correct
2 Correct 15 ms 35776 KB Output is correct
3 Correct 15 ms 35668 KB Output is correct
4 Correct 15 ms 35752 KB Output is correct
5 Correct 17 ms 35736 KB Output is correct
6 Correct 15 ms 35796 KB Output is correct
7 Correct 15 ms 35796 KB Output is correct
8 Incorrect 15 ms 35680 KB Output isn't correct
9 Halted 0 ms 0 KB -