Does anyone know any online judge problem which deals with Volume of Union of Cuboids ?
# | User | Rating |
---|---|---|
1 | jiangly | 3846 |
2 | tourist | 3799 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3590 |
6 | Ormlis | 3533 |
7 | Benq | 3468 |
8 | Radewoosh | 3463 |
9 | ecnerwala | 3451 |
9 | Um_nik | 3451 |
# | User | Contrib. |
---|---|---|
1 | cry | 165 |
2 | -is-this-fft- | 161 |
3 | Qingyu | 160 |
4 | Dominater069 | 158 |
5 | atcoder_official | 157 |
6 | adamant | 154 |
7 | Um_nik | 151 |
8 | djm03178 | 150 |
9 | luogu_official | 149 |
10 | awoo | 147 |
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 |
---|