DMOJ · utso18p3

Restaurants

This C++ solution uses greedy for DMOJ utso18p3 Restaurants. Read the reasoning, inspect the code, or try your own test case below.

utso18p3GreedyC++42 lines
Solution173of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Greedy

Restaurants matches the ordered locations and the greedy maximum-selection logic.

Greedy

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_3_Restaurants.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    typedef long long ll;
    const int INF = 0x3f3f3f3f; //❄️
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int n, t, k, v; cin >> n >> t >> k >> v;
        vector<bool> pos(n + 1);
        for (int i = 0; i < v; i++) {
            int c; cin >> c;
            pos[c] = 1;
        }
        int ans = 0, cnt = 0;
        for (int i = 1; i <= t; i++) {
            if (pos[i]) cnt++;
        }
        if (cnt < k) {
            for (int i = t; i >= 1; i--) {
                if(pos[i]) continue;
                else pos[i] = 1;
                cnt++;
                ans++;
                if(!(cnt < k)) break;
            }
        }
        for (int i = 2; i <= n; i++) {
            if(i + t - 1 > n) break;
            if(pos[i - 1]) cnt--;
            if(pos[i + t - 1]) cnt++;
            if(cnt < k) {
                for (int j = i + t - 1; j >= i; j--) {
                    if(pos[j]) continue;
                    else pos[j] = 1;
                    cnt++;
                    ans++;
                    if(!(cnt < k)) 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.