제출 #1151455

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1151455		khangrl	Bob (COCI14_bob)	C++20	0 / 120	242 ms	16176 KiB

bob

#include<bits/stdc++.h>
#define ff first
#define ss second
#define int long long
using namespace std;
int n, m, a[1005][1005], dp[1005][1005]={0};
signed main(){
	cin>>n>>m;
	for(int i=1; i<=n; i++){
		for(int j=1; j<=m; j++){
			cin>>a[i][j];
			dp[i][j]=1;
			if(i==1){
				a[0][j]=0;
				dp[0][j]=0;
			}
			if(j==1){
				a[i][0]=0;
				dp[i][0]=0;
			}
		}
	}
	a[0][0]=0;
	dp[0][0]=0;
	int ans=0;
	for(int i=1; i<=n; i++){
		for(int j=1; j<=m; j++){
			if(a[i][j]==a[i-1][j]){
				dp[i][j]+=dp[i-1][j];
				if(a[i][j]==a[i-1][j-1]){
					dp[i][j]-=dp[i-1][j-1];
				}
			}
			if(a[i][j]==a[i][j-1]){
				dp[i][j]+=dp[i][j-1];
				if(a[i][j]==a[i-1][j-1]){
					dp[i][j]-=dp[i-1][j-1];
				}
			}
			if(a[i][j]==a[i-1][j-1] and a[i][j]==a[i-1][j] and a[i][j]==a[i][j-1]){
				dp[i][j]+=dp[i-1][j-1];
			}
			ans+=dp[i][j];
		}
	}
	cout<<ans;
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 12
• Subtask 3: 0 / 12
• Subtask 4: 0 / 12
• Subtask 5: 0 / 12
• Subtask 6: 0 / 12
• Subtask 7: 0 / 12
• Subtask 8: 0 / 12
• Subtask 9: 0 / 12
• Subtask 10: 0 / 12