All submissions for this problem are available.
Read problems statements in Mandarin Chinese and Russian.
The Wall is a massive wall over 700 feet high and is made of ice, stretching 300 miles across the northern border of the Seven Kingdoms, separating it from the wild lands beyond. Appearing as one of the nine Wonders Made by Man in the book by Lomas Longstrider, the Wall is defended and held by the Sworn Brothers of the Night's Watch, who patrol and guard the castles from the Frostfangs mountain range in the west to the Bay of Seals in the east.
(c) A Wiki of Ice and Fire
Winter is coming. The army of White Walkers is heading to the south. The Wall is the only obstacle, that protects the people of the Seven Kingdoms from the danger.
In this problem we assume, that the Wall can be described as a rectangle R on the Cartesian plane. The corner points of R are (0, 0), (0, H), (W, H) and (W, 0).
In order to reinforce the Wall, the brothers of the Night's Watch have placed a huge simple polygonal chain P made of the purest valyrian steel on the wall. P can be desribed as following:
- P consists of N points, both coordinates of which are integers;
- The points are indexed with integers from 0 to N - 1;
- X-coordinate of i'th point of P equals to Xi;
- Y-coordinate of i'th point of P equals to:
- 0, if i is even;
- H, if i is odd.
Your task is pretty simple: calculate the area of R, which is lying under P.
Let's consider a small example for your better understanding:
Let's define H = 4, W = 6, N = 3, X0 = 0, X1 = 5, X2 = 6.
In this testcase we are interested in caculating the area of the green triangle.
N can be extremely huge in this problem, so it's impossible to give you array X itself. Instead of this, we will provide some additional variables and arrays, with a help of which you will be able to generate array X inside your program.
We will use additional integer variables M, A, B and IND. Also, additional array D, which consists of M integers and is indexed with integers from 0 to M - 1 will be used.
Here's a pseudocode, which generates array X:
X = 0 for i from 1 to N - 1: begin X[i] = X[i - 1] + D[IND] IND = (A * IND + B) % M end
Maybe, some of you aren't familiar with definitions from the statement. Here're some articles that could help you to understand the problem correctly:
- Cartesian plane: http://en.wikipedia.org/wiki/Cartesian_plane
- Polygonal chain: http://en.wikipedia.org/wiki/Polygonal_chain
The first line of the input contains an integer T, denoting the number of testcases. The description of T testcases follows.
The first line of each testcase contains an integer H, denoting the height of R.
The second line contains two integer N and M, denoting the number of points in P and an additional variable.
The third line contains three integers A, B and IND, denoting additional variables.
The fourth line contains M integers, i'th one denotes Di - 1.
Note: W is not provided in the input, but according to the legend it equals to XN - 1.
For each test case the only line of the output should contain the only float: the area of R, which is lying under P.
IMPORTANT: the result should be printed out with exactly one digit after the decimal point. Ignoring of that requirement may lead correct solutions to the WA verdict.
Also, do not add any newlines between different testcases.
- 1 ≤ T ≤ 6, for each input file;
- 1 ≤ H ≤ 100000;
- 0 ≤ A, B, IND < M;
- 1 ≤ Di < 104;
- Subtask 1(34 points): 2 ≤ N ≤ 524288, 1 ≤ M ≤ 524288;
- Subtask 2(33 points): 2 ≤ N ≤ 1000000000, 1 ≤ M ≤ 256;
- Subtask 3(33 points): 2 ≤ N ≤ 1000000000, 1 ≤ M ≤ 524288.
Input: 2 5 2 2 0 1 0 10 10 10 10 5 2 3 4 2 5 1 1 4 Output: 25.0 140.0
|Tags||easy-medium, geometry, kostya_by, ltime15, number-theory|
|Time Limit:||2 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.5, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, PERL6, TEXT, CLOJ, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.