제출 #316156

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
316156		FlashGamezzz	Bob (COCI14_bob)	C++17	0 / 120	161 ms	18808 KiB

bob

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <string>

using namespace std;

int n, m, grid[1001][1001] = {}, nl[1001][1001] = {};
long long dp[1001][1001];
int main() {
	ios_base::sync_with_stdio(false);
	cin >> n >> m;
	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= m; j++){
			cin >> grid[i][j];
			nl[i][j] = 1;
			if (grid[i][j] == grid[i][j-1]){
				nl[i][j] += nl[i][j-1];
			}
		}
	}
	for (int i = 1; i <= n; i++){
		dp[i][1] = 1;
		if (grid[i-1][1] == grid[i][1]){
			dp[i][1] += dp[i-1][1];
		}
	}
	for (int c = 2; c <= m; c++){
		for (int r = 1; r <= n; r++){
			dp[r][c] = nl[r][c];
			if (grid[r][c] == grid[r-1][c]){
				dp[r][c] += dp[r-1][c];
				if (nl[r][c] < nl[r-1][c]){
					dp[r][c] -= dp[r-1][c-nl[r][c]];
				}
			}
		}
	}
	long long ans = 0;
	for (int i = 0; i <= n; i++){
		for (int j = 0; j <= m; j++){
			ans += dp[i][j];
		}
	}
	cout << ans << endl;
}

• 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