Solutions are presented as using the least memory and the fastest execution time. It also takes the top
10 most recent solutions from each language. If you want to limit to a specific index, click the
"Solved" button and go to that problem.
Problems
B"Bob Bubblestrong just got a new job as security guard. Bob is now responsible for safety of a collection of warehouses, each containing the most valuable Bubble Cup assets - the high-quality bubbles. His task is to detect thieves inside the warehouses and call the police. Looking from the sky, each warehouse has a shape of a convex polygon. Walls of no two warehouses intersect, and of course, none of the warehouses is built inside of another warehouse. Little did the Bubble Cup bosses know how lazy Bob is and that he enjoys watching soap operas (he heard they are full of bubbles) from the coziness of his office. Instead of going from one warehouse to another to check if warehouses are secured, the plan Bob has is to monitor all the warehouses from the comfort of his office using the special X-ray goggles. The goggles have an infinite range, so a thief in any of the warehouses could easily be spotted. However, the goggles promptly broke and the X-rays are now strong only enough to let Bob see through a single wall. Now, Bob would really appreciate if you could help him find out what is the total area inside of the warehouses monitored by the broken goggles, so that he could know how much area of the warehouses he needs to monitor in person. The first line contains one integer N ( 1 <= q N <= q 10^4 ) xe2 x80 x93 the number of warehouses. The next N lines describe the warehouses. The first number of the line is integer c_i ( 3 <= q c_i <= q 10^4 ) xe2 x80 x93 the number corners in the i^{th} warehouse, followed by c_i pairs of integers. The j^{th} pair is (x_j, y_j) xe2 x80 x93 the coordinates of the j^{th} corner ( |x_j| , |y_j| <= q 3 * 10^4 ). The corners are listed in the clockwise order. The total number of corners in all the warehouses is at most 5 * 10^4 . Bob's office is positioned at the point with coordinates (0, 0) . The office is not con"... |
Tutorials
Submissions
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
60644172 |
300iq MiFaFaOvO |
B |
Sept. 15, 2019, 4:29 p.m. |
OK |
GNU C++14 |
TESTS |
12 |
202 |
9523200 |
|
2700 |
60775092 |
krijgertje |
B |
Sept. 18, 2019, 2:04 p.m. |
OK |
GNU C++14 |
TESTS |
12 |
265 |
6246400 |
|
2700 |
69091486 |
vamsicool007 |
B |
Jan. 19, 2020, 10:19 a.m. |
OK |
GNU C++14 |
TESTS |
12 |
405 |
16281600 |
|
2700 |
61025915 |
ShadowLight |
B |
Sept. 21, 2019, 3:59 p.m. |
OK |
GNU C++14 |
TESTS |
12 |
967 |
20889600 |
|
2700 |
60946919 |
DmitryGrigorev |
B |
Sept. 20, 2019, 7:23 p.m. |
OK |
GNU C++14 |
TESTS |
12 |
967 |
20889600 |
|
2700 |
60644595 |
Nebuchadnezzar kraborak cdkrot |
B |
Sept. 15, 2019, 4:38 p.m. |
OK |
GNU C++17 |
TESTS |
12 |
46 |
3584000 |
|
2700 |
60647275 |
KAN Um_nik |
B |
Sept. 15, 2019, 5:38 p.m. |
OK |
GNU C++17 |
TESTS |
12 |
139 |
16793600 |
|
2700 |
62067203 |
rui-de |
B |
Oct. 7, 2019, 3:36 p.m. |
OK |
GNU C++17 |
TESTS |
12 |
187 |
52633600 |
|
2700 |
61610663 |
forgottencsc |
B |
Oct. 1, 2019, 2:01 p.m. |
OK |
GNU C++17 |
TESTS |
12 |
296 |
11366400 |
|
2700 |
60730751 |
ivan100sic |
B |
Sept. 17, 2019, 3:36 p.m. |
OK |
GNU C++17 |
TESTS |
12 |
327 |
42905600 |
|
2700 |
66299831 |
BrendanOh |
B |
Dec. 5, 2019, 6:36 a.m. |
OK |
GNU C++17 |
TESTS |
12 |
358 |
7782400 |
|
2700 |
60729843 |
gepardo |
B |
Sept. 17, 2019, 3:17 p.m. |
OK |
GNU C++17 |
TESTS |
12 |
358 |
7987200 |
|
2700 |
60648802 |
Swistakk |
B |
Sept. 15, 2019, 6:14 p.m. |
OK |
GNU C++17 |
TESTS |
12 |
358 |
9625600 |
|
2700 |
60734930 |
Benq |
B |
Sept. 17, 2019, 5:06 p.m. |
OK |
GNU C++17 |
TESTS |
12 |
373 |
16281600 |
|
2700 |
60729949 |
gepardo |
B |
Sept. 17, 2019, 3:19 p.m. |
OK |
GNU C++17 |
TESTS |
12 |
374 |
7987200 |
|
2700 |
61368048 |
Harpae |
B |
Sept. 27, 2019, 2:07 p.m. |
OK |
Java 8 |
TESTS |
12 |
405 |
0 |
|
2700 |
remove filters
Back to search problems