Search found 24 matches

by PdR
Tue Apr 13, 2004 4:27 pm
Forum: Volume 8 (800-899)
Topic: 820 - Internet Bandwidth
Replies: 43
Views: 20515

miras wrote: Network 1
The bandwidth is 32.
How could this be possible at all?
You have two connections between node 1 and 2 with capacities 10 and 20.
The maximum flow is 10+20.
by PdR
Sun Apr 11, 2004 9:32 pm
Forum: Volume 8 (800-899)
Topic: 820 - Internet Bandwidth
Replies: 43
Views: 20515

Re: 820-Internet Bandwidth

There isn't really a trick, but you should attent this detail:
There might be more than one connection between a pair of nodes, but a node cannot be connected to itself.
This Input
2
1 2 2
1 2 10
1 2 20
0
Would obviously result in this Output:
Network 1
The bandwidth is 30.
by PdR
Fri Apr 09, 2004 3:36 pm
Forum: Volume 106 (10600-10699)
Topic: 10633 - Rare Easy Problem
Replies: 37
Views: 18571

With some care no overflow will ever ocur in a 64 bit signed integer.
by PdR
Fri Apr 09, 2004 1:35 am
Forum: Other words
Topic: Judge Stalled?
Replies: 3
Views: 3170

Thanks :wink:
by PdR
Thu Apr 08, 2004 8:14 pm
Forum: Other words
Topic: Judge Stalled?
Replies: 3
Views: 3170

Judge Stalled?

Since the last sucesseful submition (as seen in the status) appears to be made 6+ yours ago and nobody complained, I would like to know if there is a way to continue using the jugde by other means I don't know of (Instead using submit-o-matic)
by PdR
Sun Apr 04, 2004 12:46 am
Forum: Volume 106 (10600-10699)
Topic: 10608 - Friends
Replies: 75
Views: 26427

The input has to have some garbage appended to it:
When I simply ignored (but still reading it) the first number and solved for each n and m in the input I've got WA, when I stopped after say k blocks (being the first integer) on input I got AC.
by PdR
Tue Dec 16, 2003 11:43 pm
Forum: ACM ICPC Archive Board
Topic: Brackets sequence -- 2451
Replies: 0
Views: 593

Brackets sequence -- 2451

I pretty sure my solution is correct (and my timming is adequate)
and I've got TLE after rejudgement.

Why have you increased the the input so much? (more than 10 times more the old one I guess)
by PdR
Sat Dec 13, 2003 7:26 pm
Forum: Other words
Topic: Please stop this rejudgement rate
Replies: 25
Views: 5863

Please stop this rejudgement rate

You are rejudging problems too fast!

Are we suposed to solve new ones, or fixing the old ones forever?
Also improving the test case just because someone has 0.00 seems
just too strange for me.
Please impose some limit, 8 for month should be adequate.
by PdR
Fri Nov 28, 2003 3:04 am
Forum: ACM ICPC Archive Board
Topic: Archive: Problem 2451 (Brackets sequence)
Replies: 0
Views: 576

Archive: Problem 2451 (Brackets sequence)

In order to get AC (PE)
I assumed the maximum number of characters is 1024
and that there could be more than one line per input block i.e.:
3

[(]))
[]())

[()][]()](]
()[][)()(]

()
by PdR
Thu Nov 06, 2003 8:56 pm
Forum: ACM ICPC Archive Board
Topic: What is wrong with 2701?
Replies: 1
Views: 1584

Re: What is wrong with 2701?

Here is my output for 2701. I think it's correct but WA Why??? Maybe the special corrector works improperly? I guess so, because I'm checking with something like: [c]mod = 0; for (i = 0; s != 0; i ++) mod = (mod * 10 + s - '0') % n; assert (mod == 0);[/c] Where s cointains the solution; And I've al...
by PdR
Fri Sep 19, 2003 11:30 am
Forum: Volume 105 (10500-10599)
Topic: 10513 - Bangladesh Sequences
Replies: 15
Views: 8271

Only the last one differs.
It should be

Code: Select all

Case 18: 196608
by PdR
Thu Sep 18, 2003 2:08 am
Forum: Volume 1 (100-199)
Topic: 115 - Climbing Trees
Replies: 30
Views: 11088

By definition p and q are ``cousins'' if and only if they are related (i.e., there is a path from p to q in the implicit undirected parent-child tree). Let r represent the least common ancestor of p and q (i.e., no descendent of r is an ancestor of both p and q ), where p is an m-descendent of r an...
by PdR
Wed Sep 17, 2003 3:34 pm
Forum: Volume 1 (100-199)
Topic: 115 - Climbing Trees
Replies: 30
Views: 11088

My program for this problem is the shortest so far (not counting problem 100). This is very easy and there's a trick that can let you do it in about 15 lines. You may be using 15 lines of code... but you surely are producing wrong output! My accepted solution gives: 2 cousin 1 cousin removed 1 no r...
by PdR
Wed Sep 17, 2003 1:04 pm
Forum: Volume 105 (10500-10599)
Topic: 10513 - Bangladesh Sequences
Replies: 15
Views: 8271

pingus wrote:Only the worst case { 15, ?, ?, ..., ? } take 7s with output:

Code: Select all

437893890380826859 
is at least correct ?
Yes
by PdR
Fri Aug 22, 2003 1:11 pm
Forum: Volume 105 (10500-10599)
Topic: 10523 - Very Easy !!!
Replies: 63
Views: 22359

This is not the first time in the last week or so...

It's hapenning the same with problem 367:

Go to advanced search