CF1162A.Zoning Restrictions Again

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

You are planning to build housing on a street. There are nn spots available on the street on which you can build a house. The spots are labeled from 11 to nn from left to right. In each spot, you can build a house with an integer height between 00 and hh .

In each spot, if a house has height aa , you will gain a2a^2 dollars from it.

The city has mm zoning restrictions. The ii -th restriction says that the tallest house from spots lil_i to rir_i (inclusive) must be at most xix_i .

You would like to build houses to maximize your profit. Determine the maximum profit possible.

输入格式

The first line contains three integers nn , hh , and mm ( 1n,h,m501 \leq n,h,m \leq 50 ) — the number of spots, the maximum height, and the number of restrictions.

Each of the next mm lines contains three integers lil_i , rir_i , and xix_i ( 1lirin1 \leq l_i \leq r_i \leq n , 0xih0 \leq x_i \leq h ) — left and right limits (inclusive) of the ii -th restriction and the maximum possible height in that range.

输出格式

Print a single integer, the maximum profit you can make.

输入输出样例

  • 输入#1

    3 3 3
    1 1 1
    2 2 3
    3 3 2
    

    输出#1

    14
    
  • 输入#2

    4 10 2
    2 3 8
    3 4 7
    

    输出#2

    262
    

说明/提示

In the first example, there are 33 houses, the maximum height of a house is 33 , and there are 33 restrictions. The first restriction says the tallest house between 11 and 11 must be at most 11 . The second restriction says the tallest house between 22 and 22 must be at most 33 . The third restriction says the tallest house between 33 and 33 must be at most 22 .

In this case, it is optimal to build houses with heights [1,3,2][1, 3, 2] . This fits within all the restrictions. The total profit in this case is 12+32+22=141^2 + 3^2 + 2^2 = 14 .

In the second example, there are 44 houses, the maximum height of a house is 1010 , and there are 22 restrictions. The first restriction says the tallest house from 22 to 33 must be at most 88 . The second restriction says the tallest house from 33 to 44 must be at most 77 .

In this case, it's optimal to build houses with heights [10,8,7,7][10, 8, 7, 7] . We get a profit of 102+82+72+72=26210^2+8^2+7^2+7^2 = 262 . Note that there are two restrictions on house 33 and both of them must be satisfied. Also, note that even though there isn't any explicit restrictions on house 11 , we must still limit its height to be at most 1010 ( h=10h=10 ).

首页