제출 #1231043

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1231043		The_Samurai	Chess Rush (CEOI20_chessrush)	C++20	컴파일 에러	0 ms	0 KiB

chessrush

#include "bits/stdc++.h"
using namespace std;
using ll = long long;

constexpr int mod = 1e9+7;
int binpow(int base, int exp, int modulus=mod) {
    base %= modulus;
    int result = 1;
    while (exp > 0) {
        if (exp & 1) result = (1ll*result * base) % modulus;
        base = (1ll*base * base) % modulus;
        exp >>= 1;
    }
    return result;
}


int n, m, q;
vector<vector<int>> merge(const vector<vector<int>> &a, const vector<vector<int>> &b) {
    vector ans(m, vector(m, 0));
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < m; j++) {
            for (int k = 0; k < m; k++) {
                // ans[i][k] += a[i][j] * b[j][k];
                ans[i][k] = (ans[i][k] + ll(a[i][j]) * b[i][j]) % mod;
            }
        }
    }
    return ans;
}

int main() {
    cin >> n >> m >> q;
    int lg = 0;
    while ((1 << lg) <= n) lg++;
    vector dp(lg, vector(m, vector(m, 0)));
    for (int i = 0; i < m; i++) {
        dp[0][i][i] = 1;
        if (i > 0) dp[0][i][i - 1] = 1;
        if (i + 1 < m) dp[0][i][i + 1] = 1;
    }
    for (int i = 1; i < lg; i++) dp[i] = merge(dp[i - 1], dp[i - 1]);
    // for (int i = 0; i < m; i++) {
    //     for (int j = 0; j < m; j++) {
    //         cout << dp[1][i][j] << ' ';
    //     }
    //     cout << endl;
    // }
    vector ans(m, vector(m, 0));
    bool emp = true;
    for (int i = lg - 1; i >= 0; i--) {
        if ((n - 1) >> i & 1) {
            if (emp) ans = dp[i];
            else {
                ans = merge(ans, dp[i]);
            }
            emp = false;
        }
    }

    while (q--) {
        char op;
        int c1, c2;
        cin >> op >> c1 >> c2;
        assert(op == 'K');
        vector shit(n, vector(m, 0));
        shit[0][c1 - 1] = 1;
        for (int i = 1; i < n; i++) {
            for (int j = 0; j < m; j++) {
                shit[i][j] = (shit[i][j] + shit[i - 1][j]) % mod;
                if (j > 0) shit[i][j] = (shit[i][j] + shit[i - 1][j - 1]) % mod;
                if (j + 1 < m) shit[i][j] = (shit[][j] + shit[i - 1][j + 1]) % mod;
            }i
        }
        cout << n - 1 << ' ' << shit[n - 1][c2 - 1] << '\n';
    }
}

컴파일 시 표준 에러 (stderr) 메시지

chessrush.cpp: In function 'int main()':
chessrush.cpp:72:51: error: expected primary-expression before ']' token
   72 |                 if (j + 1 < m) shit[i][j] = (shit[][j] + shit[i - 1][j + 1]) % mod;
      |                                                   ^
chessrush.cpp:73:15: error: expected ';' before '}' token
   73 |             }i
      |               ^
      |               ;
   74 |         }
      |         ~