## Search found 196 matches

- Mon May 25, 2009 11:34 pm
- Forum: Volume 116 (11600-11699)
- Topic: 11620 - City of Egocentrics
- Replies:
**3** - Views:
**683**

### Re: 11620 - City of Egocentrics

There is an optimal O(n^2) algorithm for this problem.

- Sat May 23, 2009 9:02 pm
- Forum: Volume 116 (11600-11699)
- Topic: 11622 - Le Compte est Bon
- Replies:
**3** - Views:
**1522**

### Re: 11622 - Le Compte est Bon

Thanks! Now solved by precomputation. Forget the above examples. We should use the order of operations, we can use as many parentheses as we want, all partial calculations should be integer, but my program used negative integers also! This means that for example: valid: 3+100*2=203 valid: (5-7)*(2+3...

- Sat May 23, 2009 6:22 pm
- Forum: Volume 116 (11600-11699)
- Topic: 11622 - Le Compte est Bon
- Replies:
**3** - Views:
**1522**

### 11622 - Le Compte est Bon

How on the Earth so large the answer for n=8000 ? That means that about 77% percentage of a random 6-tuplet generate 8000. My first code used the http://en.wikipedia.org/wiki/Order_of_operations , and the answer was less than 1 million. And I don't understand this sentence: "(always working with int...

- Fri May 22, 2009 12:32 am
- Forum: Volume 116 (11600-11699)
- Topic: 11601 - Avoiding Overlaps
- Replies:
**11** - Views:
**4974**

### Re: 11601 - Avoiding Overlaps

Somebody please tell me what is a complexity of your algo(accepted :))??? If I remember correctly in the wost case: my algorithm runs in time about 0.5*200^3+N*200 per testcase. You can try also a 2 dimensional binary tree, I've used another method. And here I think that the 2D binary tree is slow.

- Sat May 16, 2009 1:34 pm
- Forum: FAQ
- Topic: Registration problem
- Replies:
**3** - Views:
**6982**

### Re: Registration problem

There are lots of another online judge, which are not broken, see: http://en.wikipedia.org/wiki/Online_judge

- Tue Dec 30, 2008 9:37 am
- Forum: Volume 115 (11500-11599)
- Topic: 11566 - Let's Yum Cha!
- Replies:
**10** - Views:
**4430**

### Re: 11566 Let's Yum Cha!

In this line there's a mistake:

Code: Select all

```
if(x % 10 == 0) return x; else return (x/10)+1;
```

- Tue Dec 30, 2008 2:45 am
- Forum: Volume 115 (11500-11599)
- Topic: 11571 - Simple Equations - Extreme!!
- Replies:
**31** - Views:
**11179**

### Re: 11571 - Simple Equations - Extreme!!

For large numbers your code sometimes doesn't find the solution. Here are 5 such example: 5 2387162575 717973329951426968 5698749207640446741 2237352967 4503748340026097400 5003636701648133909 2297417884 3760073721300737960 5277585283697652330 2289936967 3843198163089955800 5244186565713749245 22239...

- Tue Dec 30, 2008 1:26 am
- Forum: Volume 115 (11500-11599)
- Topic: 11571 - Simple Equations - Extreme!!
- Replies:
**31** - Views:
**11179**

### Re: 11571 - Simple Equations - Extreme!!

Couldn't that be an overflow error? Does that code get AC for the easy version?Jan wrote: Btw I haven't got accepted yet. Getting WA. So far, I haven't found any bug. I am not using any floating point arithmetic. For finding square/cubic root I am using binary search.

- Sun Dec 28, 2008 1:09 am
- Forum: Volume 115 (11500-11599)
- Topic: 11566 - Let's Yum Cha!
- Replies:
**10** - Views:
**4430**

### Re: 11566 Let's Yum Cha!

I am having hard time understanding the problem statement. From what i understand, This problem's description is really sucks, if you understand it you can solve it less than 5 minutes. You have lots of misinterpretaions, the problem in pseudocode is the following: max(i=1,K,order[i]*sum(j=1,N+1,fu...

- Sun Nov 09, 2008 2:34 pm
- Forum: Bugs and suggestions
- Topic: 206. ACM ICPC::Dhaka Regional Contest (Live)
- Replies:
**0** - Views:
**1631**

### 206. ACM ICPC::Dhaka Regional Contest (Live)

Why isn't added this new contest's problems to acm.uva? It was quite frustrating the 80 minutes delay in the judge on the contest. It was really offline. I'm still don't understand why you make some huge time limits, for example for D the time limit was 15 sec., and I solved it only in 0.02 sec. For...

- Mon Nov 03, 2008 1:44 am
- Forum: Volume 115 (11500-11599)
- Topic: 11551 - Experienced Endeavour
- Replies:
**5** - Views:
**997**

### Re: 11551 - Experienced Endeavour (for admin - a mistake)

The whole image is dirty and small, magnifying doesn't help. Guessing the problem took me more time than solving it on the contest.

- Sun Oct 26, 2008 1:55 am
- Forum: Volume 115 (11500-11599)
- Topic: 11542 - Square
- Replies:
**16** - Views:
**5458**

### Re: 11542 Square

Gaussian elimination over GF[2].

- Mon Oct 13, 2008 7:40 pm
- Forum: Volume 115 (11500-11599)
- Topic: 11525 - Permutation
- Replies:
**9** - Views:
**3340**

### Re: 11525 - Permutation

More precisely it's possible to solve this problem by interval tree (this is also a binary tree) in O(N*log(N)) time and in O(N) memory.Leonid wrote:I used binary tree to solve the problem.

- Sat Oct 11, 2008 7:49 pm
- Forum: Bugs and suggestions
- Topic: km long judge queue (II.)
- Replies:
**1** - Views:
**1540**

### km long judge queue (II.)

And today's "ACM ICPC::Regional Warmup 2" contest's codes are still in the judge queue also.

- Sat Oct 04, 2008 11:10 pm
- Forum: Volume 115 (11500-11599)
- Topic: 11516 - WiFi
- Replies:
**4** - Views:
**3255**

### Re: 11516 - WiFi

First sort the house numbers, then

binary search+greedy

binary search+greedy