Does anyone know any online judge problem which deals with Volume of Union of Cuboids ?
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
Does anyone know any online judge problem which deals with Volume of Union of Cuboids ?
I have solved closest pair and closest triplet problems using divide and conquer. I wonder if there is a problem ever asked which deals with finding closest quadruplet of points ( sum of distance between all pairs is minimum ) ? Also i want some efficient approach for solving similar problem for k-closest points.
Here is my code for the problem : http://ideone.com/UHbff
I got WA because on Codeforces judge for input 1 10000, its giving 10007 but on ideone and my system it gives 10008. Am i using any compiler version dependent statement ?
Can anyone explain the algorithm to solve area of union of circles problem( given n circles + centre and radius of each)
Thankyou
Name |
---|