DMOJ · vmss7wc16c4p3

Restoring Reputation

This C++ solution uses dynamic programming for DMOJ vmss7wc16c4p3 Restoring Reputation. Read the reasoning, inspect the code, or try your own test case below.

vmss7wc16c4p3Dynamic programmingC++26 lines
Solution174of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Dynamic programming

Restoring Reputation matches the weighted edit operations and dynamic-programming output.

Dynamic programming

Problem and code

Useful links.

Written by benbenyaojifen. Try the problem first, then compare your approach with the code.

Open official problem ↗View exact source file ↗
Implementation

Restoring_Reputation.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    using ll = long long;
    using i128 = __int128;
    const int inf = 1e9;
    const ll INF = 1e18; //❄️
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int d, c, r; cin >> d >> c >> r;
        string a, b; cin >> a >> b;
        vector<vector<int>> dp(a.size() + 1, vector<int>(b.size() + 1));
        for (int i = 0; i <= b.size(); i++) {
            dp[0][i] = i * c;
        }
        for (int i = 0; i <= a.size(); i++) {
            dp[i][0] = i * d;
        }
        for (int i = 1; i <= a.size(); i++) {
            for (int j = 1; j <= b.size(); j++) {
                if (a[i - 1] != b[j - 1]) dp[i][j] = min({dp[i - 1][j] + d, dp[i][j - 1] + c, dp[i - 1][j - 1] + r});
                else dp[i][j] = min({dp[i - 1][j] + d, dp[i][j - 1] + c, dp[i - 1][j - 1]});
            }
        }
        cout << dp[a.size()][b.size()] << '\n';
        return 0;
    }
        

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗Keep studying →

Test this problem

Run your code here.

Paste your code, run a test case, compare the output, or trace selected values.

Full trace, comparison & stress testing ↗
StatusReady
Output
No run yet.
Diagnostics
No diagnostics yet.

Each run is isolated and has strict limits. Passing one test does not guarantee the judge will accept the solution.