Codeforces Round 393 (Div. 2) (8VC Venture Cup 2017 - Final Round Div. 2 Edition)
D
Travel Card
Codeforces
未评级
原题
← CE →
翻译中…

A new innovative ticketing systems for public transport is introduced in Bytesburg. Now there is a single travel card for all transport. To make a trip a passenger scan his card and then he is charged according to the fare.

翻译中…

The fare is constructed in the following manner. There are three types of tickets:

翻译中…
  1. a ticket for one trip costs $20$ byteland rubles,
  2. a ticket for $90$ minutes costs $50$ byteland rubles,
  3. a ticket for one day ($1440$ minutes) costs $120$ byteland rubles.
翻译中…

Note that a ticket for $*x*$ minutes activated at time $*t*$ can be used for trips started in time range from $*t*$ to $*t* + *x* - 1$, inclusive. Assume that all trips take exactly one minute.

翻译中…

To simplify the choice for the passenger, the system automatically chooses the optimal tickets. After each trip starts, the system analyses all the previous trips and the current trip and chooses a set of tickets for these trips with a minimum total cost. Let the minimum total cost of tickets to cover all trips from the first to the current is $*a*$, and the total sum charged before is $*b*$. Then the system charges the passenger the sum $*a* - *b*$.

翻译中…

You have to write a program that, for given trips made by a passenger, calculates the sum the passenger is charged after each trip.

翻译中…

Input

翻译中…

The first line of input contains integer number $*n*$ ($1 ≤ *n* ≤ 10^{5}$) — the number of trips made by passenger.

翻译中…

Each of the following $*n*$ lines contains the time of trip $*t*_{*i*}$ ($0 ≤ *t*_{*i*} ≤ 10^{9}$), measured in minutes from the time of starting the system. All $*t*_{*i*}$ are different, given in ascending order, i. e. $*t*_{*i* + 1} > *t*_{*i*}$ holds for all $1 ≤ *i* < *n*$.

翻译中…

Output

翻译中…

Output $*n*$ integers. For each trip, print the sum the passenger is charged after it.

翻译中…

Note

翻译中…

In the first example, the system works as follows: for the first and second trips it is cheaper to pay for two one-trip tickets, so each time $20$ rubles is charged, after the third trip the system understands that it would be cheaper to buy a ticket for $90$ minutes. This ticket costs $50$ rubles, and the passenger had already paid $40$ rubles, so it is necessary to charge $10$ rubles only.

翻译中…

样例

Input #1
3
10
20
30
Output #1
20
20
10
InputCopy OutputCopy
Input #2
10
13
45
46
60
103
115
126
150
256
516
Output #2
20
20
10
0
20
0
0
20
20
10
InputCopy OutputCopy
题目信息
题号
760D
时间限制
2 s
内存限制
256 MB

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。