同和创作矩阵 › ›博文归档› 技术博文归档 › 查看内容

22639_Gangsters

2022-5-16 18:22| 发布者: Hocassian| 查看: 23| 评论: 0|原作者: 肇庆学院ACM合集

摘要:

C:\Users\Administrator\Downloads\2019-10-12-10-14-5-89506810984900-Problem List-采集的数据-后羿采集器.html

Pro.ID

22639

Title

Gangsters

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=22639

AC

Submit

Ratio

时间&空间限制

Time Limit: 1200/400 MS (Java/Others) Memory Limit: 20000/10000 K (Java/Others)

描述

N gangsters are going to a restaurant. The i-th gangster comes at the time T_i and has the prosperity P_i. The door of the restaurant has K+1 states of openness expressed by the integers in the range [0, K]. The state of openness can change by one in one unit of time; i.e. it either opens by one, closes by one or remains the same. At the initial moment of time the door is closed (state 0). The i-th gangster enters the restaurant only if the door is opened specially for him, i.e. when the state of openness coincides with his stoutness S_i. If at the moment of time when the gangster comes to the restaurant the state of openness is not equal to his stoutness, then the gangster goes away and never returns.
The restaurant works in the interval of time [0, T].
The goal is to gather the gangsters with the maximal total prosperity in the restaurant by opening and closing the door appropriately.

输入

The first line of the input file contains the values N, K, and T, separated by spaces. ( 1 <= N <= 100 , 1 <= K <= 100 , 0 <= T <= 30000 )
The second line of the input file contains the moments of time when gangsters come to the restaurant T₁, T₂, ..., T_N, separated by spaces. ( 0 <= T_i <= T for i = 1, 2, ..., N )
The third line of the input file contains the values of the prosperity of gangsters P₁, P₂, ..., P_N, separated by spaces. ( 0 <= P_i <= 300 for i = 1, 2, ..., N )
The forth line of the input file contains the values of the stoutness of gangsters S₁, S₂, ..., S_N, separated by spaces. ( 1 <= S_i <= K for i = 1, 2, ..., N )

All values in the input file are integers.

输出

Description

Input

The first line of the input file contains the values N, K, and T, separated by spaces. ( 1 <= N <= 100 , 1 <= K <= 100 , 0 <= T <= 30000 )
The second line of the input file contains the moments of time when gangsters come to the restaurant T₁, T₂, ..., T_N, separated by spaces. ( 0 <= T_i <= T for i = 1, 2, ..., N )
The third line of the input file contains the values of the prosperity of gangsters P₁, P₂, ..., P_N, separated by spaces. ( 0 <= P_i <= 300 for i = 1, 2, ..., N )
The forth line of the input file contains the values of the stoutness of gangsters S₁, S₂, ..., S_N, separated by spaces. ( 1 <= S_i <= K for i = 1, 2, ..., N )

All values in the input file are integers.

Output

Print to the output file the single integer -- the maximal sum of prosperity of gangsters in the restaurant. In case when no gangster can enter the restaurant the output should be 0.

Sample Input