boolean go(double ntime, Box box) {
debug("go");
g(ntime);
for (int i = 0; i < bs.size() - 1; i++)
if (bs.get(i) == box) {
Box nb = box.h1 <= box.h2 ? bs.get(i - 1) : bs.get(i + 1);
if (eq(nb.h, box.h)) {
Box nbox = box.combine(nb);
bs.remove(box);
bs.add(i, nbox);
bs.remove(nb);
} else {
nb.f += box.f;
box.f = 0;
}
return true;
}
return false;
}
void g(double ntime) {
double dt = ntime - time;
time = ntime;
for (Box b : bs) {
b.go(dt);
}
}
E nextEvent() {
Box res = bs.get(0);
double min = res.flowtime();
for (Box b : bs)
if (b.flowtime() < min) {
min = b.flowtime();
res = b;
}
return new F(res, time + min);
}
void run() {
Scanner sc = new Scanner(System.in);
int oo = sc.nextInt();
for (int o = 1; o <= oo; o++) {
que = new PriorityQueue<E>();
int n = sc.nextInt();
tank = new Tank();
count = 0;
int[] h = new int[n + 3], b = new int[n + 3];
h[0] = 100;
b[0] = 0;
h[n + 1] = 50;
b[n + 1] = 100;
h[n + 2] = 50;
b[n + 2] = INF;
for (int i = 1; i <= n; i++) {
b[i] = sc.nextInt();
h[i] = sc.nextInt();
}
n += 3;
for (int i = 1; i < n; i++) {
tank.bs.add(new Box(b[i - 1], b[i], h[i - 1], h[i], 0, 0));
}
int m = sc.nextInt();
for (int i = 0; i < m; i++) {
int f = sc.nextInt();
double a = sc.nextDouble() / 30;
for (Box box : tank.bs) {
if (box.b1 < f && f < box.b2) box.f += a;
}
}
debug(tank.bs);
int l = sc.nextInt();
res = new double[l];
for (int i = 0; i < l; i++) {
que.offer(new W(sc.nextInt(), sc.nextDouble(), i));
}
que.offer(tank.nextEvent());
debug(que.size());
while (!que.isEmpty()) {
if (res[0] < 0) System.exit(1);
que.poll().go();
debug(que.peek().time());
debug(tank.bs);
debug(res);
debug();
if (count == l) break;
}
for (double r : res) {
System.out.println(r);
}
}
}
Box combine(Box b) {
if (b2 != b.b1) return b.combine(this);
return new Box(b1, b.b2, h1, b.h2, f + b.f, h);
}