OJ Board

To mf:
how to code using bitmask dp? i googled but found
nothing. can you tell me how it is done or give me
any link from where i can learn it?


To observer:
can you give some hint on the Dijkstra method of
solving this problem?


Thanks.

my dfs (backtracking) solution is getting TLE
what heuristics may i add to cut the run time?

The problem 563-CrimeWave is a maximum
flow problem. The funny thing is i've AC
for this problem although i think my solution
is wrong in the way it implements ford-fulkerson
algorithm!!!

Since vertices also have capacities in this
problem, i had the usual idea of splitting
the vertices ...

my code above shows long data type for number of paths
but i've tried long long also, but WA nevertheless!!!

i am getting WA, i've tried to figure out what is
going wrong, but failed. can someone test some tricky
cases for which my code produces wrong answer?
thanks



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

void main()
{
int i, j, k, n, w, h;
char a[110][110];
long b[110][110];

while ( scanf( "%d ...

i'm very confused getting WA

can anybody post some critical i/o

my logic is as follows in brief:


gets( r );

for ( i = s = 0; r; ++i )
{
s = s * 10 + r - 48;
s = s % 11;
}

if ( !s ) then multiple

Thanks in advance for replying

i'm really confused with the problem description,
could someone please tell me is the following
set of input valid? if not why?

BC
CA
CB
#

my commonsense tell me the ordering should be
ABC but accepted code for this problem ( one of
my friend's ) gives output BCA !!!!!!!

why is this happening?

you are forgetting that the minimum allowed
sub-rectangle is 1 x 1.
for input

2
-1 -2
-3 -4

your code outputs 0
but it should be -1
hope this is the only mistake

this ridiculously easy problem gave me wrong answer for a
week. so, had to look for threads to find what's wrong. what
i've found is really "STUPID :evil: "

i got AC when i used the condition if v ( river's velocity ) == 0
output " can't determine " !!!!!!!!!!!!!!!!!!

could someone who has used ...