|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|2 초||512 MB||0||0||0||0.000%|
Roland has been given a mission of dangerous material transfer by Train King. The material is stored in the station A and subject to being transferred to the station B. He will bring it by direct trains between A and B, one (or zero) unit per ride.
Your task is to write a program to find out the most optimal way of his bringing. Your program will receive the timetable of trains on the mission day and should report how many units of material can be transferred at the end. Be aware that there can be trains which can go to the past time or the same time which train leaved the station.
Each train consists of one or more cars. Roland is disallowed to ride the same car of the same train multiple times. This restriction avoids time paradox. He is still allowed to get on a different car, though. You can assume he can change trains instantly.
The first line contains two integers NAB and NBA (0 ≤ NAB, 0 ≤ NBA and NAB + NBA ≤ 50). NAB denotes the number of trains from A to B; NBA denotes the number from B to A.
The next NAB lines describe the information about trains from A to B. Each line gives the information of one train with three integers Ci, Di and Ai (1 ≤ Ci ≤ 10, 0 ≤ Di, Ai < 86400) : the number of cars, the departure time, and the arrival time.
The next NBA lines describe the information about trains from B to A. The information is given in the same format.
Print the maximum amount, in units, of dangerous material that can be transferred.
1 1 10 100 0 10 100 0
5 5 10 0 100 10 200 300 10 400 500 10 600 700 10 800 900 10 100 200 10 300 400 10 500 600 10 700 800 10 900 1000