codeforces 595 D. Max and Bike

D. Max and Bike

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

For months Maxim has been coming to work on his favorite bicycle. And quite recently he decided that he is ready to take part in a cyclists' competitions.

He knows that this year n competitions will take place. During the i-th competition the participant must as quickly as possible complete a ride along a straight line from point si to point fi (si < fi).

Measuring time is a complex process related to usage of a special sensor and a time counter. Think of the front wheel of a bicycle as a circle of radius r. Let's neglect the thickness of a tire, the size of the sensor, and all physical effects. The sensor is placed on the rim of the wheel, that is, on some fixed point on a circle of radius r. After that the counter moves just like the chosen point of the circle, i.e. moves forward and rotates around the center of the circle.

At the beginning each participant can choose any point bi, such that his bike is fully behind the starting line, that is, bi < si - r. After that, he starts the movement, instantly accelerates to his maximum speed and at time tsi, when the coordinate of the sensor is equal to the coordinate of the start, the time counter starts. The cyclist makes a complete ride, moving with his maximum speed and at the moment the sensor's coordinate is equal to the coordinate of the finish (moment of time tfi), the time counter deactivates and records the final time. Thus, the counter records that the participant made a complete ride in time tfi - tsi.

Maxim is good at math and he suspects that the total result doesn't only depend on his maximum speed v, but also on his choice of the initial point bi. Now Maxim is asking you to calculate for each of n competitions the minimum possible time that can be measured by the time counter. The radius of the wheel of his bike is equal to r.

Input

The first line contains three integers n, r and v (1 ≤ n ≤ 100 000, 1 ≤ r, v ≤ 109) — the number of competitions, the radius of the front wheel of Max's bike and his maximum speed, respectively.

Next n lines contain the descriptions of the contests. The i-th line contains two integers si and fi (1 ≤ si < fi ≤ 109) — the coordinate of the start and the coordinate of the finish on the i-th competition.

Output

Print n real numbers, the i-th number should be equal to the minimum possible time measured by the time counter. Your answer will be considered correct if its absolute or relative error will not exceed 10 - 6.

Namely: let's assume that your answer equals a, and the answer of the jury is b. The checker program will consider your answer correct if.

Sample test(s)

input

2 1 2
1 10
5 9

output

3.849644710502
1.106060157705

二分实际距离L，设感应器和水平线夹角为x，则有：
S = L + (r * cos(x) - r * cos(x + 2 * pi * L / 周长))
利用三角函数的和差角公式进行化简，得到类似这样的式子:
S = L + (A + cos(x) + B * sin(x)) (其中A, B是一个常数，这里就不算了)
然后利用公式acosx+bsinx=√(a^2+b^2)sin(x+tanb/a)得到：
S = L + √(A^2 + B^2) * sin(x + 常数)
Max(S) = L + √(A^2 + B^2)，判断这个和总距离的大小即可

/*======================================================
# Author: whai
# Last modified: 2015-11-10 15:20
# Filename: d.cpp
======================================================*/
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <set>
#include <map>

using namespace std;

#define LL __int64
#define PB push_back
#define P pair<int, int>
#define X first
#define Y second

const double PI = acos(-1.0);

double sqr(double x) {
	return x * x;
}

bool ok(double x, double r, double v, double d) {
	double zc = 2 * PI * r;
	double round = x / zc;
	double arfa = round * 2 * PI;
	double A = r - r * cos(arfa);
	double B = r * sin(arfa);
	double maxx = sqrt(sqr(A) + sqr(B));
	return x + maxx > d;
}

void gao(double r, double v, double s, double t) {
	double L = 0, R = t - s;
	int b_cnt = 0;
	while(b_cnt < 50) {
		double mid = (L + R) / 2;
		if(ok(mid, r, v, t - s)) {
			R = mid;
		} else {
			L = mid;
		}
		++b_cnt;
	}
	printf("%.10f\n", L / v);
}

int main() {
	int n;
	double r, v;
	scanf("%d%lf%lf", &n, &r, &v);
	for(int i = 0; i < n; ++i) {
		double s, t;
		scanf("%lf%lf", &s, &t);
		gao(r, v, s, t);
	}
	return 0;
}