DMOJ · dmopc22c5p2

Absolutely Even

This C++ solution uses simulation for DMOJ dmopc22c5p2 Absolutely Even. Read the reasoning, inspect the code, or try your own test case below.

dmopc22c5p2Arrays & prefix sumsSimulationC++25 lines
Solution008of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Simulation

Absolutely Even and output construction match the code's array construction for balancing negative- and nonnegative-sum subarrays.

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

absolutely_even.cpp

C++

    #include <bits/stdc++.h>
     
    using namespace std;
     
    int main(){
        ios::sync_with_stdio(0);
        cin.tie(0);
        int n;
        cin >> n;
        vector<int> v(n, 1);
        long long neg = 1LL * n * (n + 1) / 4;
        for(int i = 0; i < n; i++){
            if(neg >= n - i){
                v[i] = -(n - i);
                neg -= (n - i);
            } else {
                v[i] = -neg;
                break;
            }
        }
        for(int i = 0; i < v.size(); i++){
            cout << v[i] << (i == v.size() - 1 ? "\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.