OJ Board

I passed sample I/O and the above test data, but still got WA...
can any body help me?

thank you!



#include<stdio.h>
#include<string.h>

int csN, csk, L, K;
char S[10002];

inline bool Equal(char a, char b, char c, char d)
{
return a == b && a == c && a == d;
}

int main()
{
int i, j, t;
char ...

I got same output as yours, Bunau.
And I also have no idea why getting WA.
Can any body help me and give some more I/O?

Thanks!!

I think it's a DP problem,
but I don't know why I got WAs.

Can some body give me some sample input/output?

Thank you very much!!

try these input:

their is a linear algo. to solve this problem..

just think of how many units of wine transport form i to i+1 ...

sample input 1

4 units of wine transport from 2 to 1
1 unit of wine transport from 4 to 1
1 unit of wine transport from 4 to 3
1 unit of wine transport from 4 to 5

4*1 + 1*3 + 1*1 + 1*1 = 9

AC!!

Thank you andresw1 and rushel!!

Your

%p

is a big hint for me!!

Thank you!!

if K = 3 --> 1.2.3 + 1.2.4 + 2.3.4 --> 38

actually, 1.2.3 + 1.2.4 + 1.3.4 + 2.3.4 = 50

you have missed 1.3.4

I got WA during the contest...

I think that a lock can be deactivated if and only if
(p11-s11)%p11 + (p22-s22)%p22 = (p12-s12)%p12 + (p21-s21)%p21

am I right?

If not, what's the correct way to solve this problem?

Thank you very much!!