oj.uz

Submission #790088

# Submission time Handle Problem Language Result Execution time Memory
790088 2023-07-22T10:25:24 Z thimote75 Two Transportations (JOI19_transportations) C++14
6 / 100
 518 ms 10140 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 416 ms 788 KB Output is correct
2 Correct 1 ms 400 KB Output is correct
3 Correct 339 ms 784 KB Output is correct
4 Correct 518 ms 10140 KB Output is correct
5 Correct 28 ms 656 KB Output is correct
6 Correct 427 ms 2200 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 400 KB Output is correct
2 Correct 459 ms 740 KB Output is correct
3 Incorrect 4 ms 784 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 724 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 664 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 664 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 664 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 416 ms 788 KB Output is correct
2 Correct 1 ms 400 KB Output is correct
3 Correct 339 ms 784 KB Output is correct
4 Correct 518 ms 10140 KB Output is correct
5 Correct 28 ms 656 KB Output is correct
6 Correct 427 ms 2200 KB Output is correct
7 Correct 2 ms 400 KB Output is correct
8 Correct 459 ms 740 KB Output is correct
9 Incorrect 4 ms 784 KB Output isn't correct
10 Halted 0 ms 0 KB -