Accepted solution

1162A-Zoning Restrictions Again

Open original problem
Source code

#include<bits/stdc++.h>

using namespace std;

int main()

{

    int n,h,m;

    cin>>n>>h>>m;

    int Max[55];

    for(int i=0;i<55;i++)

    {

        Max[i]=h;

    }

    for(int i=0; i<m; i++)

    {

        int l,r,x;

        cin>>l>>r>>x;

        for(int j=l; j<=r; j++)

        {

            Max[j] = (double)min(x,Max[j]);

        }

    }

    double sum=0;

    for(int i=1; i<=n; i++)

    {

        double t = Max[i];

        sum += pow(t,2.0);

    }

    cout<<sum<<endl;

    //  cout<<count<<endl;

}
Join the discussion

Add your comment