oj.uz

답안 #748034

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
748034 2023-05-25T10:23:08 Z finn__ Two Transportations (JOI19_transportations) C++17
100 / 100
 756 ms 48964 KB 
#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;
                q.emplace(d[v], v);
            }
    }

    void send_int(int x, size_t num_bits)
    {
        for (size_t i = 0; i < num_bits; ++i)
            SendA((x >> i) & 1);
    }

    void send_current_best()
    {
        while (!q.empty() && (d[q.top().second] != q.top().first || finished[q.top().second]))
            q.pop();
        if (q.empty())
            send_int(511, 9);
        else
            send_int(q.top().first - max_fixed_distance, 9);
    }
}

void InitA(int N, int A, std::vector<int> U, std::vector<int> V, std::vector<int> C)
{
    azer::g.resize(N);
    for (size_t i = 0; i < A; ++i)
        azer::g[U[i]].emplace_back(V[i], C[i]), azer::g[V[i]].emplace_back(U[i], C[i]);
    azer::d.resize(N);
    azer::finished.resize(N);
    fill(azer::d.begin() + 1, azer::d.end(), 1000001);
    azer::process_node(0);
    azer::iterations = 1;
    if (azer::iterations < N)
        azer::send_current_best();
    azer::status = 1;
}

void ReceiveA(bool x)
{
    if (!azer::status)
    {
        azer::send_current_best();
        azer::receive_buffer = azer::receive_iterations = 0;
        azer::status = 1;
    }
    else if (azer::status == 1)
    {
        azer::receive_buffer |= x << azer::receive_iterations;
        azer::receive_iterations++;
        if (azer::receive_iterations == 9)
        {
            azer::status = 2;
            ReceiveA(0);
        }
    }
    else if (azer::status == 2)
    {
        if (azer::receive_buffer == 511)
        {
            if (azer::q.empty())
                exit(1);
            azer::send_int(azer::q.top().second, 11);
            azer::next_distance = azer::q.top().first;
            azer::receive_buffer = azer::q.top().second;
            azer::q.pop();
            azer::status = 4;
            ReceiveA(0);
        }
        else
        {
            azer::next_distance = azer::max_fixed_distance + azer::receive_buffer;
            azer::receive_buffer = azer::receive_iterations = 0;
            azer::status = 3;
        }
    }
    else if (azer::status == 3)
    {
        azer::receive_buffer |= x << azer::receive_iterations;
        azer::receive_iterations++;
        if (azer::receive_iterations == 11)
        {
            azer::status = 4;
            ReceiveA(0);
        }
    }
    else
    {
        azer::d[azer::receive_buffer] = azer::next_distance;
        azer::process_node(azer::receive_buffer);
        ++azer::iterations;
        if (azer::iterations < azer::g.size())
        {
            azer::status = 0;
            ReceiveA(0);
        }
    }
}

std::vector<int> Answer() { return azer::d; }
#include "Baijan.h"
#include <vector>
#include <queue>

namespace baijan
{
    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 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;
                q.emplace(d[v], v);
            }
    }

    void send_int(int x, size_t num_bits)
    {
        for (size_t i = 0; i < num_bits; ++i)
            SendB((x >> i) & 1);
    }
}

void InitB(int N, int B, std::vector<int> S, std::vector<int> T, std::vector<int> D)
{
    baijan::g.resize(N);
    for (size_t i = 0; i < B; ++i)
        baijan::g[S[i]].emplace_back(T[i], D[i]), baijan::g[T[i]].emplace_back(S[i], D[i]);
    baijan::d.resize(N);
    baijan::finished.resize(N);
    fill(baijan::d.begin() + 1, baijan::d.end(), 1000001);
    baijan::process_node(0);
    baijan::status = 1;
}

void ReceiveB(bool y)
{
    if (!baijan::status)
    {
        baijan::receive_buffer = baijan::receive_iterations = 0;
        baijan::status = 1;
    }
    else if (baijan::status == 1)
    {
        baijan::receive_buffer |= y << baijan::receive_iterations;
        baijan::receive_iterations++;
        if (baijan::receive_iterations == 9)
        {
            baijan::status = 2;
            ReceiveB(0);
        }
    }
    else if (baijan::status == 2)
    {
        while (!baijan::q.empty() &&
               (baijan::d[baijan::q.top().second] != baijan::q.top().first ||
                baijan::finished[baijan::q.top().second]))
            baijan::q.pop();
        if (!baijan::q.empty() &&
            baijan::q.top().first < baijan::max_fixed_distance + baijan::receive_buffer)
        {
            baijan::send_int(baijan::q.top().first - baijan::max_fixed_distance, 9);
            baijan::send_int(baijan::q.top().second, 11);
            baijan::next_distance = baijan::q.top().first;
            baijan::receive_buffer = baijan::q.top().second;
            baijan::q.pop();
            baijan::status = 4;
            ReceiveB(0);
        }
        else
        {
            baijan::send_int(511, 9);
            baijan::next_distance = baijan::max_fixed_distance + baijan::receive_buffer;
            baijan::receive_buffer = baijan::receive_iterations = 0;
            baijan::status = 3;
        }
    }
    else if (baijan::status == 3)
    {
        baijan::receive_buffer |= y << baijan::receive_iterations;
        baijan::receive_iterations++;
        if (baijan::receive_iterations == 11)
        {
            baijan::status = 4;
            ReceiveB(0);
        }
    }
    else
    {
        baijan::d[baijan::receive_buffer] = baijan::next_distance;
        baijan::process_node(baijan::receive_buffer);
        baijan::status = 0;
        ReceiveB(0);
    }
}

Compilation message

Azer.cpp: In function 'void InitA(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
Azer.cpp:55:26: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   55 |     for (size_t i = 0; i < A; ++i)
      |                        ~~^~~
Azer.cpp:62:26: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   62 |     if (azer::iterations < N)
      |         ~~~~~~~~~~~~~~~~~^~~

Baijan.cpp: In function 'void InitB(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
Baijan.cpp:36:26: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |     for (size_t i = 0; i < B; ++i)
      |                        ~~^~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 426 ms 652 KB Output is correct
2 Correct 0 ms 400 KB Output is correct
3 Correct 577 ms 784 KB Output is correct
4 Correct 620 ms 10044 KB Output is correct
5 Correct 25 ms 656 KB Output is correct
6 Correct 580 ms 2104 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 400 KB Output is correct
2 Correct 507 ms 736 KB Output is correct
3 Correct 568 ms 784 KB Output is correct
4 Correct 644 ms 27512 KB Output is correct
5 Correct 617 ms 24132 KB Output is correct
6 Correct 102 ms 528 KB Output is correct
7 Correct 566 ms 24320 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 540 ms 708 KB Output is correct
2 Correct 0 ms 400 KB Output is correct
3 Correct 492 ms 752 KB Output is correct
4 Correct 401 ms 736 KB Output is correct
5 Correct 476 ms 732 KB Output is correct
6 Correct 570 ms 788 KB Output is correct
7 Correct 502 ms 728 KB Output is correct
8 Correct 453 ms 656 KB Output is correct
9 Correct 441 ms 656 KB Output is correct
10 Correct 403 ms 784 KB Output is correct

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 234 ms 656 KB Output is correct
2 Correct 210 ms 612 KB Output is correct
3 Correct 323 ms 13244 KB Output is correct
4 Correct 193 ms 656 KB Output is correct
5 Correct 240 ms 9916 KB Output is correct
6 Correct 213 ms 656 KB Output is correct
7 Correct 189 ms 656 KB Output is correct
8 Correct 159 ms 684 KB Output is correct
9 Correct 359 ms 17964 KB Output is correct
10 Correct 316 ms 18108 KB Output is correct
11 Correct 389 ms 35628 KB Output is correct
12 Correct 285 ms 30664 KB Output is correct
13 Correct 230 ms 656 KB Output is correct
14 Correct 0 ms 400 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 234 ms 656 KB Output is correct
2 Correct 210 ms 612 KB Output is correct
3 Correct 323 ms 13244 KB Output is correct
4 Correct 193 ms 656 KB Output is correct
5 Correct 240 ms 9916 KB Output is correct
6 Correct 213 ms 656 KB Output is correct
7 Correct 189 ms 656 KB Output is correct
8 Correct 159 ms 684 KB Output is correct
9 Correct 359 ms 17964 KB Output is correct
10 Correct 316 ms 18108 KB Output is correct
11 Correct 389 ms 35628 KB Output is correct
12 Correct 285 ms 30664 KB Output is correct
13 Correct 230 ms 656 KB Output is correct
14 Correct 0 ms 400 KB Output is correct
15 Correct 304 ms 656 KB Output is correct
16 Correct 309 ms 528 KB Output is correct
17 Correct 230 ms 528 KB Output is correct
18 Correct 346 ms 9864 KB Output is correct
19 Correct 224 ms 684 KB Output is correct
20 Correct 297 ms 10244 KB Output is correct
21 Correct 187 ms 704 KB Output is correct
22 Correct 248 ms 708 KB Output is correct
23 Correct 345 ms 22024 KB Output is correct
24 Correct 332 ms 22064 KB Output is correct
25 Correct 389 ms 43644 KB Output is correct
26 Correct 428 ms 36540 KB Output is correct
27 Correct 243 ms 724 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 234 ms 656 KB Output is correct
2 Correct 210 ms 612 KB Output is correct
3 Correct 323 ms 13244 KB Output is correct
4 Correct 193 ms 656 KB Output is correct
5 Correct 240 ms 9916 KB Output is correct
6 Correct 213 ms 656 KB Output is correct
7 Correct 189 ms 656 KB Output is correct
8 Correct 159 ms 684 KB Output is correct
9 Correct 359 ms 17964 KB Output is correct
10 Correct 316 ms 18108 KB Output is correct
11 Correct 389 ms 35628 KB Output is correct
12 Correct 285 ms 30664 KB Output is correct
13 Correct 230 ms 656 KB Output is correct
14 Correct 0 ms 400 KB Output is correct
15 Correct 304 ms 656 KB Output is correct
16 Correct 309 ms 528 KB Output is correct
17 Correct 230 ms 528 KB Output is correct
18 Correct 346 ms 9864 KB Output is correct
19 Correct 224 ms 684 KB Output is correct
20 Correct 297 ms 10244 KB Output is correct
21 Correct 187 ms 704 KB Output is correct
22 Correct 248 ms 708 KB Output is correct
23 Correct 345 ms 22024 KB Output is correct
24 Correct 332 ms 22064 KB Output is correct
25 Correct 389 ms 43644 KB Output is correct
26 Correct 428 ms 36540 KB Output is correct
27 Correct 243 ms 724 KB Output is correct
28 Correct 341 ms 668 KB Output is correct
29 Correct 357 ms 488 KB Output is correct
30 Correct 350 ms 23828 KB Output is correct
31 Correct 297 ms 636 KB Output is correct
32 Correct 399 ms 21036 KB Output is correct
33 Correct 343 ms 708 KB Output is correct
34 Correct 341 ms 736 KB Output is correct
35 Correct 305 ms 748 KB Output is correct
36 Correct 335 ms 24560 KB Output is correct
37 Correct 479 ms 24768 KB Output is correct
38 Correct 582 ms 48964 KB Output is correct
39 Correct 492 ms 44028 KB Output is correct
40 Correct 395 ms 752 KB Output is correct

Subtask #7
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 426 ms 652 KB Output is correct
2 Correct 0 ms 400 KB Output is correct
3 Correct 577 ms 784 KB Output is correct
4 Correct 620 ms 10044 KB Output is correct
5 Correct 25 ms 656 KB Output is correct
6 Correct 580 ms 2104 KB Output is correct
7 Correct 0 ms 400 KB Output is correct
8 Correct 507 ms 736 KB Output is correct
9 Correct 568 ms 784 KB Output is correct
10 Correct 644 ms 27512 KB Output is correct
11 Correct 617 ms 24132 KB Output is correct
12 Correct 102 ms 528 KB Output is correct
13 Correct 566 ms 24320 KB Output is correct
14 Correct 540 ms 708 KB Output is correct
15 Correct 0 ms 400 KB Output is correct
16 Correct 492 ms 752 KB Output is correct
17 Correct 401 ms 736 KB Output is correct
18 Correct 476 ms 732 KB Output is correct
19 Correct 570 ms 788 KB Output is correct
20 Correct 502 ms 728 KB Output is correct
21 Correct 453 ms 656 KB Output is correct
22 Correct 441 ms 656 KB Output is correct
23 Correct 403 ms 784 KB Output is correct
24 Correct 234 ms 656 KB Output is correct
25 Correct 210 ms 612 KB Output is correct
26 Correct 323 ms 13244 KB Output is correct
27 Correct 193 ms 656 KB Output is correct
28 Correct 240 ms 9916 KB Output is correct
29 Correct 213 ms 656 KB Output is correct
30 Correct 189 ms 656 KB Output is correct
31 Correct 159 ms 684 KB Output is correct
32 Correct 359 ms 17964 KB Output is correct
33 Correct 316 ms 18108 KB Output is correct
34 Correct 389 ms 35628 KB Output is correct
35 Correct 285 ms 30664 KB Output is correct
36 Correct 230 ms 656 KB Output is correct
37 Correct 0 ms 400 KB Output is correct
38 Correct 304 ms 656 KB Output is correct
39 Correct 309 ms 528 KB Output is correct
40 Correct 230 ms 528 KB Output is correct
41 Correct 346 ms 9864 KB Output is correct
42 Correct 224 ms 684 KB Output is correct
43 Correct 297 ms 10244 KB Output is correct
44 Correct 187 ms 704 KB Output is correct
45 Correct 248 ms 708 KB Output is correct
46 Correct 345 ms 22024 KB Output is correct
47 Correct 332 ms 22064 KB Output is correct
48 Correct 389 ms 43644 KB Output is correct
49 Correct 428 ms 36540 KB Output is correct
50 Correct 243 ms 724 KB Output is correct
51 Correct 341 ms 668 KB Output is correct
52 Correct 357 ms 488 KB Output is correct
53 Correct 350 ms 23828 KB Output is correct
54 Correct 297 ms 636 KB Output is correct
55 Correct 399 ms 21036 KB Output is correct
56 Correct 343 ms 708 KB Output is correct
57 Correct 341 ms 736 KB Output is correct
58 Correct 305 ms 748 KB Output is correct
59 Correct 335 ms 24560 KB Output is correct
60 Correct 479 ms 24768 KB Output is correct
61 Correct 582 ms 48964 KB Output is correct
62 Correct 492 ms 44028 KB Output is correct
63 Correct 395 ms 752 KB Output is correct
64 Correct 516 ms 968 KB Output is correct
65 Correct 591 ms 26496 KB Output is correct
66 Correct 435 ms 23420 KB Output is correct
67 Correct 433 ms 924 KB Output is correct
68 Correct 470 ms 916 KB Output is correct
69 Correct 756 ms 47412 KB Output is correct
70 Correct 629 ms 39468 KB Output is correct
71 Correct 455 ms 4904 KB Output is correct
72 Correct 390 ms 980 KB Output is correct