USACO · 1301

Watching Mooloo

This C++ solution uses simulation for USACO 1301 Watching Mooloo. Read the reasoning, inspect the code, or try your own test case below.

1301SQL & databasesSimulationC++21 lines
Solution235of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Simulation

Watching Mooloo matches the viewing days and the sum of min(day gap, K+1) subscription costs.

SQL & databases

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

watching_mooloo.cpp

C++

    #include <bits/stdc++.h>
     
    using namespace std;
     
    int main(){
        ios:: sync_with_stdio(0);
        cin.tie(0);
        int n, k;
        cin >> n >> k;
        vector<long long> vec(n);
        for(int i = 0; i < n; i++){
            cin >> vec[i];
        }
        long long ans = k + 1; // for the first day
        for(int i = 1; i < n; i++){
            long long gap = vec[i] - vec[i - 1];
            ans += min(gap, (long long) k + 1);
        }
        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.