WA SEACO, sept long challenge

general
, ,
1

I’m following an approach similar to that in the editorial still I get the verdict as WA, might be some bug in the code, will someone please help me with this.

My code: https://www.codechef.com/viewsolution/15321761

2

Well, i don’t know much about c++

So your code appears like greek to me. But anyway, i have explained my approach using difference array.

Following link to my explanation

Above link contain the link to my code (java).

Feel free to ask anything

3

You are suffering from overflow.

I generated a test case of format

Input
1
5 5000
1 1 5
1 1 2
1 1 3
2 1 4
2 1 5
.
.
.
2 1 5000
Your Output
947572220 947572220 -34951858 -17475929 -17475929

The negative numbers arent expected as modulo means we are expecting a positive number.

4

I’m taking the mod each time I perform an arithmetic operation, am I missing something here? thanks.

5

vijju, how do you generate numbers?

6

I cant say what you are missing dear. You need to see it on your own, but you are failing on large numbers.

@kunnu120 - We write a program to generate test cases. Lot of work O_O :smiley:

1 Like
7

(ʘ_ʘ)

8

OMG KUNNU HOW DID YOU MAKE THAT?!! I want to know it for…purposes :3

9

https://www.thetoptens.com/keyboard-faces/

copy paste lol, but you can make it with your keyboard too like

(O_O)

1 Like
10

(╯°□°)╯︵

__

11

It worked after changing ( x - y) % mod to ( x + ( mod -y) ) %mod

12

It worked after I changed the operation ( a - b) mod -> ( a + (mod - b) ) mod

13

You were not paying attention to fact that “modulo” in problem statement means the modulo which is “always positive”

14

@randaam_oozham

Wanna know the reason how this works…??

Well, the number (a-b) must be less than 0, which causes the solution to fail…

Changing that to (a + (mod-b))%mod ensures that value never goes negative…

Another alternative would have been, to add a line after

x = (a-b)%mod

if(x<0)x+=mod

Please UPVOTE and Accept if you find this helpful…