Codeforces Round 612 (Div. 2)
F
LCC
Codeforces
未评级
原题
← E2→
翻译中…

An infinitely long Line Chillland Collider (LCC) was built in Chillland. There are $n$ pipes with coordinates $x_i$ that are connected to LCC. When the experiment starts at time 0, $i$-th proton flies from the $i$-th pipe with speed $v_i$. It flies to the right with probability $p_i$ and flies to the left with probability $(1 - p_i)$. The duration of the experiment is determined as the time of the first collision of any two protons. In case there is no collision, the duration of the experiment is considered to be zero.

翻译中…

Find the expected value of the duration of the experiment.

翻译中…

imageIllustration for the first example

翻译中…

Input

翻译中…

The first line of input contains one integer $n$ — the number of pipes ($1 \le n \le 10^5$). Each of the following $n$ lines contains three integers $x_i$, $v_i$, $p_i$ — the coordinate of the $i$-th pipe, the speed of the $i$-th proton and the probability that the $i$-th proton flies to the right in percentage points ($-10^9 \le x_i \le 10^9, 1 \le v \le 10^6, 0 \le p_i \le 100$). It is guaranteed that all $x_i$ are distinct and sorted in increasing order.

翻译中…

Output

翻译中…

It's possible to prove that the answer can always be represented as a fraction $P/Q$, where $P$ is an integer and $Q$ is a natural number not divisible by $998\,244\,353$. In this case, print $P \cdot Q^{-1}$ modulo $998\,244\,353$.

翻译中…

样例

Input #1
2
1 1 100
3 1 0
Output #1
1
InputCopy OutputCopy
Input #2
3
7 10 0
9 4 86
14 5 100
Output #2
0
InputCopy OutputCopy
Input #3
4
6 4 50
11 25 50
13 16 50
15 8 50
Output #3
150902884
InputCopy OutputCopy
题目信息
题号
1287F
时间限制
2 s
内存限制
256 MB

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