Submission #28068822

---

Source Code Expand

#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,k,n) for (int i = (k); i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
// using P = pair<ll,ll>;

// const ll INF = (ll)1e18;
// const int INF = (int)1e9+7;
const ll MOD = 998244353;
template<typename T>
void chmin(T &a, T b) { a = min(a, b); }
template<typename T>
void chmax(T &a, T b) { a = max(a, b); }

void solve() {
    ll H, W, K;
    cin >> H >> W >> K;
    ll x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;

    vector<vector<vector<ll>>> dp(K+1, vector<vector<ll>>(2, vector<ll>(2, 0)));
    dp[0][x1==x2][y1==y2] = 1;

    rep(i,K) {
        dp[i+1][0][0] = (W-1)*dp[i][0][1] + (H-1)*dp[i][1][0] + (H+W-4)*dp[i][0][0];
        dp[i+1][0][0] %= MOD;

        dp[i+1][0][1] = dp[i][0][0] + (H-2)*dp[i][0][1] + (H-1)*dp[i][1][1];
        dp[i+1][0][1] %= MOD;

        dp[i+1][1][0] = dp[i][0][0] + (W-2)*dp[i][1][0] + (W-1)*dp[i][1][1];
        dp[i+1][1][0] %= MOD;

        dp[i+1][1][1] = dp[i][0][1] + dp[i][1][0];
        dp[i+1][1][1] %= MOD;
    }

    cout << dp[K][1][1] << endl;
}

int main() {
    solve();
    return 0;
}

Submission Info

Judge Result