DMOJ · dmopc18c4p2

Dr. Henri and Responsibility

This C++ solution uses subset-sum dynamic programming for DMOJ dmopc18c4p2 Dr. Henri and Responsibility. Read the reasoning, inspect the code, or try your own test case below.

dmopc18c4p2Dynamic programmingSubset-sum dynamic programmingC++35 lines
Solution081of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Subset-sum dynamic programming

Dr. Henri and Responsibility asks to partition task durations between two days minimizing the absolute sum difference; the code performs subset-sum DP.

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

P_2_Dr_Henri_and_Responsibility.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 n; cin >> n;
        vector<int> v(n);
        int sum = 0;
        for (int i = 0; i < n; i++) {
            cin >> v[i];
            sum += v[i];
        }
        int half = sum / 2;
        vector<bool> dp(half + 1);
        dp[0] = 1;
        for (int x : v) {
            for (int i = half; i >= x; i--) {
                if (dp[i - x]) {
                    dp[i] = 1;
                }
            }
        }
        int ans = 0;
        for (int i = dp.size() - 1; i >= 0; i--) {
            if (dp[i]) {
                ans = sum - i * 2LL;
                break;
            }
        }
        cout << ans << '\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.