Algorithms

Fix the Dijkstra

Difficulty

Asked at Flow Traders

Theory: Algorithms Under a Complexity Bound

Read the problem, hints and solution here. The editor needs a bigger screen: open this page on a laptop to write and run your code.

xxxx xxx xxxxxx xxxx xxxxxx xxxx. xxx xxxxxxx xx xx xxxxx xx xx xxxxx xx xxxxx xxxx, xxx xxxxx xxx xx xxxx xxxxxxx x xxxxxxxxx xxxxxx xxxxxx xxxx xxxxxxxx, xxxxx xx xxx xxx xxx xxxxxxxx xxxxxx. x. xxx::xxxxxxxx_xxxxx xx x xxx xxxx. xxxx xx xxxxxxx xx xxxxxxx xxx xxxx xxxxxxxxx xxxxxxxx xxxx xxxxx, xxxxx xx xxx xxxxxxxx xxx xx xxx xxxxxxxx. x. xx xxxxxx x xxxx xxxxx xxxx xx xxxxx x xxxxxxx xxxxx, xx xxx xxxxx xxxxx xxxxx xxxxxxx xxxx xxxxxxxx xxxxxxxxx. xxxxxxx xxx xxx xxxxxxxxx xx xx-xxxxxxx xxxxxxxxxx xxxx x xxxxxxxx xxxx xxx xxxxx xxxxxxxx. x. xx xxxxx x xxxx xxxxxxx xxxx xx xx xxxxxx xxxxxx xxxx xxxx xx xx xxxxxx, xx xxx xxxxx xxxxx xxxxx xx x xxxx xxxx xxxx xxxx x xxxxxxx xxx xxxxx xx xxxxx. xxxxxxxxx xxxxxxxx_xxxxx(x, xxxxx, xxxxxx) xxxxxxxxx: xxx xxxx xx xxx xxxxxxxx xxxxx xxxx xxxxxx xx xxxxx xxxx, xx ( -x ) xxxxx xxxxx xx xxxx. xxxxx xxx ( x xxxxx x-x ). xxxxx xxx (xxxx, xx, xxxxxx), xxxxxxxx, xxxx xxxxxxxx xxxxxxx. xxxxx xxx xx xxxxxxxx xxxxx xxx xxxx-xxxxx. xxxxxxxx xxxxxxxx_xxxxx(x, {{x,x,xx}, {x,x,x}, {x,x,x}}, x); // {x, x, x} xxxx x xx xxxxxxxxx xxxxxxxx xx xxxx xx xxx xxx xxxx x xx xxxx x. xx xxxxxxxxxxxxxx xxxx xxxxxxx x xxxx xxxx xx xx xxxxx xxxxxx xxxxxxx xx. xxxxxxxxxxx xx xx ( xx^x ) xxxxx xxx ( x xxxxx xx^x ) xxxxx. xxx xxxxxx xx xxxxx xx xx xxxxxxxx (x xx xxx xxxxxxxx) xxx xxxxxxxxxxx xxxxx xxx ( -x ). x xxxxxx xxxxxxx ( [x, x) ) xxxxx xxxxxxxxxx xxxxxxxxxxx. xx xxx xxx xx xxxxxx xxxxx xxxxxxx xxxx xxx xxxxxx xx xxx xxxx; xxxx xx ( x(x) ) xxx xxxxxxx. xxxxxxxx xx xxx xx xxxx xxx xxxxxxxxx xxxxx xx: xxxx x xxxx xxxxx xxx x xxx xxxx, xx xxxxxxx xxxxx xx xx xxx xxxxx, xxxxxxx xxxxx xxxxxxxxx xxxxx xx xx xxxxx xx xxx xxx xxx xxxxxxx xxx xxxxxxxx.

This problem is only available to subscribers.

Language: C++23shortest_paths

#include <cstddef>
#include <functional>
#include <tuple>
#include <queue>
#include <utility>
#include <vector>

// ...
// ...
// ...
// ...
// ...
// ...
// ...
// ...
// ...
// ...
// ...
// ...
// ...
// ...
// ...
// ...
// ...
// ...
// ...
// ...
// ...
// ...
// ...
std::vector<long long> shortest_paths(long long n,
                                      const std::vector<std::tuple<long long, long long, long long>>& edges,
                                      long long source) {
    // ...
    (void)edges;
    (void)source;
    return std::vector<long long>(static_cast<std::size_t>(n), -1);
}

Unlock to runUpgrade

Unlock the problem to run it against the tests.