Search found 145 matches

by Julien Cornebise
Wed Feb 11, 2004 9:38 pm
Forum: Volume 101 (10100-10199)
Topic: 10189 - Minesweeper
Replies: 418
Views: 66014

Read above about my mind concerning PE :wink:
by Julien Cornebise
Wed Jan 07, 2004 9:29 pm
Forum: Other words
Topic: Why Do You Keep Changing Problem Specifications?
Replies: 10
Views: 3234

- Increase input size, by repeating the same test input several times. Then, the best algorithm is the one who reads and prints faster. Rapid IO is not easy. But ACM ICPC isn't a coding contest, is it ? It's entitled "Programming" contest, but isn't the algorithmic part the most important one ? One...
by Julien Cornebise
Wed Jan 07, 2004 8:47 pm
Forum: Other words
Topic: Why Do You Keep Changing Problem Specifications?
Replies: 10
Views: 3234

Re: 623

PS: I'll try to make a poll in the fixing mistakes section about that. Hi Carlos Your arguments are indeed also good. A poll would be really useful, I think. I've got to confess that it's very very very frustrating to have 2 problems out of 142 ACs suddenly turning to WA or TLE or RTE in 2 days... ...
by Julien Cornebise
Wed Jan 07, 2004 1:50 pm
Forum: Other words
Topic: Why Do You Keep Changing Problem Specifications?
Replies: 10
Views: 3234

How about proportionnaly disminishing the time limit ?

I agree that changing occasionaly specs to avoid new brute-force solutions can be useful. Nevertheless, it appears to happen more and more often ! Wich is particularly annoying. Wouldn't it be more fair to disminish the time limit for the problems wich could now be solved by brute-force in the actua...
by Julien Cornebise
Thu Jan 01, 2004 7:23 pm
Forum: Off topic (General chit-chat)
Topic: How often do you use the board?
Replies: 3
Views: 2143

Interesting poll, Shamin ! Though there is a risk that people taking time to vote are mostly those visting the forum at least once a day. People only interested in the answers to their precise problem might not even see this topic ... :-? Interesting question of correctly choosing the sample populat...
by Julien Cornebise
Thu Jan 01, 2004 7:20 pm
Forum: Off topic (General chit-chat)
Topic: Happy New Year :-)
Replies: 11
Views: 4954

Happy new year everybody !!
Bonne ann
by Julien Cornebise
Tue Dec 30, 2003 12:47 pm
Forum: Volume 2 (200-299)
Topic: 243 - Theseus and the Minotaur (II)
Replies: 22
Views: 7314

junbin wrote: __EDIT__

Just added in the case about them meeting up after M sees a candle and I got accepted. Thanks for your help. :)
You're welcome ! Great ! Congratulations :) This seing-a-candle case is indeed the most trickiest in this problem (imho).
by Julien Cornebise
Tue Dec 30, 2003 12:44 pm
Forum: Volume 2 (200-299)
Topic: 243 - Theseus and the Minotaur (II)
Replies: 22
Views: 7314

junbin wrote:(...) internet was cranky. :p

Thank you for your quick response.. gonna go work on the question now.. wish me luck. :)
Lol :lol: Good luck then, both with 243 and with... your internet conection ! :wink:
by Julien Cornebise
Mon Dec 29, 2003 7:55 pm
Forum: Volume 2 (200-299)
Topic: 243 - Theseus and the Minotaur (II)
Replies: 22
Views: 7314

Hi (And by the way, that would'nt hurt that you say "hi" too, or "thanks", or things like that. A little bit less efficient, maybe, but really more agreable to read and to answer to.) Case 1: Yes, T dies, but the graph is undirected, so passage A to B is exactly the same that B to A Case 2: Yes Case...
by Julien Cornebise
Mon Dec 29, 2003 10:42 am
Forum: Volume 2 (200-299)
Topic: 243 - Theseus and the Minotaur (II)
Replies: 22
Views: 7314

Hi (and merry christmas by the way) ! 1)(...)Does this mean that Theseus will ALWAYS take the LAST path 1. Yes, it means precisely that. Also, is it correct to say that if the Minotaur was previously in the cave Theseus is in, he will always light a candle, but WILL NOT mark the exit he takes (the o...
by Julien Cornebise
Mon Dec 29, 2003 10:27 am
Forum: Volume 100 (10000-10099)
Topic: 10054 - The Necklace
Replies: 62
Views: 30973

Hi Deneb I had much troubles with this part, and that's what makes my code so ugly and so slow :oops: The algorithm is as follows : /* I don't mention global variables used to mark the cycles and to store the eulerian cycle */ /* direct_cycle is the direct cycle you're processing */ construct_euleri...
by Julien Cornebise
Sun Nov 16, 2003 10:09 pm
Forum: Volume 5 (500-599)
Topic: 529 - Addition Chains
Replies: 32
Views: 3969

Thank you

I'll try this as soon as I'll have recuperated from SWERC (it was today, and I'm a bit dead)...

Thank you :-)
by Julien Cornebise
Fri Nov 14, 2003 2:49 pm
Forum: Volume 5 (500-599)
Topic: 529 - Addition Chains
Replies: 32
Views: 3969

Hi

After a whole night trying to find the heuristic mentionned above, I'm ashamed to confess that I don't see it :oops: :(
Could you please give me a hint ? I'm stuck and it's prettily annoying me ... :/
Thanks !
by Julien Cornebise
Thu Nov 13, 2003 7:40 pm
Forum: Volume 5 (500-599)
Topic: 529 - Addition Chains
Replies: 32
Views: 3969

Hi, I think what you're saying is iterative deepening search instead, where you increase the limit by a constant value (eg 1) after every search to go deeper. IDA* is slightly different. Instead of adding 1, you use a heuristic to guess how much to increase by. This heuristic should not overestimat...
by Julien Cornebise
Thu Nov 13, 2003 11:57 am
Forum: Volume 5 (500-599)
Topic: 529 - Addition Chains
Replies: 32
Views: 3969

Hi I don't understand why you consider your program as wrong... If your program gets AC with your limits, this means that there are not cases longer than 15 in the sample input. So, if you change your constants, it should still work, because it will find the answer with length 15 before having to tr...

Go to advanced search