CF1654D.Potion Brewing Class

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Alice's potion making professor gave the following assignment to his students: brew a potion using nn ingredients, such that the proportion of ingredient ii in the final potion is ri>0r_i > 0 (and r1+r2++rn=1r_1 + r_2 + \cdots + r_n = 1 ).

He forgot the recipe, and now all he remembers is a set of n1n-1 facts of the form, "ingredients ii and jj should have a ratio of xx to yy " (i.e., if aia_i and aja_j are the amounts of ingredient ii and jj in the potion respectively, then it must hold ai/aj=x/ya_i/a_j = x/y ), where xx and yy are positive integers. However, it is guaranteed that the set of facts he remembers is sufficient to uniquely determine the original values rir_i .

He decided that he will allow the students to pass the class as long as they submit a potion which satisfies all of the n1n-1 requirements (there may be many such satisfactory potions), and contains a positive integer amount of each ingredient.

Find the minimum total amount of ingredients needed to make a potion which passes the class. As the result can be very large, you should print the answer modulo 998244353998\,244\,353 .

输入格式

The first line contains a single integer tt ( 1t1041 \le t \le 10^4 ) — the number of test cases.

The first line of each test case contains a single integer nn ( 2n21052 \le n \le 2 \cdot 10^5 ).

Each of the next n1n-1 lines contains four integers i,j,x,yi, j, x, y ( 1i,jn1 \le i, j \le n , iji\not=j , 1x,yn1\le x, y \le n ) — ingredients ii and jj should have a ratio of xx to yy . It is guaranteed that the set of facts is sufficient to uniquely determine the original values rir_i .

It is also guaranteed that the sum of nn for all test cases does not exceed 21052 \cdot 10^5 .

输出格式

For each test case, print the minimum total amount of ingredients needed to make a potion which passes the class, modulo 998244353998\,244\,353 .

输入输出样例

  • 输入#1

    3
    4
    3 2 3 4
    1 2 4 3
    1 4 2 4
    8
    5 4 2 3
    6 4 5 4
    1 3 5 2
    6 8 2 1
    3 5 3 4
    3 2 2 5
    6 7 4 3
    17
    8 7 4 16
    9 17 4 5
    5 14 13 12
    11 1 17 14
    6 13 8 9
    2 11 3 11
    4 17 7 2
    17 16 8 6
    15 5 1 14
    16 7 1 10
    12 17 13 10
    11 16 7 2
    10 11 6 4
    13 17 14 6
    3 11 15 8
    15 6 12 8

    输出#1

    69
    359
    573672453

说明/提示

In the first test case, the minimum total amount of ingredients is 6969 . In fact, the amounts of ingredients 1,2,3,41, 2, 3, 4 of a valid potion are 16,12,9,3216, 12, 9, 32 , respectively. The potion is valid because

  • Ingredients 33 and 22 have a ratio of 9:12=3:49 : 12 = 3 : 4 ;
  • Ingredients 11 and 22 have a ratio of 16:12=4:316 : 12 = 4 : 3 ;
  • Ingredients 11 and 44 have a ratio of 16:32=2:416 : 32 = 2 : 4 .

In the second test case, the amounts of ingredients 1,2,3,4,5,6,7,81, 2, 3, 4, 5, 6, 7, 8 in the potion that minimizes the total amount of ingredients are 60,60,24,48,32,60,45,3060, 60, 24, 48, 32, 60, 45, 30 .

首页