Codeforces · 2195D

Absolute Cinema

This C++ solution uses simulation for Codeforces 2195D Absolute Cinema. Read the reasoning, inspect the code, or try your own test case below.

2195DArrays & prefix sumsSimulationC++42 lines
Solution007of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Simulation

Absolute Cinema defines f(x) as a sum of weighted absolute distances and asks to recover the hidden array; the code uses endpoint sums and second differences.

Arrays & prefix sums

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

D_Absolute_Cinema.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    using ll = long long;
    const int inf = 1e9;
    const long long INF = 1e17; //❄️]
    void solve() {
        int n; cin >> n;
        vector<ll> v(n + 1);
        for (int i = 1; i <= n; i++) cin >> v[i];
        vector<ll> ans(n + 1);
        if (n == 2) {
            ans[1] = v[2];
            ans[2] = v[1];
            cout << ans[1] << " " << ans[2] << '\n';
            return;
        }
        for (int i = 2; i <= n - 1; i++) {
            ll val = v[i + 1] - 2LL * v[i] + v[i - 1];
            ans[i] = val / 2;
        }
        ll mid1 = 0;
        for (int i = 2; i <= n - 1; i++) {
            mid1 += ans[i] * (i - 1LL);
        }
        ans[n] = (v[1] - mid1) / (n - 1LL);
        ll midn = 0;
        for (int i = 2; i <= n - 1; i++) {
            midn += ans[i] * (n - i * 1LL);
        }
        ans[1] = (v[n] - midn) / (n - 1LL);
        for (int i = 1; i <= n; i++) {
            cout << ans[i] << " \n"[i == n];
        }
    }
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int t; cin >> t;
        while (t--) {
            solve();
        }
        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.