2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred)

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
1252 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) FINISHED False 18000 159676199 Oct. 27, 2019, 3:30 a.m.

Problems

Solved$
Index
Name
Type
Tags
Community Tag
Rating
( 31 ) I Mission Possible PROGRAMMING 3200

B"Allen, a government secret service, has been assigned to infiltrate a mafia secret base to uncover crucial information regarding the mafia's operations. The secret base is a rectangular bounded by (x_L,y_L) , (x_L,y_R) , (x_R,y_L) , and (x_R,y_R) in a Cartesian coordinate system where x_L < x_R and y_L < y_R . There are N sensors placed inside the secret base. The i^{th} sensor is located at (x_i, y_i) and has an effective sensing radius of r_i which can detect any person who is strictly within the radius of r_i from (x_i, y_i) . In other words, the i^{th} sensor can detect a person at location (x_a, y_a) if and only if the Euclidean distance of (x_i, y_i) and (x_a, y_a) is strictly less than r_i . It is also known that the Euclidean distance of any two sensors i and j is strictly larger than r_i + r_j . Note that the Euclidean distance of two points, (x_a, y_a) and (x_b, y_b) , is sqrt{|x_a - x_b|^2 + |y_a - y_b|^2} . Allen begins his infiltration mission at location (x_s, y_s) , and his target is located at (x_t, y_t) . Allen has the power to run extremely fast in a straight line while he needs to spend extra time to change his running trajectory (to adjust his footing). Although he is a fast runner, he still needs to make sure that none of the sensors detect him while he is running, i.e. there is no point in his running trajectory which is strictly within a sensor effective sensing radius. Let P = {(x_{p_1}, y_{p_1}), ... , (x_{p_{|P|}}, y_{p_{|P|}}) } be the set of locations where Allen changes his running trajectory, thus, Allen's running trajectory with P is (x_s, y_s) rightarrow (x_{p_1}, y_{p_1}) rightarrow ... rightarrow (x_{p_{|P|}}, y_{p_{|P|}}) rightarrow (x_t, y_t) where (x_a,y_a) rightarrow (x_b,y_b) implies that Allen is running from (x_a,y_a) to (x_b,y_b) in "...

Tutorials

T

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
63533953 panole zx2003 I Oct. 27, 2019, 7:31 a.m. OK GNU C++11 TESTS 59 31 102400 3200
64304039 fffasttime I Nov. 5, 2019, 10:58 a.m. OK GNU C++11 TESTS 59 31 2867200 3200
64304152 fffasttime I Nov. 5, 2019, 11 a.m. OK GNU C++11 TESTS 59 46 2048000 3200
64315581 7070 I Nov. 5, 2019, 2:01 p.m. OK GNU C++11 TESTS 59 280 29491200 3200
64316857 vjudge5 I Nov. 5, 2019, 2:22 p.m. OK GNU C++11 TESTS 59 295 29491200 3200
66787273 Motarack I Dec. 13, 2019, 2:05 p.m. OK GNU C++14 TESTS 59 31 0 3200
64357048 wakaka I Nov. 6, 2019, 10:35 a.m. OK GNU C++14 TESTS 59 31 204800 3200
65795501 liu_runda I Nov. 27, 2019, 4:12 a.m. OK GNU C++14 TESTS 59 46 307200 3200
65511022 ainta I Nov. 22, 2019, 3:45 a.m. OK GNU C++14 TESTS 59 46 1024000 3200
63691798 Scut82 I Oct. 29, 2019, 3:07 a.m. OK GNU C++14 TESTS 59 358 147148800 3200
64707638 return_47 I Nov. 11, 2019, 5:12 p.m. OK GNU C++17 TESTS 59 31 204800 3200
64524815 tlwpdus molamola. I Nov. 8, 2019, 1:27 p.m. OK GNU C++17 TESTS 59 31 204800 3200
63781801 F.J I Oct. 30, 2019, 11:15 a.m. OK GNU C++17 TESTS 59 31 204800 3200
63541227 tfg I Oct. 27, 2019, 9:24 a.m. OK GNU C++17 TESTS 59 61 204800 3200
63688967 Benq I Oct. 29, 2019, 12:57 a.m. OK GNU C++17 TESTS 59 62 819200 3200
63530684 kut_kjb1994 hbi1998 I Oct. 27, 2019, 6:38 a.m. OK GNU C++17 TESTS 59 77 13004800 3200

remove filters

Back to search problems