Codeforces Round 517 (Div. 1, based on Technocup 2019 Elimination Round 2)

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.

ContestId
Name
Phase
Frozen
Duration (Seconds)
Relative Time
Start Time
1071 Codeforces Round 517 (Div. 1, based on Technocup 2019 Elimination Round 2) FINISHED False 7200 197416223 Oct. 21, 2018, 8:10 a.m.

Problems

Solved$
Index
Name
Type
Tags
Community Tag
Rating
( 147 ) E Rain Protection PROGRAMMING binary search geometry 3500

B"A lot of people dream of convertibles (also often called cabriolets). Some of convertibles, however, don't have roof at all, and are vulnerable to rain. This is why Melon Ask, the famous inventor, decided to create a rain protection mechanism for convertibles. The workplace of the mechanism is a part of plane just above the driver. Its functional part consists of two rails with sliding endpoints of a piece of stretching rope. For the sake of simplicity we can consider this as a pair of parallel segments in a plane with the rope segment, whose endpoints we are free to choose as any points on these rails segments. The algorithmic part of the mechanism detects each particular raindrop and predicts when and where it reaches the plane. At this exact moment the rope segment must contain the raindrop point (so the rope adsorbs the raindrop). You are given the initial position of the rope endpoints and all information about raindrops. You are to choose the minimal possible speed v of the endpoints sliding (both endpoints can slide in any direction along their segments independently of each other) in such a way that it is possible to catch all raindrops moving both endpoints with speed not greater than v , or find out that it's impossible no matter how high the speed is. The first line contains three integers n , w and h ( 1 <= n <= 10^5 , 1 <= w, h <= 10^3 ), meaning that there are n raindrops, and two rails are represented as segments connecting (0, 0) and (w, 0) and connecting (0, h) and (w, h) . The second line contains two integers e_1 and e_2 , meaning that the initial (that is, at the moment t = 0 ) positions of the endpoints are (e_1, 0) and (e_2, h) ( 0 <= e_1, e_2 <= w ). The i -th of the following n lines contains three integers t_i , x_i and y_i ( 1 <= t_i <= 10^5 , 0 <= x_i <= w , 0 < y_i < h ) meaning that the"...

Tutorials

Разбор задач Отборочного Раунда 2 Технокубка 2019 и Codeforces Round #517

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
48477250 FlashHu E Jan. 17, 2019, 3:41 a.m. OK GNU C++11 TESTS 56 140 4505600 3500
50913261 luogu_bot4 E March 7, 2019, 4:21 a.m. OK GNU C++11 TESTS 56 155 4505600 3500
48477298 FlashHu E Jan. 17, 2019, 3:44 a.m. OK GNU C++11 TESTS 56 155 4505600 3500
52453221 luogu_bot3 E April 7, 2019, 10:41 a.m. OK GNU C++11 TESTS 56 156 4505600 3500
48477192 FlashHu E Jan. 17, 2019, 3:38 a.m. OK GNU C++11 TESTS 56 202 4505600 3500
61109906 nekochen E Sept. 23, 2019, 10:51 a.m. OK GNU C++11 TESTS 56 217 3788800 3500
48477265 FlashHu E Jan. 17, 2019, 3:42 a.m. OK GNU C++11 TESTS 56 217 4505600 3500
48449748 FlashHu E Jan. 16, 2019, 9:33 a.m. OK GNU C++11 TESTS 56 389 4505600 3500
48449862 FlashHu E Jan. 16, 2019, 9:37 a.m. OK GNU C++11 TESTS 56 405 4505600 3500
44653622 irkstepanov E Oct. 21, 2018, 12:14 p.m. OK GNU C++11 TESTS 56 763 4812800 3500
54452705 Ma_Ster1 E May 21, 2019, 2:20 p.m. OK GNU C++14 TESTS 56 93 2048000 3500
49895836 ochilov-2004 E Feb. 14, 2019, 6:52 a.m. OK GNU C++14 TESTS 56 93 2048000 3500
44683373 ez_zjt E Oct. 22, 2018, 7:59 a.m. OK GNU C++14 TESTS 56 108 2048000 3500
45172371 tmwilliamlin168 E Nov. 1, 2018, 1:18 p.m. OK GNU C++14 TESTS 56 139 9216000 3500
45172161 tmwilliamlin168 E Nov. 1, 2018, 1:14 p.m. OK GNU C++14 TESTS 56 140 9216000 3500
59981155 Scut82 E Sept. 4, 2019, 8:24 a.m. OK GNU C++14 TESTS 56 233 2457600 3500
45172108 tmwilliamlin168 E Nov. 1, 2018, 1:13 p.m. OK GNU C++14 TESTS 56 234 9216000 3500
45172037 tmwilliamlin168 E Nov. 1, 2018, 1:11 p.m. OK GNU C++14 TESTS 56 312 9216000 3500
54817166 bhargav_0085 E May 29, 2019, 9:06 p.m. OK GNU C++14 TESTS 56 483 2355200 3500
54817154 bhargav_0085 E May 29, 2019, 9:05 p.m. OK GNU C++14 TESTS 56 483 2355200 3500
49684673 pandora_lee E Feb. 10, 2019, 6:15 a.m. OK GNU C++17 TESTS 56 108 2252800 3500
44751197 ReaLNero1 E Oct. 23, 2018, 8:02 p.m. OK GNU C++17 TESTS 56 109 2252800 3500
44749483 paryatak_desi_007 E Oct. 23, 2018, 6:49 p.m. OK GNU C++17 TESTS 56 109 2252800 3500
62911525 gongsuidashen E Oct. 19, 2019, 7:28 a.m. OK GNU C++17 TESTS 56 140 4505600 3500
45996188 kczno1 E Nov. 20, 2018, 12:27 p.m. OK GNU C++17 TESTS 56 280 2764800 3500
48168542 Nakagawa.Kanon E Jan. 10, 2019, 4:27 a.m. OK GNU C++17 TESTS 56 452 9625600 3500
48168507 Nakagawa.Kanon E Jan. 10, 2019, 4:24 a.m. OK GNU C++17 TESTS 56 452 9625600 3500
66415690 user202729_ E Dec. 6, 2019, 5 p.m. OK GNU C++17 TESTS 56 794 5222400 3500
44755780 jah_melon E Oct. 24, 2018, 12:47 a.m. OK GNU C++17 TESTS 56 842 2457600 3500
53087839 ulambayar2012 E April 21, 2019, 9:44 a.m. OK GNU C++17 TESTS 56 858 2150400 3500

remove filters

Back to search problems