Search found 98 matches

by jpfarias
Mon Apr 21, 2003 4:03 am
Forum: Volume 100 (10000-10099)
Topic: 10060 - A hole to catch a man
Replies: 22
Views: 6104

10060 It's frustating

Man, I thought I've got this problem, but it appears that something is wrong...

My approach to solve this problem was summing up all the volumes of the pieces and then dividing by the volume of the man hole. What's wrong?

Thanks, JP!
by jpfarias
Mon Apr 14, 2003 1:37 am
Forum: Volume 1 (100-199)
Topic: 149 - Forests
Replies: 37
Views: 4386

If you submit the number of the problem I'll read it...


JP
by jpfarias
Mon Apr 14, 2003 1:36 am
Forum: Volume 1 (100-199)
Topic: 182 - Bonus Bonds
Replies: 10
Views: 1770

Problem 182

Can anyone explain me what I have to do in this problem?

I've read it and didn't understand nothing!

JP
by jpfarias
Mon Nov 04, 2002 9:06 pm
Forum: Volume 7 (700-799)
Topic: 790 - Head Judge Headache
Replies: 49
Views: 14592

Hi!

I've found the bug in my solution! I forget the return in my function wich inserts a wrong submisson in the list... I just don't know why I've made it to be sorted if I go on throght all the list.

Thanks a lot!

Jo
by jpfarias
Mon Nov 04, 2002 5:11 am
Forum: Volume 100 (10000-10099)
Topic: 10029 - Edit Step Ladders
Replies: 70
Views: 20797

Hi, can u send me your code, so I can see what's wrong with my solution?

Or may I send u my code and u see what's wrong for me?

Any help will be good for me!

Thanks!

Jo
by jpfarias
Mon Nov 04, 2002 5:09 am
Forum: Volume 7 (700-799)
Topic: 790 - Head Judge Headache
Replies: 49
Views: 14592

Hi!

I've sent my code to you via Private Message!

Thanks a lot!
Jo
by jpfarias
Sun Nov 03, 2002 3:53 pm
Forum: Volume 100 (10000-10099)
Topic: 10004 - Bicoloring
Replies: 93
Views: 29246

Hi! The general solution for this problem looks like this: 1. Start at any point and colour it with color 1; 2. Colour all it's neighbour with color 2; 3. For each uncolored point: 4. Colour it with color 1; 5. If any of it's neighbour is colored with color 1 then 6. Colour it with colour 2 7. If an...
by jpfarias
Sun Nov 03, 2002 3:44 pm
Forum: Volume 7 (700-799)
Topic: 790 - Head Judge Headache
Replies: 49
Views: 14592

Hi! My solution give the right output for yours input. here is my compare function: [cpp] int comp(const void *c1, const void *c2) { Team *t1 = (Team *)c1; Team *t2 = (Team *)c2; if (t1->num_solved != t2->num_solved) { return t2->num_solved - t1->num_solved; } if (t1->time != t2->time) { return t1->...
by jpfarias
Thu Oct 31, 2002 8:11 pm
Forum: Volume 7 (700-799)
Topic: 790 - Head Judge Headache
Replies: 49
Views: 14592

Hi! My solution is also getting WA and I've checked all 4 conditions mentioned. So, is there any other condition? If a team has submitted, but solved no problems, it should appear before the other who did not submitted? Do I increase the rank of teams with no submissions or they receive the same ran...
by jpfarias
Wed Oct 30, 2002 12:12 am
Forum: Volume 100 (10000-10099)
Topic: 10029 - Edit Step Ladders
Replies: 70
Views: 20797

Did you get AC on this problem?
Or do u know the time limit is now 10 seconds?

So, if these methods I've described can run under 10 secs, then I will redo my implementation, may be I've missed something...

Thanx in advance!

Jo
by jpfarias
Tue Oct 29, 2002 1:17 am
Forum: Volume 100 (10000-10099)
Topic: 10029 - Edit Step Ladders
Replies: 70
Views: 20797

10029 - Edit Step Ladders

What is a good approach to solve this problem? I've thought of two, but each got TLE... At the first one, I had done the LIS algorithm, checking everytime if a word is a edit step of another. In the second attemp I generate all the possible edit steps for each word read and did a binary search on th...
by jpfarias
Sun Oct 13, 2002 7:45 pm
Forum: Volume 3 (300-399)
Topic: 361 - Cops and Robbers
Replies: 50
Views: 14379

Point in Polygon

Hi! Here I am again... I yet cannont solve this problem. I think the problem is with my algorithm wich finds if a point is inside a polygon. I'm using the winding count, but I think I've implemented it wrong. Can anyone point me with an implementation of any good algorithm to find if a point is insi...
by jpfarias
Sun Oct 13, 2002 2:41 am
Forum: Volume 3 (300-399)
Topic: 336 - A Node Too Far
Replies: 121
Views: 39681

Just solved it...

The problem was when I cannot reach some node from another...

Thanx anyway!!
by jpfarias
Sat Oct 12, 2002 9:01 pm
Forum: Volume 3 (300-399)
Topic: 361 - Cops and Robbers
Replies: 50
Views: 14379

Colinear cops...

if there are n >= 3 cops and all n cops are colinear, can a citizen be safe?

JP
jpfarias@lcc.ufrn.br
by jpfarias
Sat Oct 12, 2002 8:57 pm
Forum: Volume 3 (300-399)
Topic: 336 - A Node Too Far
Replies: 121
Views: 39681

336

Can anyone tell me why my solution got WA? Test cases wich it fail will of great help! [cpp] /* A Node Too Far */ #include <stdio.h> int grafo[30][30]; int dist[30][30]; int rotulo[30]; int max; int get_rotulo(int k) { for (int i=0;;++i) { if (rotulo == k) { return i; } else if (rotulo < 0) { rotulo...

Go to advanced search