Luogu · P1095

P1095 [NOIP 2007 普及组] 守望者的逃离

This C++ solution uses simulation for Luogu P1095 P1095 [NOIP 2007 普及组] 守望者的逃离. Read the reasoning, inspect the code, or try your own test case below.

P1095Implementation & simulationSimulationC++27 lines
Solution152of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Simulation

NOIP 2007 Watcher's Escape energy/time process and success/failure output match the dynamic program.

Implementation & simulation

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_1095_NOIP_2007_普及组_守望者的逃离.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    typedef long long ll;
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int m, s, t; cin >> m >> s >> t;
        int run = 0, jump = 0;
        for (int i  = 1; i <= t; i++) {
            run += 17;
            if(m >= 10) {
                jump += 60;
                m -= 10;
            } else {
                m += 4;
            }
            run = max(run, jump);
            if (run >= s) {
                cout << "Yes" << '\n';
                cout << i << '\n';
                return 0;
            }
        }
        cout << "No" << '\n';
        cout << run << '\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.