URAL 1902. Neo-Venice

Posted 2020-10-28 llguanli

1902. Neo-Venice

Time limit: 1.0 second
Memory limit: 64 MB

Mars was the first planet colonized by humans. After a long terraforming process its appearance has changed completely. From the red desert it has become a blue planet covered by water. There was so much water that some of the cities were built not on land, but on stilts over the water. The most famous one was Neo-Venice. There are canals instead of roads and numerous gondolas instead of cars in this city. All this attracts huge crowds of tourists from the Earth to Neo-Venice. The most popular activities among them are boat excursions. Gondolas are steered by young girls who can not only bring tourists through the canals but also tell themabout the history of the city or sing a song along the way. Due to their love for the water these girls are called undines.

The undine Anna has just received a license to steer a gondola. Tomorrow she will carry tourists on excursion to the St. Peter‘s canal. This canal is narrow, but many popular routes are passing through it, so there are always a lot of gondolas. Anna is afraid that her excitement may lead to a crash with another gondola during the excursion. However, all undines are trained to steer the gondola smoothly and with the same speed, so the only threat comes from gondolas sailing in the opposite direction. Anna knows the schedule of her colleagues and when she herself will enter the canal. Now she wants to know exactly when she will encounter other gondolas, in order to be extra careful around them.

Input

The first line of the input contains integers n, t and s. n is the number of undines who will go through the St. Peter’s canal in the opposite direction (1 ≤ n ≤ 100).t is the time needed for the gondola to sail through the entire length of the canal (1 ≤ t ≤ 100).s is the moment of time at which the Anna‘s gondola will enter the canal (360 ≤ s ≤ 1200). The second line contains integers s₁, …, s_n that define the moments of time at which the gondolas of Anna’s colleagues will appear on the opposite side of the canal.s ? t < s₁ < … < s_n < s + t.

Output

Output n numbers that are the points of time when Anna will meet her colleagues, with absolute or relative error no more than 10^?6. Numbers should be separated with spaces or line feeds.

Sample

input	output
2 60 600 600 630	630.000000 645.000000

Problem Author: Denis Dublennykh
Problem Source: Ural Championship 2012

解析：计算与N条逆向船仅仅相遇的时间。直接计算。

AC代码：

#include <bits/stdc++.h>
using namespace std;

int s[102];

int main(){
    int N, T, S;
    scanf("%d%d%d", &N, &T, &S);
    for(int i=0; i<N; i++) scanf("%d", &s[i]);
    for(int i=0; i<N; i++) printf("%.6lf\n", (double)(S + s[i] + T) / 2);
    return 0;
}