USACO · 1541

Photoshoot

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

1541Implementation & simulationSimulationC++26 lines
Solution162of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Simulation

Photoshoot updates cow beauty values and asks for the maximum K-by-K sum; the O(QK^2) affected-window updates match.

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

C++

    #include <bits/stdc++.h>
    using namespace std;
    using ll = long long;
    const int inf = 1e9;
    const long long INF = 1e17; //❄️
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int n, k, q; cin >> n >> k >> q;
        vector<vector<int>> g(n, vector<int>(n)), pre(n, vector<int>(n));
        int ans = 0;
        while (q--) {
            int r, c, v; cin >> r >> c >> v;
            r--; c--;
            int add = v - pre[r][c];
            pre[r][c] = v;
            for (int i = max(0, r - k + 1); i <= min(r, n - k); i++) {
                for (int j = max(0, c - k + 1); j <= min(c, n - k); j++) {
                    g[i][j] += add;
                    ans = max(ans, g[i][j]);
     
                }
            }
            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.