oj.uz

Submission #790093

# Submission time Handle Problem Language Result Execution time Memory
790093 2023-07-22T10:29:20 Z thimote75 Two Transportations (JOI19_transportations) C++14
100 / 100
 641 ms 48648 KB 
#include "Azer.h"
#include <bits/stdc++.h>
using namespace std;

using idata = vector<int>;
using bdata = vector<bool>;

using graph = vector<vector<pair<int, int>>>;

struct Promise
{
    int bytes, state = 0, result = 0;
    void (*func)(int);
};

struct PromiseManager
{
    deque<Promise *> promises;

    void receive(bool b)
    {
        if (promises.size() == 0)
            return;

        Promise *promise = promises.front();
        promise->result += b * (1 << promise->state);
        promise->state++;
        if (promise->state != promise->bytes)
            return;

        promise->func(promise->result);
        promises.pop_front();
        delete promise;
    }

    void add_promise(int count, void (*func)(int))
    {
        Promise *prom = new Promise();
        prom->bytes = count;
        prom->func = func;

        promises.push_back(prom);
    }
};

PromiseManager manager;

void run_dij_state(int node);
void run_chk_dist(int delta);
void run_chk_node(int node);

idata distances;
bdata discovered;

graph roads;

int last_distance = 0;
int local_delta = 0;
int local_node = 0;

int N;

void run_chk_node(int node)
{
    run_dij_state(node);
}
void run_chk_dist(int delta)
{
    if (delta <= local_delta)
    {
        local_delta = delta;
        manager.add_promise(11, run_chk_node);
    }
    else
    {
        for (int i = 0; i <= 10; i++)
            SendA(((1 << i) & local_node) != 0);

        run_dij_state(local_node);
    }
}
int stage = 0;
void run_dij_state(int node)
{
    stage++;
    distances[node] = last_distance + local_delta;
    discovered[node] = true;
    last_distance += local_delta;

    for (const auto &road : roads[node])
        distances[road.first] = min(distances[road.first], distances[node] + road.second);

    pair<int, int> best_pair = {last_distance + 502, -1};
    for (int i = 0; i < N; i++)
        if (!discovered[i])
            best_pair = min(best_pair, {distances[i], i});

    local_delta = best_pair.first - last_distance;
    local_node = best_pair.second;

    if (stage >= N)
        return;
    for (int i = 0; i <= 8; i++)
        SendA((local_delta & (1 << i)) != 0);

    manager.add_promise(9, run_chk_dist);
}

void InitA(int _N, int A, idata U, idata V, idata C)
{
    N = _N;
    distances.resize(N, 1e9);
    discovered.resize(N);
    roads.resize(N);

    for (int i = 0; i < A; i++)
    {
        roads[U[i]].push_back({V[i], C[i]});
        roads[V[i]].push_back({U[i], C[i]});
    }

    run_dij_state(0);
}

void ReceiveA(bool x)
{
    manager.receive(x);
}

idata Answer()
{
    return distances;
}

#include "Baijan.h"
#include <bits/stdc++.h>
using namespace std;

using idata = vector<int>;
using bdata = vector<bool>;

using graph = vector<vector<pair<int, int>>>;

struct Promise
{
    int bytes, state = 0, result = 0;
    void (*func)(int);
};

struct PromiseManager
{
    deque<Promise *> promises;

    void receive(bool b)
    {
        if (promises.size() == 0)
            return;

        Promise *promise = promises.front();
        promise->result += b * (1 << promise->state);
        promise->state++;
        if (promise->state != promise->bytes)
            return;

        promise->func(promise->result);
        promises.pop_front();
        delete promise;
    }

    void add_promise(int count, void (*func)(int))
    {
        Promise *prom = new Promise();
        prom->bytes = count;
        prom->func = func;

        promises.push_back(prom);
    }
};
PromiseManager manager;

void run_dij_state(int node);
void run_chk_dist(int delta);
void run_chk_node(int node);

idata distances;
bdata discovered;

graph roads;

int last_distance = 0;
int local_delta = 0;
int local_node = 0;

int N;

void run_chk_node(int node)
{
    run_dij_state(node);
}
void run_chk_dist(int delta)
{
    if (delta < local_delta)
    {
        local_delta = delta;
        manager.add_promise(11, run_chk_node);
    }
    else
    {
        for (int i = 0; i <= 10; i++)
            SendB(((1 << i) & local_node) != 0);

        run_dij_state(local_node);
    }
}
int stage = 0;
void run_dij_state(int node)
{
    stage++;
    distances[node] = last_distance + local_delta;
    discovered[node] = true;
    last_distance += local_delta;

    for (const auto &road : roads[node])
        distances[road.first] = min(distances[road.first], distances[node] + road.second);

    pair<int, int> best_pair = {last_distance + 502, -1};
    for (int i = 0; i < N; i++)
        if (!discovered[i])
            best_pair = min(best_pair, {distances[i], i});

    local_delta = best_pair.first - last_distance;
    local_node = best_pair.second;

    if (stage >= N)
        return;
    for (int i = 0; i <= 8; i++)
        SendB((local_delta & (1 << i)) != 0);

    manager.add_promise(9, run_chk_dist);
}

void InitB(int _N, int A, idata U, idata V, idata C)
{
    N = _N;
    distances.resize(N, 1e9);
    discovered.resize(N);
    roads.resize(N);

    for (int i = 0; i < A; i++)
    {
        roads[U[i]].push_back({V[i], C[i]});
        roads[V[i]].push_back({U[i], C[i]});
    }

    run_dij_state(0);
}

void ReceiveB(bool x)
{
    manager.receive(x);
}

idata Answer()
{
    return distances;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 472 ms 796 KB Output is correct
2 Correct 0 ms 400 KB Output is correct
3 Correct 406 ms 788 KB Output is correct
4 Correct 453 ms 10148 KB Output is correct
5 Correct 24 ms 656 KB Output is correct
6 Correct 432 ms 2148 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 400 KB Output is correct
2 Correct 449 ms 744 KB Output is correct
3 Correct 349 ms 796 KB Output is correct
4 Correct 503 ms 27480 KB Output is correct
5 Correct 616 ms 24084 KB Output is correct
6 Correct 77 ms 616 KB Output is correct
7 Correct 505 ms 24220 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 432 ms 732 KB Output is correct
2 Correct 0 ms 400 KB Output is correct
3 Correct 472 ms 660 KB Output is correct
4 Correct 503 ms 744 KB Output is correct
5 Correct 447 ms 744 KB Output is correct
6 Correct 410 ms 732 KB Output is correct
7 Correct 468 ms 740 KB Output is correct
8 Correct 275 ms 664 KB Output is correct
9 Correct 417 ms 668 KB Output is correct
10 Correct 458 ms 784 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 177 ms 656 KB Output is correct
2 Correct 153 ms 528 KB Output is correct
3 Correct 238 ms 13348 KB Output is correct
4 Correct 166 ms 656 KB Output is correct
5 Correct 178 ms 9944 KB Output is correct
6 Correct 202 ms 664 KB Output is correct
7 Correct 178 ms 656 KB Output is correct
8 Correct 192 ms 656 KB Output is correct
9 Correct 247 ms 18084 KB Output is correct
10 Correct 326 ms 18112 KB Output is correct
11 Correct 377 ms 35640 KB Output is correct
12 Correct 273 ms 30624 KB Output is correct
13 Correct 180 ms 656 KB Output is correct
14 Correct 0 ms 400 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 177 ms 656 KB Output is correct
2 Correct 153 ms 528 KB Output is correct
3 Correct 238 ms 13348 KB Output is correct
4 Correct 166 ms 656 KB Output is correct
5 Correct 178 ms 9944 KB Output is correct
6 Correct 202 ms 664 KB Output is correct
7 Correct 178 ms 656 KB Output is correct
8 Correct 192 ms 656 KB Output is correct
9 Correct 247 ms 18084 KB Output is correct
10 Correct 326 ms 18112 KB Output is correct
11 Correct 377 ms 35640 KB Output is correct
12 Correct 273 ms 30624 KB Output is correct
13 Correct 180 ms 656 KB Output is correct
14 Correct 0 ms 400 KB Output is correct
15 Correct 241 ms 656 KB Output is correct
16 Correct 226 ms 528 KB Output is correct
17 Correct 240 ms 528 KB Output is correct
18 Correct 273 ms 10012 KB Output is correct
19 Correct 245 ms 656 KB Output is correct
20 Correct 295 ms 10224 KB Output is correct
21 Correct 257 ms 656 KB Output is correct
22 Correct 208 ms 712 KB Output is correct
23 Correct 304 ms 22000 KB Output is correct
24 Correct 323 ms 22084 KB Output is correct
25 Correct 423 ms 43416 KB Output is correct
26 Correct 413 ms 36412 KB Output is correct
27 Correct 260 ms 656 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 177 ms 656 KB Output is correct
2 Correct 153 ms 528 KB Output is correct
3 Correct 238 ms 13348 KB Output is correct
4 Correct 166 ms 656 KB Output is correct
5 Correct 178 ms 9944 KB Output is correct
6 Correct 202 ms 664 KB Output is correct
7 Correct 178 ms 656 KB Output is correct
8 Correct 192 ms 656 KB Output is correct
9 Correct 247 ms 18084 KB Output is correct
10 Correct 326 ms 18112 KB Output is correct
11 Correct 377 ms 35640 KB Output is correct
12 Correct 273 ms 30624 KB Output is correct
13 Correct 180 ms 656 KB Output is correct
14 Correct 0 ms 400 KB Output is correct
15 Correct 241 ms 656 KB Output is correct
16 Correct 226 ms 528 KB Output is correct
17 Correct 240 ms 528 KB Output is correct
18 Correct 273 ms 10012 KB Output is correct
19 Correct 245 ms 656 KB Output is correct
20 Correct 295 ms 10224 KB Output is correct
21 Correct 257 ms 656 KB Output is correct
22 Correct 208 ms 712 KB Output is correct
23 Correct 304 ms 22000 KB Output is correct
24 Correct 323 ms 22084 KB Output is correct
25 Correct 423 ms 43416 KB Output is correct
26 Correct 413 ms 36412 KB Output is correct
27 Correct 260 ms 656 KB Output is correct
28 Correct 304 ms 656 KB Output is correct
29 Correct 288 ms 652 KB Output is correct
30 Correct 339 ms 24224 KB Output is correct
31 Correct 274 ms 656 KB Output is correct
32 Correct 393 ms 21076 KB Output is correct
33 Correct 339 ms 656 KB Output is correct
34 Correct 352 ms 748 KB Output is correct
35 Correct 289 ms 756 KB Output is correct
36 Correct 408 ms 24592 KB Output is correct
37 Correct 338 ms 24640 KB Output is correct
38 Correct 592 ms 48648 KB Output is correct
39 Correct 530 ms 44024 KB Output is correct
40 Correct 311 ms 784 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 472 ms 796 KB Output is correct
2 Correct 0 ms 400 KB Output is correct
3 Correct 406 ms 788 KB Output is correct
4 Correct 453 ms 10148 KB Output is correct
5 Correct 24 ms 656 KB Output is correct
6 Correct 432 ms 2148 KB Output is correct
7 Correct 0 ms 400 KB Output is correct
8 Correct 449 ms 744 KB Output is correct
9 Correct 349 ms 796 KB Output is correct
10 Correct 503 ms 27480 KB Output is correct
11 Correct 616 ms 24084 KB Output is correct
12 Correct 77 ms 616 KB Output is correct
13 Correct 505 ms 24220 KB Output is correct
14 Correct 432 ms 732 KB Output is correct
15 Correct 0 ms 400 KB Output is correct
16 Correct 472 ms 660 KB Output is correct
17 Correct 503 ms 744 KB Output is correct
18 Correct 447 ms 744 KB Output is correct
19 Correct 410 ms 732 KB Output is correct
20 Correct 468 ms 740 KB Output is correct
21 Correct 275 ms 664 KB Output is correct
22 Correct 417 ms 668 KB Output is correct
23 Correct 458 ms 784 KB Output is correct
24 Correct 177 ms 656 KB Output is correct
25 Correct 153 ms 528 KB Output is correct
26 Correct 238 ms 13348 KB Output is correct
27 Correct 166 ms 656 KB Output is correct
28 Correct 178 ms 9944 KB Output is correct
29 Correct 202 ms 664 KB Output is correct
30 Correct 178 ms 656 KB Output is correct
31 Correct 192 ms 656 KB Output is correct
32 Correct 247 ms 18084 KB Output is correct
33 Correct 326 ms 18112 KB Output is correct
34 Correct 377 ms 35640 KB Output is correct
35 Correct 273 ms 30624 KB Output is correct
36 Correct 180 ms 656 KB Output is correct
37 Correct 0 ms 400 KB Output is correct
38 Correct 241 ms 656 KB Output is correct
39 Correct 226 ms 528 KB Output is correct
40 Correct 240 ms 528 KB Output is correct
41 Correct 273 ms 10012 KB Output is correct
42 Correct 245 ms 656 KB Output is correct
43 Correct 295 ms 10224 KB Output is correct
44 Correct 257 ms 656 KB Output is correct
45 Correct 208 ms 712 KB Output is correct
46 Correct 304 ms 22000 KB Output is correct
47 Correct 323 ms 22084 KB Output is correct
48 Correct 423 ms 43416 KB Output is correct
49 Correct 413 ms 36412 KB Output is correct
50 Correct 260 ms 656 KB Output is correct
51 Correct 304 ms 656 KB Output is correct
52 Correct 288 ms 652 KB Output is correct
53 Correct 339 ms 24224 KB Output is correct
54 Correct 274 ms 656 KB Output is correct
55 Correct 393 ms 21076 KB Output is correct
56 Correct 339 ms 656 KB Output is correct
57 Correct 352 ms 748 KB Output is correct
58 Correct 289 ms 756 KB Output is correct
59 Correct 408 ms 24592 KB Output is correct
60 Correct 338 ms 24640 KB Output is correct
61 Correct 592 ms 48648 KB Output is correct
62 Correct 530 ms 44024 KB Output is correct
63 Correct 311 ms 784 KB Output is correct
64 Correct 422 ms 952 KB Output is correct
65 Correct 515 ms 26644 KB Output is correct
66 Correct 441 ms 23336 KB Output is correct
67 Correct 376 ms 1032 KB Output is correct
68 Correct 403 ms 932 KB Output is correct
69 Correct 641 ms 47648 KB Output is correct
70 Correct 587 ms 39448 KB Output is correct
71 Correct 488 ms 4952 KB Output is correct
72 Correct 408 ms 1168 KB Output is correct