Infosys Sp Slots are available....✔️💯🎉

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
const ll INF = 1e18;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N, M;
    ll X;
    cin >> N >> M >> X;
    vector<vector<ll>> G(N, vector<ll>(M));
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < M; ++j) {
            cin >> G[i][j];
        }
    }
    ll ans = INF;
    vector<vector<ll>> dp(N, vector<ll>(M, INF));
    for (int i = 0; i < N; ++i) {
        for (int j = 0; j < M; ++j) {
            if (i > 0) {
                dp[i][j] = min(dp[i][j], dp[i-1][j]);
            }
            if (j > 0) {
                dp[i][j] = min(dp[i][j], dp[i][j-1]);
            }
            if (dp[i][j] != INF) {
                ll cost = G[i][j] + X * (i + j) + dp[i][j];
                ans = min(ans, cost);
            }
            dp[i][j] = min(dp[i][j], G[i][j] - X * (i + j));
        }
    }
    dp.assign(N, vector<ll>(M, INF));
    for (int i = 0; i < N; ++i) {
        for (int j = M-1; j >= 0; --j) {
            if (i > 0) {
                dp[i][j] = min(dp[i][j], dp[i-1][j]);
            }
            if (j + 1 < M) {
                dp[i][j] = min(dp[i][j], dp[i][j+1]);
            }
            if (dp[i][j] != INF) {
                ll cost = G[i][j] + X * (i - j) + dp[i][j] + X * 2 * j;
                ans = min(ans, cost);
            }
            dp[i][j] = min(dp[i][j], G[i][j] - X * (i - j));
        }
    }
    cout << ans << "\n";
    return 0;
}

https://t.me/code_alphix/6587

Service Now Help Available....

Infosys Hackwithinfy 💯✅ 10 Am

Slot -1

Slot -2

😬2.9/3 codes are done 🔸

Slot 3& 4

Hackwithinfy 3 pm Slots are available