#PU1285. USACO 2023 January Contest, Platinum — Problem 2. Mana Collection
USACO 2023 January Contest, Platinum — Problem 2. Mana Collection
USACO 2023 January Contest, Platinum — Problem 2. Mana Collection
题目描述
Note: The time limit for this problem is 5s, 2.5 times the default. The memory limit for this problem is 512MB, twice the default. Bessie has recently taken an interest in magic and needs to collect mana for a very important spell. Bessie has () mana pools, the th of which accumulates mana per second (). The pools are linked by a collection of () directed edges , meaning that she can travel from to in seconds (, , ). Whenever Bessie is present at a pool, she can collect all the mana stored at that location, emptying it. At time , all mana pools are empty, and Bessie can select any pool to start at. Answer () queries, each specified by two integers and (, ). For each query, determine the maximum amount of mana Bessie can collect in seconds if she must be at mana pool at the end of the th second.
输入格式
First line contains and . Next line contains . Next lines contain . No ordered pair appears more than once in the input. Next line contains . Next lines contain two integers and .
输出格式
lines, one for each query.
数据范围
Inputs 3-4: Inputs 5-9: Inputs 10-14: Inputs 15-17: Inputs 18-20: Inputs 21-24: No additional constraints. Problem credits: Benjamin Qi
样例
样例 1
2 1
1 10
1 2 10
4
5 1
5 2
100 1
100 2
5
50
100
1090
First query: Bessie takes 5 mana from pool 1 after 5 seconds.
Second query: Bessie takes 50 mana from pool 2 after 5 seconds.
Third query: Bessie takes 100 mana from pool 1 after 100 seconds.
Fourth query: Bessie takes 90 mana from pool 1 after 90 seconds and 1000 mana
from pool 2 after 100 seconds.
样例 2
4 8
50000000 100000000 20000000 70000000
1 2 20
2 1 50
2 3 90
1 3 40
3 1 10
4 1 25
1 4 5
4 3 70
3
8 3
1000000000 1
500000 4
160000000
239999988050000000
119992550000000
An example where Bessie is able to collect much larger amounts of mana.