OJ Board

I tried MaxFlow (Ford Fulkerson). Got TLE in contest. Is yours Ford Fulkerson? How long does it run?

"THE UPDATE PROFILE AND RETRIEVE PASSWORD DOESN'T WORK YET. BE PATIENT !!!"

I need to update my profile on the online judge but it is unavailable for a long time. Why is it taking so long a time to fix it? How long will it take more?

It would have been great if the algorithm could be detected, but I guess this is not possible.

Could it be specified in the problem statement that STL code would not make the time limit for the particular problem? Because I have also had times when I have coded with STL and got TLE. If I could ...

It is too bad if one can't use advanced programming constructs and object orientation. STL is standard and it promotes the concept of reusable software components.

sometimes i wonder whether my c++ code with STL will make the time limit. how does the problem setters set the time limit? do they make sure that if the algorithm is correct, any implementation (e.g., STL, object oriented) are accepted?

(sorry if this topic has been discussed before. it's hard to ...

thanks. i sweat it out to find the pattern. surprised to see so simple recurrence. i got AC with precalculation as you said. i don't know how to solve the recurrence. then i could solve it in constant time.

i am ashamed to see so many people have solved this problem but i coudn't understand how to.

is there any constant time formula? or is it a brute force enumeration? (doesn't seem so).

Thank you. You were right. I was doing an integer division and storing it in a double.

But I wonder how I forgot (or did I ever know it?) that it doesn't automaticallly
convert to the larger type!??!?

ummmm............a bit late reply heh heh.....i was very busy........

my algo is same. checked div by 0. but still WA. can anybody give me some sample critical I/O? another thing....am i supposed to truncate the output or simply round it up? i used int for input and double for calculation.

What's wrong with this? gets WA.......


#include <iostream.h>
#include <stdio.h>
#include <math.h>

void main()
{

int n, m, k, u, v, p, q, r, i;

scanf(" %d %d %d ", &n, &m, &k);
while (n || m || k) {
int g[50][50] = {0};
int temp1[50][50] = {0};
int temp2[50][50] = {0};

for (i ...

what's wrong with this code? gets WA.....



#include <iostream.h>
#include <stdio.h>
#include <math.h>

void main()
{

int n, m, k, u, v, p, q, r, i;

scanf(" %d %d %d ", &n, &m, &k);
while (n || m || k) {
int g[50][50] = {0};
int temp1[50][50] = {0};
int temp2[50][50] = {0};

for (i = 0; i ...

Thank you.
I got AC with your suggestion.
It seems there is no simple way other than simulation.

Can anyone give me any hint on this?
Is there a simple formula?

i have the same algo.

sort w increasing
sort i decreasing
find lcs of these two

but i get wa! is this algo wrong?

thank you so much!
I got AC.