Search found 29 matches

by mogers
Mon Dec 01, 2014 11:16 pm
Forum: Volume 128 (12800-12899)
Topic: 12879 - Golf Bot
Replies: 2
Views: 1071

Re: 12879 - Golf Bot

There is a O(d log d) solution to this problem. Hint 1: restate the problem having vectors Shot = 1 if there is a shot at distance i, 0 otherwise. Also have a vector Hole as 1 if there is a hole at distance i Hint 2: see how we can multiply polynomials very quickly using FFT Spoiler: see judges solu...
by mogers
Sat Nov 29, 2014 8:05 pm
Forum: Volume 128 (12800-12899)
Topic: 12879 - Golf Bot
Replies: 2
Views: 1071

Time limit on 12879 - Golf Bot is too high

Hi all, I was one of the judges of SWERC 2014. The problem set was just added to the archive. The sample java solution to 12879 - Golf Bot gets accepted in 1.5s, so having a limit of 15s is too high. I suspect that some optimized brute force approaches can get accepted this way. So, I suggest this l...
by mogers
Mon Feb 01, 2010 3:26 am
Forum: Algorithms
Topic: Circular String Linearization
Replies: 12
Views: 13069

Re: Circular String Linearization

mf wrote:I've put my old ACM ICPC notebook online here.
But the codes there have a lot less comments, though.
The link doesn't seem to work anymore. Could you please share it again? Or send me by e-mail to mr_mogers@sapo.pt

Thank you
by mogers
Tue Nov 04, 2008 12:37 pm
Forum: Bugs and suggestions
Topic: Can't see other users statistics
Replies: 2
Views: 2802

Can't see other users statistics

Hi

Why can't i see other users statistics? This feature stopped working. Now i get a message "You are not authorised to view this resource. "

Thanks
by mogers
Fri Oct 31, 2008 4:36 pm
Forum: General
Topic: New Judge (icpcres baylor) problems
Replies: 3
Views: 3962

Re: New Judge (icpcres baylor) problems

The design is nice to me. But the problem is that the site is really slow :cry:

Is there any problem or are you trying to improve this?
by mogers
Sun Jul 13, 2008 6:19 pm
Forum: Bugs and suggestions
Topic: NEW JUDGE'S STATUS
Replies: 20
Views: 18509

Re: NEW JUDGE'S STATUS

Hi

Navigating on the judge (look for problems, stats, etc) is very slow comparing to the old one. Any reasons for this? I'm starting to use other judges because of this :-?

edit: well now the judge is pretty fast :) i hope it continues that way :)
by mogers
Sat Jun 28, 2008 12:32 pm
Forum: Volume 7 (700-799)
Topic: 796 - Critical Links
Replies: 54
Views: 22558

Re: 796 - Critical Links

7 0 (3) 1 2 4 1 (3) 0 2 3 2 (3) 1 0 3 3 (4) 0 1 2 4 4 (3) 3 6 5 5 (1) 4 6 (1) 4 Is this input correct? Vertex 3 has connection to 0 but 0 doesn't have connection to 3. Same with 0 and 3. Links are bidirectional, so i supposed that the link would appear on the adjacency list of both vertices. 3 crit...
by mogers
Thu May 31, 2007 5:43 pm
Forum: Bugs and suggestions
Topic: 871 - Counting Cells in a blob
Replies: 1
Views: 2572

871 - Counting Cells in a blob

Consider a two-dimensional grid of cells, each of which may be empty or filled. The filled cells that are connected form a blob. Two cells are said to be connected if they are adjacent to each other horizontally, vertically or diagonally. There may be several blobs on the grid. Your job is to find ...
by mogers
Fri May 04, 2007 6:46 pm
Forum: Algorithms
Topic: SWERC 2006 - The Right Tip
Replies: 3
Views: 2692

it's been a long time since i wrote the post

i don't know if the test data was weak at swerc. in fact, at swerc i didn't use a greedy algorithm. I was confused
sorry,
by mogers
Fri May 04, 2007 6:42 pm
Forum: Algorithms
Topic: maximum weight matching- polynomial-time algorithm?
Replies: 2
Views: 2171

maximum weight matching- polynomial-time algorithm?

Hi all

I'm working in the Chinese Postman problem and I need a polynomial time algorithm to find the maximum weight matching in a generic graph (actually a complete graph with even number of nodes).

can anyone give me some info about the algorithm ?
by mogers
Wed Apr 11, 2007 12:13 am
Forum: Algorithms
Topic: SWERC 2006 - The Right Tip
Replies: 3
Views: 2692

SWERC 2006 - The Right Tip

hi all

The Right Tip at NuevoPortal

i'm quite frustrated with this problem. I solved this problem in swerc 2006 (as contestant) but now i tried to solve it at 'nuevoportal' and i get WA.

This problem is easy, shouldn't be enough a greedy algorithm ?
I can't figure why i'm having WA[/url]
by mogers
Wed Apr 04, 2007 10:21 pm
Forum: Volume 106 (10600-10699)
Topic: 10608 - Friends
Replies: 75
Views: 26795

well, probably you have already solved it. it has been over a month from your post : x

your problem is simple:
you should initialize max = 0 for every input ;)
by mogers
Sun Dec 24, 2006 2:23 am
Forum: Bugs and suggestions
Topic: 423 - MPI Maelstrom : Judge's Input weakness
Replies: 3
Views: 2840

Test cases sent :)

I think that you won't need them all. I tried to explain the problem with my wrong_but_AC solution in the e-mail.

keep the good work :wink:
by mogers
Sat Dec 23, 2006 1:38 pm
Forum: Bugs and suggestions
Topic: 483 - Word Scramble PE issue
Replies: 6
Views: 2988

But I understand that there are almost 2000 problems in the OJ. But this is the first problem I have found which is not ended by a newline. So, it should be described in the problem statement or the output file should be fixed. And I think the second idea is better. I think that there are more 1 or...
by mogers
Sat Dec 23, 2006 3:04 am
Forum: Bugs and suggestions
Topic: 483 - Word Scramble PE issue
Replies: 6
Views: 2988

the judge's output doesn't end with newline. I mean, you should only print a newline if there is a newline in the input. if this isn't your problem, I can try to help, i got AC. By the way, I think that the problems should tell if the last output ends with newline, or don't. But I understand that th...

Go to advanced search