oj.uz

Submission #266606

# Submission time Handle Problem Language Result Execution time Memory
266606 2020-08-15T11:28:12 Z dolphingarlic Two Transportations (JOI19_transportations) C++14
100 / 100
 2664 ms 112944 KB 
#include "Azer.h"

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

namespace {
int N, stage = 0, cnt, b_shortest, mx_so_far;
vector<pair<int, int>> graph[2000];
vector<int> shortest;
priority_queue<pair<int, int>> pq;
bool visited[2000];
pair<int, int> cand = {0, 0};

void reset() {
    visited[cand.second] = true;
    shortest[cand.second] = cand.first;
    mx_so_far = cand.first;
    for (pair<int, int> i : graph[cand.second])
        pq.push({-cand.first - i.second, i.first});
    N--;

    if (!N) return;

    while (pq.size() && visited[pq.top().second]) pq.pop();
    if (pq.size()) cand = {-pq.top().first, pq.top().second};
    else cand = {mx_so_far + 511, -1};

    for (int i = 0; i < 9; i++) SendA(((cand.first - mx_so_far) & (1 << i)) >> i);
    cnt = stage = b_shortest = 0;
}
}  // namespace

void InitA(int N, int A, vector<int> U, vector<int> V, vector<int> C) {
    ::N = N;
    shortest.resize(N);
    for (int i = 0; i < A; i++) {
        graph[U[i]].push_back({V[i], C[i]});
        graph[V[i]].push_back({U[i], C[i]});
    }
    reset();
}

void ReceiveA(bool x) {
    if (stage == 0) {
        b_shortest |= x << cnt++;
        if (cnt == 9) {
            if (b_shortest == 511) {
                for (int i = 0; i < 11; i++) SendA((cand.second & (1 << i)) >> i);
                reset();
            } else {
                stage++;
                cand = {mx_so_far + b_shortest, 0};
                cnt = 0;
            }
        }
    } else {
        cand.second |= x << cnt++;
        if (cnt == 11) reset();
    }
}

vector<int> Answer() {
    return shortest;
}

#include "Baijan.h"

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

namespace {
int N, stage = 0, cnt, a_shortest, mx_so_far;
vector<pair<int, int>> graph[2000];
vector<int> shortest;
priority_queue<pair<int, int>> pq;
bool visited[2000];
pair<int, int> cand = {0, 0};

void reset() {
    visited[cand.second] = true;
    shortest[cand.second] = cand.first;
    mx_so_far = cand.first;
    for (pair<int, int> i : graph[cand.second])
        pq.push({-cand.first - i.second, i.first});

    while (pq.size() && visited[pq.top().second]) pq.pop();
    if (pq.size()) cand = {-pq.top().first, pq.top().second};
    else cand = {mx_so_far + 511, -1};

    cnt = stage = a_shortest = 0;
}
}  // namespace

void InitB(int N, int B, vector<int> S, vector<int> T, vector<int> D) {
    ::N = N;
    shortest.resize(N);
    for (int i = 0; i < B; i++) {
        graph[S[i]].push_back({T[i], D[i]});
        graph[T[i]].push_back({S[i], D[i]});
    }
    reset();
}

void ReceiveB(bool y) {
    if (stage == 0) {
        a_shortest |= y << cnt++;
        if (cnt == 9) {
            if (a_shortest > cand.first - mx_so_far) {
                for (int i = 0; i < 9; i++) SendB(((cand.first - mx_so_far) & (1 << i)) >> i);
                for (int i = 0; i < 11; i++) SendB((cand.second & (1 << i)) >> i);
                reset();
            } else {
                for (int i = 0; i < 9; i++) SendB(1);
                cnt = 0;
                cand = {a_shortest + mx_so_far, 0};
                stage++;
            }
        }
    } else if (stage == 1) {
        cand.second |= y << cnt++;
        if (cnt == 11) reset();
    }
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1034 ms 1576 KB Output is correct
2 Correct 4 ms 1536 KB Output is correct
3 Correct 976 ms 1568 KB Output is correct
4 Correct 1016 ms 20280 KB Output is correct
5 Correct 58 ms 2272 KB Output is correct
6 Correct 1030 ms 5424 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1608 KB Output is correct
2 Correct 1442 ms 1760 KB Output is correct
3 Correct 1038 ms 1792 KB Output is correct
4 Correct 1800 ms 55144 KB Output is correct
5 Correct 1368 ms 57448 KB Output is correct
6 Correct 218 ms 1696 KB Output is correct
7 Correct 1442 ms 57864 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 964 ms 1664 KB Output is correct
2 Correct 2 ms 1280 KB Output is correct
3 Correct 910 ms 1536 KB Output is correct
4 Correct 1018 ms 1536 KB Output is correct
5 Correct 1104 ms 1536 KB Output is correct
6 Correct 994 ms 1760 KB Output is correct
7 Correct 926 ms 1536 KB Output is correct
8 Correct 990 ms 1728 KB Output is correct
9 Correct 1042 ms 1536 KB Output is correct
10 Correct 954 ms 1568 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 494 ms 1792 KB Output is correct
2 Correct 346 ms 1592 KB Output is correct
3 Correct 776 ms 24856 KB Output is correct
4 Correct 484 ms 1536 KB Output is correct
5 Correct 714 ms 17456 KB Output is correct
6 Correct 376 ms 1536 KB Output is correct
7 Correct 474 ms 1536 KB Output is correct
8 Correct 448 ms 1536 KB Output is correct
9 Correct 830 ms 47280 KB Output is correct
10 Correct 1206 ms 47152 KB Output is correct
11 Correct 1616 ms 85176 KB Output is correct
12 Correct 1396 ms 79616 KB Output is correct
13 Correct 606 ms 1760 KB Output is correct
14 Correct 2 ms 1280 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 494 ms 1792 KB Output is correct
2 Correct 346 ms 1592 KB Output is correct
3 Correct 776 ms 24856 KB Output is correct
4 Correct 484 ms 1536 KB Output is correct
5 Correct 714 ms 17456 KB Output is correct
6 Correct 376 ms 1536 KB Output is correct
7 Correct 474 ms 1536 KB Output is correct
8 Correct 448 ms 1536 KB Output is correct
9 Correct 830 ms 47280 KB Output is correct
10 Correct 1206 ms 47152 KB Output is correct
11 Correct 1616 ms 85176 KB Output is correct
12 Correct 1396 ms 79616 KB Output is correct
13 Correct 606 ms 1760 KB Output is correct
14 Correct 2 ms 1280 KB Output is correct
15 Correct 698 ms 1536 KB Output is correct
16 Correct 430 ms 1536 KB Output is correct
17 Correct 590 ms 1536 KB Output is correct
18 Correct 876 ms 17528 KB Output is correct
19 Correct 666 ms 1536 KB Output is correct
20 Correct 870 ms 18224 KB Output is correct
21 Correct 734 ms 1560 KB Output is correct
22 Correct 588 ms 1536 KB Output is correct
23 Correct 1026 ms 52512 KB Output is correct
24 Correct 1444 ms 52728 KB Output is correct
25 Correct 1814 ms 103096 KB Output is correct
26 Correct 1570 ms 89440 KB Output is correct
27 Correct 694 ms 1816 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 494 ms 1792 KB Output is correct
2 Correct 346 ms 1592 KB Output is correct
3 Correct 776 ms 24856 KB Output is correct
4 Correct 484 ms 1536 KB Output is correct
5 Correct 714 ms 17456 KB Output is correct
6 Correct 376 ms 1536 KB Output is correct
7 Correct 474 ms 1536 KB Output is correct
8 Correct 448 ms 1536 KB Output is correct
9 Correct 830 ms 47280 KB Output is correct
10 Correct 1206 ms 47152 KB Output is correct
11 Correct 1616 ms 85176 KB Output is correct
12 Correct 1396 ms 79616 KB Output is correct
13 Correct 606 ms 1760 KB Output is correct
14 Correct 2 ms 1280 KB Output is correct
15 Correct 698 ms 1536 KB Output is correct
16 Correct 430 ms 1536 KB Output is correct
17 Correct 590 ms 1536 KB Output is correct
18 Correct 876 ms 17528 KB Output is correct
19 Correct 666 ms 1536 KB Output is correct
20 Correct 870 ms 18224 KB Output is correct
21 Correct 734 ms 1560 KB Output is correct
22 Correct 588 ms 1536 KB Output is correct
23 Correct 1026 ms 52512 KB Output is correct
24 Correct 1444 ms 52728 KB Output is correct
25 Correct 1814 ms 103096 KB Output is correct
26 Correct 1570 ms 89440 KB Output is correct
27 Correct 694 ms 1816 KB Output is correct
28 Correct 631 ms 1640 KB Output is correct
29 Correct 766 ms 1768 KB Output is correct
30 Correct 1518 ms 44360 KB Output is correct
31 Correct 560 ms 1504 KB Output is correct
32 Correct 1458 ms 37504 KB Output is correct
33 Correct 808 ms 1672 KB Output is correct
34 Correct 763 ms 1792 KB Output is correct
35 Correct 948 ms 1816 KB Output is correct
36 Correct 1318 ms 58168 KB Output is correct
37 Correct 1452 ms 57912 KB Output is correct
38 Correct 2094 ms 112944 KB Output is correct
39 Correct 1950 ms 102672 KB Output is correct
40 Correct 712 ms 2744 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1034 ms 1576 KB Output is correct
2 Correct 4 ms 1536 KB Output is correct
3 Correct 976 ms 1568 KB Output is correct
4 Correct 1016 ms 20280 KB Output is correct
5 Correct 58 ms 2272 KB Output is correct
6 Correct 1030 ms 5424 KB Output is correct
7 Correct 2 ms 1608 KB Output is correct
8 Correct 1442 ms 1760 KB Output is correct
9 Correct 1038 ms 1792 KB Output is correct
10 Correct 1800 ms 55144 KB Output is correct
11 Correct 1368 ms 57448 KB Output is correct
12 Correct 218 ms 1696 KB Output is correct
13 Correct 1442 ms 57864 KB Output is correct
14 Correct 964 ms 1664 KB Output is correct
15 Correct 2 ms 1280 KB Output is correct
16 Correct 910 ms 1536 KB Output is correct
17 Correct 1018 ms 1536 KB Output is correct
18 Correct 1104 ms 1536 KB Output is correct
19 Correct 994 ms 1760 KB Output is correct
20 Correct 926 ms 1536 KB Output is correct
21 Correct 990 ms 1728 KB Output is correct
22 Correct 1042 ms 1536 KB Output is correct
23 Correct 954 ms 1568 KB Output is correct
24 Correct 494 ms 1792 KB Output is correct
25 Correct 346 ms 1592 KB Output is correct
26 Correct 776 ms 24856 KB Output is correct
27 Correct 484 ms 1536 KB Output is correct
28 Correct 714 ms 17456 KB Output is correct
29 Correct 376 ms 1536 KB Output is correct
30 Correct 474 ms 1536 KB Output is correct
31 Correct 448 ms 1536 KB Output is correct
32 Correct 830 ms 47280 KB Output is correct
33 Correct 1206 ms 47152 KB Output is correct
34 Correct 1616 ms 85176 KB Output is correct
35 Correct 1396 ms 79616 KB Output is correct
36 Correct 606 ms 1760 KB Output is correct
37 Correct 2 ms 1280 KB Output is correct
38 Correct 698 ms 1536 KB Output is correct
39 Correct 430 ms 1536 KB Output is correct
40 Correct 590 ms 1536 KB Output is correct
41 Correct 876 ms 17528 KB Output is correct
42 Correct 666 ms 1536 KB Output is correct
43 Correct 870 ms 18224 KB Output is correct
44 Correct 734 ms 1560 KB Output is correct
45 Correct 588 ms 1536 KB Output is correct
46 Correct 1026 ms 52512 KB Output is correct
47 Correct 1444 ms 52728 KB Output is correct
48 Correct 1814 ms 103096 KB Output is correct
49 Correct 1570 ms 89440 KB Output is correct
50 Correct 694 ms 1816 KB Output is correct
51 Correct 631 ms 1640 KB Output is correct
52 Correct 766 ms 1768 KB Output is correct
53 Correct 1518 ms 44360 KB Output is correct
54 Correct 560 ms 1504 KB Output is correct
55 Correct 1458 ms 37504 KB Output is correct
56 Correct 808 ms 1672 KB Output is correct
57 Correct 763 ms 1792 KB Output is correct
58 Correct 948 ms 1816 KB Output is correct
59 Correct 1318 ms 58168 KB Output is correct
60 Correct 1452 ms 57912 KB Output is correct
61 Correct 2094 ms 112944 KB Output is correct
62 Correct 1950 ms 102672 KB Output is correct
63 Correct 712 ms 2744 KB Output is correct
64 Correct 1206 ms 2048 KB Output is correct
65 Correct 1968 ms 47096 KB Output is correct
66 Correct 1936 ms 40904 KB Output is correct
67 Correct 922 ms 1856 KB Output is correct
68 Correct 934 ms 2112 KB Output is correct
69 Correct 2664 ms 111216 KB Output is correct
70 Correct 2372 ms 94016 KB Output is correct
71 Correct 1474 ms 12280 KB Output is correct
72 Correct 1090 ms 2888 KB Output is correct