Search found 251 matches

by serur
Tue Apr 07, 2009 9:27 pm
Forum: Volume 8 (800-899)
Topic: 802 - Lead or Gold
Replies: 20
Views: 11025

Re: 802 - Lead or Gold

I tried to implement the so-called M-Algorithm of simplex method: introduced 3 aritificial variables in order to obtain
an identity matrix in the constraints' matrix, introduced an objective function Z = (x[n+1] + x[n+2] + x[n+3])*M --> min,
and so on...

Code: Select all

M-algorithm
Bu it gets TLE.
by serur
Wed Aug 13, 2008 10:15 am
Forum: Bugs and suggestions
Topic: NEW JUDGE'S STATUS
Replies: 20
Views: 18818

Re: NEW JUDGE'S STATUS

andmej, I hope you got that weighted bipartite stunt allright.
Mozilla is out of the question, since I'm not given admin rights :(
by serur
Tue Aug 12, 2008 1:28 pm
Forum: Bugs and suggestions
Topic: NEW JUDGE'S STATUS
Replies: 20
Views: 18818

Win XP Internet Explorer problem

Currently my interent acces is confined to WinXP (I was used to lynx), but it shows something incomprehensible.
by serur
Wed Feb 20, 2008 1:46 am
Forum: Volume 111 (11100-11199)
Topic: 11166 - Power Signs
Replies: 14
Views: 7007

Excellent problem, isn't it? One of the best DPs on this site.
by serur
Thu Feb 14, 2008 3:33 pm
Forum: Other words
Topic: The Number of steiner points in min.steiner tree
Replies: 0
Views: 1760

The Number of steiner points in min.steiner tree

Let H be a metric space, then for n terminals there can be nor more than n-2 steiner points
For n = 2 this holds because of the triangle inequality, but how to prove the general case?
by serur
Thu Feb 07, 2008 11:05 am
Forum: Bugs and suggestions
Topic: Shorter URLs
Replies: 4
Views: 2313

My two cents is that e.g. submitting to spoj.pl takes me 4-5 seconds (!) (with lynx), while to UVa I had to go through a vast number of redirections...
by serur
Fri Feb 01, 2008 4:36 pm
Forum: Other words
Topic: The expected area of a triangle
Replies: 2
Views: 2334

EDIT: you're not likely to be drawn into discussion of a kindergarten problem I see :) I have this question about densities: Given random variables X, Y, (oo >X,Y >=0) and their joint probability density function f(x,y); consider a random variable Z := X*Y. What's the probability density of Z? The a...
by serur
Fri Feb 01, 2008 1:17 pm
Forum: Other words
Topic: The expected area of a triangle
Replies: 2
Views: 2334

The expected area of a triangle

Given a unit circle, we pick independently 3 points A,B, and C (uniform distribution) on its circumference. What is the expected area of a triangle ABC? What I know so far: density - 1/(2pi), picking a point is just the same as picking an angle uniformly distributed over [-pi,pi], and the area is so...
by serur
Wed Jan 30, 2008 8:58 pm
Forum: Bugs and suggestions
Topic: Transparency
Replies: 3
Views: 1501

The suggestion of submissions being accessible had already been made at least two times. Also - there are thousands I guess who use text-based browsers ( like lynx ) - much robust and not-that-traffic-consuming. So maybe it's possible to make the new system more friendly to text-based access? You fe...
by serur
Wed Jan 23, 2008 7:15 am
Forum: Java
Topic: File naming in Java
Replies: 1
Views: 3625

File naming in Java

The Judge requires that we should have a Main class => the file itself should be called Main.java. Then what should I do if I'm going to write Java solutions for problems X,Y and Z?
by serur
Mon Dec 10, 2007 8:54 pm
Forum: ACM ICPC Archive Board
Topic: Lazy Jumping Frog - 3652 (Live Archive)
Replies: 8
Views: 8404

Sorry, I didn't look through your code, but the optimiziation which I my self used is: just keep 10 ( 'coz weight = 0...9 ), push into them accordingly, and during dijkstra keep popping minimum from these 10 heaps. It took 2.5 CPU though, while TL is 3.00 CPU.
by serur
Sun Dec 02, 2007 10:38 am
Forum: Bugs and suggestions
Topic: View your source code
Replies: 1
Views: 2008

View your source code

We would like to have this feature: view your source code (ACcepted), just as in http://www.spoj.pl. Thanks!
by serur
Wed Nov 28, 2007 2:06 pm
Forum: ACM ICPC Archive Board
Topic: Lazy Jumping Frog - 3652 (Live Archive)
Replies: 8
Views: 8404

Your idea about k queues - it may interest you to look through 929 - 'Number Maze'. I got TLE on Lazy Frog, too (long before you), and gave it up at once, supposing that some compliated structure to hold forbidden positions is indespensable, i.e. I did not think that the bottleneck was Dijkstra.
by serur
Tue Nov 27, 2007 4:29 pm
Forum: Algorithms
Topic: MinCost MaxFlow code
Replies: 20
Views: 15395

lookup the back edge in constant time
Hm.. I should have some pointers to edges (in C) then.
A few mincost maxflows from LA:
2927 - 'Shortest pair'
3550 - 'Hotel'
(I didn't try as yet, though)
by serur
Sun Nov 25, 2007 9:58 pm
Forum: Algorithms
Topic: MinCost MaxFlow code
Replies: 20
Views: 15395

Abednego's code for mincostmaxflow contains FIXMEs.
I got AC 10806 and 10594 with it.
How that code must be modified in order for it to handle multiple edges with different costs?

Go to advanced search