DMOJ · ccc21s1

CCC 2021 S1 Crazy Fencing

This C++ solution uses simulation for CCC 2021 S1 Crazy Fencing. Read the reasoning, inspect the code, or try your own test case below.

ccc21s1CCC 2021 S1Implementation & simulationSimulationC++22 lines
Solution066of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Simulation

Crazy Fencing provides N+1 heights and N widths and asks for total trapezoid area; the code sums width*(adjacent heights)/2.

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

crazy_fencing.cpp

C++

    #include <bits/stdc++.h>
     
    using namespace std;
     
    int main() {
        int n;
        cin >> n;
        vector<int> w (n + 1);
        for(int i = 0; i < w.size(); i++){
            cin >> w[i];
        }
        vector<int> h(n);
        for(int i = 0; i < h.size(); i++){
            cin >> h[i];
        }
        int index = 0;
        double ans = 0;
        for(int i = 0; i < w.size() - 1; i++){
            ans += h[index] * (w[i] + w[i + 1]) / 2.0;
            index++;
        }
        cout << fixed << setprecision(6) << ans << endl;
        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.