i am getting WA in test 3, probably missing some case that i did not include in my code, but i am unable to find what case i am missing (i am missing brain ofc but what else).
# | User | Rating |
---|---|---|
1 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 163 |
2 | adamant | 163 |
4 | nor | 151 |
4 | maroonrk | 151 |
4 | -is-this-fft- | 151 |
7 | TheScrasse | 148 |
8 | atcoder_official | 146 |
9 | Petr | 145 |
10 | pajenegod | 144 |
i am getting WA in test 3, probably missing some case that i did not include in my code, but i am unable to find what case i am missing (i am missing brain ofc but what else).
Name |
---|
I think you misunderstood the statement, you don't need the number of ways to make $$$c \equiv k \mod 998244353$$$, you need the number of ways to maximize $$$c$$$. Since the number of ways is big (not the maximum value of $$$c$$$), you want that number $$$\mod 998244353$$$.
yeah but like even if i do only (number of way to maximize c) % MOD
like here:
the number of ways to maximize c depends on count1 and count2, so i am doing % MOD to them only. and isn't, the number of ways to make c=k is equal to the number of ways to maximize c? like k is the maximum value right?
Ok, I found a failing testcase:
$$$n = 2$$$
$$$arr_0 = -1, arr_1 = 0$$$
Your code outputs $$$3$$$, but the answer is $$$2$$$.
how is it 2,
like here k is 1;
and we have 3 ways;
1st : c = c+arr0 = -1 , c = |c+arr1| = 1
2nd : c = |c+arr0| = 1 , c = c+arr1 = 1
3rd : c = |c+arr0| = 1 , c = |c+arr1| = 1;
there are 3 unique ways to maximize c
My bad
Auto comment: topic has been updated by butterpaneer (previous revision, new revision, compare).