DMOJ · ccc25j5

CCC 2025 J5 Connecting Territories

This C++ solution uses dynamic programming for CCC 2025 J5 Connecting Territories. Read the reasoning, inspect the code, or try your own test case below.

ccc25j5CCC 2025 J5Dynamic programmingC++22 lines
Solution053of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Dynamic programming

Connecting Territories's repeated grid costs and adjacent-column path requirement match the code's row-by-row minimum-cost 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

J_5_Connecting_Territories.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    typedef long long ll;
    const int inf = 1e9;
    const long long INF = 1e17; //❄️
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int r, c, m; cin >> r >> c >> m;
        vector<int> odp(c), dp(c);
        for (int i = 0; i < c; i++) {
            odp[i] = i % m + 1;
        }
        for (int i = 1; i < r; i++) {
            for (int j = 0; j < c; j++) {
                int cur = (c * i + j) % m + 1;
                dp[j] = min({odp[j], odp[max(0, j - 1)], odp[min(c - 1, j + 1)]}) + cur;
            }
            swap(dp, odp);
        }
        cout << *min_element(odp.begin(), odp.end()) << '\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.