# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
748034 | finn__ | Two Transportations (JOI19_transportations) | C++17 | 756 ms | 48964 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "Azer.h"
#include <vector>
#include <queue>
#include <cstdlib>
/*
status: 0 -> initialize round
1 -> receive distance
2 -> distance received
3 -> receive node
4 -> node received
*/
namespace azer // neccessary to avoid naming conflicts :(
{
std::vector<std::vector<std::pair<int, int>>> g;
std::priority_queue<std::pair<int, int>, std::vector<std::pair<int, int>>, std::greater<std::pair<int, int>>> q;
std::vector<int> d;
std::vector<bool> finished;
size_t iterations, receive_iterations;
int max_fixed_distance, status, receive_buffer, next_distance;
void process_node(int u)
{
finished[u] = 1;
max_fixed_distance = std::max(max_fixed_distance, d[u]);
for (auto const &[v, w] : g[u])
if (d[u] + w < d[v])
{
d[v] = d[u] + w;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |