Search found 16 matches

by Nemo
Mon Oct 23, 2006 7:21 am
Forum: Volume 111 (11100-11199)
Topic: 11138 - Nuts and Bolts
Replies: 9
Views: 5433

I tried MaxFlow (Ford Fulkerson). Got TLE in contest. Is yours Ford Fulkerson? How long does it run?
by Nemo
Mon Sep 04, 2006 5:34 pm
Forum: Other words
Topic: Will someone ever fix the "update info" link?
Replies: 1
Views: 1786

Will someone ever fix the "update info" link?

"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?
by Nemo
Mon Sep 04, 2006 5:19 pm
Forum: C++
Topic: are the time limits set so that STL code runs within it?
Replies: 12
Views: 4493

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 know ...
by Nemo
Sat Sep 02, 2006 10:52 am
Forum: C++
Topic: are the time limits set so that STL code runs within it?
Replies: 12
Views: 4493

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.
by Nemo
Sat Sep 02, 2006 9:07 am
Forum: C++
Topic: are the time limits set so that STL code runs within it?
Replies: 12
Views: 4493

are the time limits set so that STL code runs within it?

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 fi...
by Nemo
Sat Aug 12, 2006 11:51 pm
Forum: Volume 110 (11000-11099)
Topic: 11069 - A Graph Problem
Replies: 20
Views: 8905

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.
by Nemo
Sat Aug 12, 2006 8:29 pm
Forum: Volume 110 (11000-11099)
Topic: 11069 - A Graph Problem
Replies: 20
Views: 8905

11069 - A Graph Problem

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).
by Nemo
Mon Aug 15, 2005 6:24 pm
Forum: Volume 107 (10700-10799)
Topic: 10794 - The Deadly Olympic Returns!!!
Replies: 14
Views: 12770

Sorry for late reply

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........
by Nemo
Fri Jul 29, 2005 11:01 am
Forum: Volume 107 (10700-10799)
Topic: 10794 - The Deadly Olympic Returns!!!
Replies: 14
Views: 12770

10794

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.
by Nemo
Sun Jun 19, 2005 11:45 am
Forum: Volume 105 (10500-10599)
Topic: 10543 - Traveling Politician
Replies: 25
Views: 7278

10543 - Travelling politician

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 = 0; i < m ; i++) { scan...
by Nemo
Mon Jun 13, 2005 9:02 pm
Forum: Volume 105 (10500-10599)
Topic: 10543 - Traveling Politician
Replies: 25
Views: 7278

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 < m ; i++) { s...
by Nemo
Mon Jun 13, 2005 3:53 pm
Forum: Volume 101 (10100-10199)
Topic: 10182 - Bee Maja
Replies: 9
Views: 3169

Thank you.
I got AC with your suggestion.
It seems there is no simple way other than simulation.
by Nemo
Sun Jun 12, 2005 7:26 pm
Forum: Volume 101 (10100-10199)
Topic: 10182 - Bee Maja
Replies: 9
Views: 3169

10182 - bee maja

Can anyone give me any hint on this?
Is there a simple formula?
by Nemo
Fri Apr 15, 2005 7:08 pm
Forum: Volume 101 (10100-10199)
Topic: 10131 - Is Bigger Smarter?
Replies: 93
Views: 65047

10131

i have the same algo.

sort w increasing
sort i decreasing
find lcs of these two

but i get wa! is this algo wrong?
by Nemo
Thu Apr 14, 2005 5:26 pm
Forum: Volume 101 (10100-10199)
Topic: 10100 - Longest Match
Replies: 95
Views: 21026

yes!

thank you so much!
I got AC.

Go to advanced search