Search found 7 matches

by Kevin
Tue Feb 27, 2007 6:33 pm
Forum: Volume 110 (11000-11099)
Topic: 11019 - Matrix Matcher
Replies: 43
Views: 17901

Thanks guys, I should have seen that.

Looks like I have a few things to speed up other than that.
by Kevin
Tue Feb 27, 2007 5:24 am
Forum: Volume 110 (11000-11099)
Topic: 11019 - Matrix Matcher
Replies: 43
Views: 17901

Internal Compiler Error on judge

For problem 11019:

I get:
g++: Internal compiler error: program as got fatal signal 25
from the judge.

It compiles correctly on my computer. Any ideas?

Thanks,

- Kevin

Edit: Solved, offending line:

Code: Select all


int mh[1024][1024][128] = {0};

by Kevin
Tue Feb 13, 2007 4:36 am
Forum: Volume 104 (10400-10499)
Topic: 10480 - Sabotage
Replies: 8
Views: 5618

Here's some test cases that I came up with. The solutions to these are not necessarily unique. Input: 5 8 1 4 30 1 3 70 5 3 20 4 3 5 4 5 15 5 2 10 3 2 25 2 4 50 5 8 1 4 30 1 3 70 5 3 20 4 3 5 4 5 15 5 2 10 3 2 25 2 4 50 7 8 1 3 1 1 4 2 1 5 2 3 6 2 4 6 1 5 7 1 6 2 2 7 2 2 4 5 1 3 1 1 4 2 3 4 1 3 2 2 ...
by Kevin
Tue Feb 13, 2007 3:18 am
Forum: Volume 104 (10400-10499)
Topic: 10480 - Sabotage
Replies: 8
Views: 5618

10480 - test cases?

Does anyone have any test cases for this problem? It seems like it's just straight forward min-cut.

Code: Select all

Snip
Thanks!
by Kevin
Fri Feb 09, 2007 10:18 am
Forum: ACM ICPC Archive Board
Topic: Protecting Zonk , 2198 from Live Archive
Replies: 1
Views: 2187

by Kevin
Mon Jan 08, 2007 7:21 am
Forum: Volume 3 (300-399)
Topic: 396 - Top Dog
Replies: 5
Views: 2817

I'll agree that this problem is tedious. Can anyone see the problem in my code or provide some test cases? I think I understand how they are doing multiple test cases. This works on sample. #include <cstdio> #include <cstring> #include <string> #include <map> #include <vector> #include <iostream> #i...
by Kevin
Tue Oct 24, 2006 2:17 am
Forum: Volume 111 (11100-11199)
Topic: 11134 - Fabled Rooks
Replies: 12
Views: 5887

First key to this problem is columns and rows are independent.
Second key is within a row or column, the areas a rook can be matched to are contiguous.

Priority Queue + Sweep = O(nlgn)

Go to advanced search