International Irregularities
시간 제한3초메모리 제한1024 MB
감염도 순으로 정렬된 국가들과 격리 비용이 주어질 때, 각 출발지와 도착지 사이의 최단 이동 시간을 구한다.
문제
Long, long ago on a planet far, far away, a highly contagious virus caused an enduring pandemic.
Even so, the people wanted to travel between countries for their summer holidays. In the good old before-days, travelling from any country to any other country took 1 full day. However, during the pandemic, certain countries preferred not to receive travellers from areas that had higher infection rates, so they made them quarantine for a certain number of days before allowing them to continue their trip or start their holiday.
To keep everything fair, an independent Bureau for Accurate Pandemic Classification was founded. They assigned a -value to each country based on the infection rate in that country. A higher -value indicates higher infection rate.
Each country asked tourists to quarantine if the country they just came from had a -value significantly higher than their own. In particular, when you wanted to travel from country to country , you would have to quarantine for days if .
Archaeologists have found evidence of tourists travelling between countries. For each tourist, the start and destination are known. The question that remains to be answered is: how long was each tourist's minimal travel time?
입력
The input consists of:
- One line with three integers , , and (, , ), the number of countries, the number of tourists, and the maximum allowed difference between two -values when travelling to a country with a lower infection rate.
- One line with integers (), the -value for each country.
- One line with integers ( for all ), the required quarantine time in days when travelling to a country with a significantly lower -value.
- lines, each with two integers and (, ), indicating a tourist departing from country with final destination .
출력
For each tourist, output their minimal travel time in days between their departure country and destination country, in the order in which they appear in the input.