제출 #543202

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
543202		ahmet34	Bob (COCI14_bob)	C++14	0 / 120	118 ms	21804 KiB

bob

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pii = pair<int, int>;
#define all(x) x.begin(), x.end()

const int INF = 2e9, N = 55, M = 998244353, LOG = 16;
const ll LINF = 1e18;

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int n, m; 
    cin >> n >> m;

    vector<vector<int>> v(n, vector<int>(m));

    for(auto& vi : v) for(int& x: vi) cin >> x;

    vector<vector<ll>> dp(n, vector<ll>(m));
        
    auto isValid = [&] (int x, int y) {
        return x >= 0  && y >= 0 && x < n && y < m;
    };

    ll ans = 0;

    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            dp[i][j] = 1;
            
            bool adj = false;

            if(isValid(i-1, j) and v[i-1][j] == v[i][j]) {
                dp[i][j] += dp[i-1][j];
                adj = true;
            }

            if(isValid(i, j-1) and v[i][j] == v[i][j-1]) {
                dp[i][j] += dp[i][j-1];
                adj = true;
            }

            if(isValid(i-1, j-1) and adj and v[i-1][j-1] == v[i][j])
                dp[i][j] -= dp[i-1][j-1];

            ans += dp[i][j];
            //cout << dp[i][j] << ' ';
        }
        //cout << endl;
    }
    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