OJ Board

Change the data type from long to long long and you will get AC

This is due to large values of sides whose sum wont fit in 32 bit signed integer.

Just add a dummy gets after you take the number of cases as input and remove the fflush().

This should get your code AC

The two statements describe two different situations without conflicting with each other. the person can take rest any time after he completed one rest session This means, after taking a rest for 8 hours, he can decide to take another one for 8 hours. One can rest exactly 8 hours This means, he has ...

I didn't look into your code thoroughly, but check to see if you are handling "sleeping inside danger zone" properly.

Your understanding of left of S to left of D is correct. That description was there to remove ambiguity of border regions between jungle and plain lands. It was implied that, you are strictly located on one land and one hour later, you will be located in the next, having no concern about the interme...

Mukit, your approach is correct, but it is not clear what you were trying to do after finding the all pair shortest path.

The actual answer is MAX(dist[root]+dist[dest] ) for all i.

Hope this helps.

The condition for invalid is wrong.

it should be T[0]+T[1] <= T[2].

You can not declare array like this. num must be a constant, or you need to allocate memory dynamically by using malloc().

The code will however compile if you specify C++ as the language.

hmm, it is interesting to see how this thread has changed from its original message to a discussion about this "Abdul" guy.

add the following line: the function max is defined there, although your compiler might have it declared as default.

Before solving this problem, you need to know how to solve problem 108. Assuming you have solved it, there are two possibilites for the maximum sum. One is the simple case when the maximum occurs without any wrapping. The other case is when, there is wrapping. In the second case, change the sign of ...

What do you mean restricted functin.
I submitted your code and got WA.

red means solved within the last 48 hours
green means solved within 7 days
bule means within a month

Actually, I meant it grows without bound. That means, it grows to such an extent that, it occupies more memory than allowed by UVA Judge.

The problem lies in the function solve().
The res vector grows beyond capacity.