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 |
---|---|---|---|---|---|---|
1163 | Codeforces Round 558 (Div. 2) | FINISHED | False | 7200 | 180111324 | May 9, 2019, 3:05 p.m. |
Solved$ |
Index |
Name |
Type |
Tags |
Community Tag |
Rating |
---|---|---|---|---|---|---|
( 977 ) | F | Indecisive Taxi Fee | PROGRAMMING | data structures graphs shortest paths | 2900 |
B"In the city of Capypaland where Kuro and Shiro resides, there are n towns numbered from 1 to n and there are m bidirectional roads numbered from 1 to m connecting them. The i -th road connects towns u_i and v_i . Since traveling between the towns is quite difficult, the taxi industry is really popular here. To survive the harsh competition, each taxi company has to find a distinctive trait for their customers. Kuro is the owner of a taxi company. He has decided to introduce a new fee model for his taxi brand, where the fee for each ride is not calculated based on the trip length, but on the sum of the prices of the roads traveled. The price for each of the m roads has been decided by Kuro himself. As of now, the price for the road i is w_i and hence the fee for a taxi ride traveling through roads e_1, e_2, ldots, e_k is sum_{i=1}^k w_{e_i} . However, Kuro himself is an indecisive person, so he has drafted q plans to change the road price. Each of the plans will be based on the original prices w_i , except for a single road t_j , the price of which is changed to x_j . Note, that the plans are independent of each other. Shiro is a regular customer of the Kuro's taxi brand since she uses the taxi to travel from town 1 to town n every day. Since she's so a regular customer, Kuro decided to show her all his q plans before publishing them to the public. Now, Shiro wants to know the lowest fee she must pay to travel from the town 1 to the town n for each Kuro's plan. The first line contains three integers n , m and q ( 2 <= n <= 2 cdot 10^5 , 1 <= m, q <= 2 cdot 10^5 ) -- the number of towns, the number of roads, and the number of plans that Kuro has drafted respectively. The i -th of the next m contains three integers u_i , v_i and w_i ( 1 <= u_i, v_i <= n , 1 "... |
66943 |
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
---|---|---|---|---|---|---|---|---|---|---|---|
53934615 | rainboy | F | May 9, 2019, 8:40 p.m. | OK | GNU C11 | TESTS | 61 | 1169 | 23347200 | 2900 | |
64180874 | wh_ZH | F | Nov. 4, 2019, 12:27 a.m. | OK | GNU C++11 | TESTS | 61 | 234 | 33587200 | 2900 | |
54411775 | Ryochii | F | May 20, 2019, 10:14 a.m. | OK | GNU C++11 | TESTS | 61 | 265 | 23552000 | 2900 | |
59448584 | vjudge2 | F | Aug. 25, 2019, 2:21 p.m. | OK | GNU C++11 | TESTS | 61 | 265 | 42188800 | 2900 | |
54365380 | lzoilxy | F | May 19, 2019, 2:08 a.m. | OK | GNU C++11 | TESTS | 61 | 296 | 25497600 | 2900 | |
56510314 | tyler178 | F | July 4, 2019, 10:01 a.m. | OK | GNU C++11 | TESTS | 61 | 311 | 23244800 | 2900 | |
54365374 | Libitina | F | May 19, 2019, 2:07 a.m. | OK | GNU C++11 | TESTS | 61 | 311 | 27238400 | 2900 | |
63373144 | Rikuki | F | Oct. 25, 2019, 10:06 a.m. | OK | GNU C++11 | TESTS | 61 | 311 | 36454400 | 2900 | |
54366685 | dqa2020 | F | May 19, 2019, 3:33 a.m. | OK | GNU C++11 | TESTS | 61 | 312 | 24064000 | 2900 | |
60720095 | Grharris | F | Sept. 17, 2019, 12:07 p.m. | OK | GNU C++11 | TESTS | 61 | 312 | 27238400 | 2900 | |
60720810 | Grharris | F | Sept. 17, 2019, 12:19 p.m. | OK | GNU C++11 | TESTS | 61 | 327 | 27238400 | 2900 | |
64314805 | luogu_bot2 | F | Nov. 5, 2019, 1:48 p.m. | OK | GNU C++14 | TESTS | 61 | 405 | 36556800 | 2900 | |
65613352 | PolyLoger | F | Nov. 24, 2019, 1:30 a.m. | OK | GNU C++14 | TESTS | 61 | 452 | 36556800 | 2900 | |
55108151 | RNS_MHB | F | June 5, 2019, 4:35 a.m. | OK | GNU C++14 | TESTS | 61 | 483 | 33177600 | 2900 | |
54366893 | remember | F | May 19, 2019, 3:45 a.m. | OK | GNU C++14 | TESTS | 61 | 483 | 56115200 | 2900 | |
61868166 | _FlyingColor_ | F | Oct. 4, 2019, 5:14 p.m. | OK | GNU C++14 | TESTS | 61 | 514 | 32768000 | 2900 | |
54237679 | Newusers | F | May 16, 2019, 11:32 a.m. | OK | GNU C++14 | TESTS | 61 | 514 | 39424000 | 2900 | |
61901724 | _FlyingColor_ | F | Oct. 5, 2019, 8:45 a.m. | OK | GNU C++14 | TESTS | 61 | 545 | 32665600 | 2900 | |
66280952 | KeyID | F | Dec. 4, 2019, 5:13 p.m. | OK | GNU C++14 | TESTS | 61 | 545 | 37785600 | 2900 | |
54392411 | pkgunboat | F | May 19, 2019, 5:16 p.m. | OK | GNU C++14 | TESTS | 61 | 545 | 49459200 | 2900 | |
54067519 | Zidian | F | May 13, 2019, 2:15 p.m. | OK | GNU C++14 | TESTS | 61 | 546 | 49459200 | 2900 | |
54156304 | newgate | F | May 15, 2019, 4:19 a.m. | OK | GNU C++17 | TESTS | 61 | 468 | 30617600 | 2900 | |
55118427 | AryaKnight | F | June 5, 2019, 9:49 a.m. | OK | GNU C++17 | TESTS | 61 | 468 | 32768000 | 2900 | |
53985148 | Lawali | F | May 11, 2019, 9:14 a.m. | OK | GNU C++17 | TESTS | 61 | 514 | 31232000 | 2900 | |
53985241 | Lawali | F | May 11, 2019, 9:18 a.m. | OK | GNU C++17 | TESTS | 61 | 514 | 31232000 | 2900 | |
54273675 | mu_xia_xiu_ji | F | May 17, 2019, 10:02 a.m. | OK | GNU C++17 | TESTS | 61 | 514 | 34406400 | 2900 | |
54980082 | closewater | F | June 2, 2019, 12:43 p.m. | OK | GNU C++17 | TESTS | 61 | 530 | 54272000 | 2900 | |
54630326 | Light | F | May 25, 2019, 2:07 p.m. | OK | GNU C++17 | TESTS | 61 | 577 | 46899200 | 2900 | |
54885907 | _Muhammad | F | May 31, 2019, 5:17 p.m. | OK | GNU C++17 | TESTS | 61 | 577 | 64512000 | 2900 | |
55123463 | AryaKnight | F | June 5, 2019, 11:47 a.m. | OK | GNU C++17 | TESTS | 61 | 592 | 45056000 | 2900 | |
53943656 | pmnox | F | May 10, 2019, 5:08 a.m. | OK | GNU C++17 | TESTS | 61 | 608 | 35225600 | 2900 | |
54077620 | uwi | F | May 13, 2019, 9:58 p.m. | OK | Java 8 | TESTS | 61 | 795 | 43929600 | 2900 | |
53934614 | Dukkha | F | May 9, 2019, 8:40 p.m. | OK | Java 8 | TESTS | 61 | 1060 | 35430400 | 2900 | |
54077530 | uwi | F | May 13, 2019, 9:50 p.m. | OK | Java 8 | TESTS | 61 | 1169 | 43929600 | 2900 | |
53946099 | dalt | F | May 10, 2019, 6:46 a.m. | OK | Java 8 | TESTS | 61 | 1325 | 70451200 | 2900 | |
53944577 | Bruteforceman | F | May 10, 2019, 5:47 a.m. | OK | Java 8 | TESTS | 61 | 1325 | 150425600 | 2900 |
Back to search problems