Does anyone know any online judge problem which deals with Volume of Union of Cuboids ?
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 151 |
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 |
---|