Search found 163 matches

by Emilio
Wed Mar 29, 2006 12:58 am
Forum: Volume 110 (11000-11099)
Topic: 11019 - Matrix Matcher
Replies: 43
Views: 17716

Hi, I got AC.
I would must have read something about Karp-Rabin before asking anything.
Thanks anyway.

animallan you would must follow the same way than me, if you read something about Karp-Rabin you will understand it without troubles. In this moment I haven't the links, but google ...
Good luck!
by Emilio
Sat Mar 25, 2006 11:00 pm
Forum: Volume 110 (11000-11099)
Topic: 11019 - Matrix Matcher
Replies: 43
Views: 17716

David wrote: This can be computed in O(n*m) by first storing the hash values of all X*1 patterns, and then computing the hash of an X*Y pattern based on the hash of the X*Y pattern just above it, along with the hash of the first line. If your hash function depends of i and j, how do you compute you...
by Emilio
Mon Mar 20, 2006 2:57 pm
Forum: Volume 110 (11000-11099)
Topic: 11019 - Matrix Matcher
Replies: 43
Views: 17716

What happen with this problem? I sent my code about ten minutes ago and it's even being judge. I searched in the submit history and only saw a TLE in this problem, and some problems were sent before mine and they even are being judge with the message: "Statistics not available - Program running". Wh...
by Emilio
Sun Mar 19, 2006 6:40 pm
Forum: Volume 110 (11000-11099)
Topic: 11012 - Cosmic Cabbages
Replies: 29
Views: 8709

No, It is not forbidden to post a complete explanation, but in such case the people use write something like <SPOILER> to warn that the next text will give you a complete method to solve the problem. This is because somepeople only want a hint and then thinking about the problem, they (and sometimes...
by Emilio
Sat Mar 11, 2006 2:10 pm
Forum: Volume 110 (11000-11099)
Topic: 11001 - Necklace
Replies: 38
Views: 16537

Thanks mf!
I would must have read the problem more slowly.
I considered that case like a good case.
by Emilio
Sat Mar 11, 2006 4:27 am
Forum: Volume 110 (11000-11099)
Topic: 11001 - Necklace
Replies: 38
Views: 16537

thanks for your test cases, I have maked some changes and now get correct answer for your test cases but continue getting WA.
Here is my new code (sorry for posting)

Code: Select all

CUT OFF
Where is my mistake please?
btw, I will try figure out how solve this problem without floating point computations
by Emilio
Sat Mar 11, 2006 3:59 am
Forum: Volume 110 (11000-11099)
Topic: 11001 - Necklace
Replies: 38
Views: 16537

Hello there!
I'm getting WA. Could anyone say me why?
Sorry for post my code

Code: Select all

EDITED POST
by Emilio
Mon Mar 06, 2006 11:06 pm
Forum: Volume 110 (11000-11099)
Topic: 11008 - Antimatter Ray Clearcutting
Replies: 81
Views: 36909

For the last case is impossible one shot :wink:
by Emilio
Mon Mar 06, 2006 10:40 pm
Forum: Volume 110 (11000-11099)
Topic: 11008 - Antimatter Ray Clearcutting
Replies: 81
Views: 36909

Yeah! I get the same result too. Sorry but in my prior post there only were 6 test cases, here is the seven test cases: 7 4 4 0 0 0 1 1 0 1 1 9 7 0 0 1 1 0 2 2 0 2 2 3 0 3 1 3 2 3 4 16 16 1 255 2 334 3 43 5 635 6 777 7 866 9 104 10 13 11 15 12 134 14 135 15 1623 17 180 19 204 478 394 89 348 1 0 1 1 ...
by Emilio
Mon Mar 06, 2006 10:24 pm
Forum: Volume 110 (11000-11099)
Topic: 11008 - Antimatter Ray Clearcutting
Replies: 81
Views: 36909

Strange! I get the same result for your 700 test cases and get WA too :roll: Maybe this test cases can clarify something, if anyone give the correct output :lol: 6 4 4 0 0 0 1 1 0 1 1 9 7 0 0 1 1 0 2 2 0 2 2 3 0 3 1 3 2 3 4 16 16 1 255 2 334 3 43 5 635 6 777 7 866 9 104 10 13 11 15 12 134 14 135 15 ...
by Emilio
Tue Feb 07, 2006 8:58 pm
Forum: Volume 106 (10600-10699)
Topic: 10688 - The Poor Giant
Replies: 27
Views: 16214

Hi all!
I think that I don't understand the problem, albuit I understand the four first cases I can't understand the fifth one n=10 k=20 give as result 605.
Can anyone explain me it?
Thanks in advance!
by Emilio
Tue Feb 07, 2006 9:40 am
Forum: Volume 109 (10900-10999)
Topic: 10908 - Largest Square
Replies: 37
Views: 19147

Maybe this test cases can be interesting:

Code: Select all

2
7 10 4
abbbaaaaaa
a bbaaaa a
abbbaaaaaa
aaaaaaaaaa
aaaaaaaaaa
aaccaaaaaa
aaccaaaaaa
1 2
2 4
4 6
5 2
1 1 1
a
7 8
by Emilio
Thu Feb 02, 2006 11:55 am
Forum: Volume 102 (10200-10299)
Topic: 10248 - The Integer All-time Champ
Replies: 11
Views: 7107

Finally I got AC.
A small mistake in my code :x .
Thanks to http://public.carnet.hr/~icanadi/acmcheck/index.php I found easily my mistake!
by Emilio
Tue Jan 31, 2006 7:35 pm
Forum: Other words
Topic: ACMcheck - new helping tool
Replies: 2
Views: 1801

A great idea and a nice work!
Really helpful!
by Emilio
Sun Jan 29, 2006 7:39 pm
Forum: Volume 102 (10200-10299)
Topic: 10248 - The Integer All-time Champ
Replies: 11
Views: 7107

Hello there! I have tried this problem and have got a lot of WAs. I have maked 5 different codes, the main strategy is search a number didn't use even in the list of numbers, this number is linked with other digits to make new numbers haven't used even, and then all these pieces are linked, I only s...

Go to advanced search