oj.uz

Submission #259338

# Submission time Handle Problem Language Result Execution time Memory
259338 2020-08-07T15:56:01 Z keko37 Two Transportations (JOI19_transportations) C++14
70 / 100
 1636 ms 85504 KB 
#include<bits/stdc++.h>
#include "Azer.h"

using namespace std;

typedef pair <int, int> pi;

const int MAXN = 2005;

int n, m, mx, ans, ex, tip, mn, ind, ost;
vector <pi> v[MAXN];
int bio[MAXN], dist[MAXN];

//void SendA (bool x) {}

void SendNum (int val, int br) {
    for (int i = br - 1; i >= 0; i--) {
        SendA((bool) (val & (1 << i)));
    }
}

void update (int x, int d) {
    bio[x] = 1; dist[x] = d;
    mx = max(mx, dist[x]);
    for (auto par : v[x]) {
        int sus = par.first, w = par.second;
        if (bio[sus] == 0 && dist[x] + w < dist[sus]) dist[sus] = dist[x] + w;
    }
}

void solve () {
    if (ost == 0) return;
    if (tip == 0) {
        mn = 501, ind = -1;
        for (int j = 1; j <= n; j++) {
            if (bio[j] == 0 && dist[j] - mx < mn) {
                mn = dist[j] - mx;
                ind = j;
            }
        }

        SendNum(mn, 9);
        ans = 0; ex = 1;
    } else if (tip == 1) {
        if (ans == 0) {
            SendNum(ind, 11);
            tip = 4;
            solve();
        } else {
            ans = 0; ex = 9;
        }
    } else if (tip == 2) {
        mn = ans;
        ans = 0; ex = 11;
    } else if (tip == 3) {
        ind = ans;
        tip = 4;
        solve();
    } else if (tip == 4) {
        update(ind, mx + mn);
        tip = 0;
        ost--;
        solve();
    }
}

void ReceiveA (bool x) {
    ans *= 2;
    if (x) ans++;
    ex--;
    if (ex == 0) {
        tip++;
        solve();
    }
}

std::vector<int> Answer () {
    vector <int> res(n);
    for (int i = 0; i < n; i++) res[i] = dist[i];
    return res;
}

void InitA (int N, int A, std::vector <int> U, std::vector <int> V, std::vector <int> C) {
    n = N; m = A;
    for (int i = 0; i < m; i++) {
        v[U[i]].push_back({V[i], C[i]});
        v[V[i]].push_back({U[i], C[i]});
    }
    for (int i = 1; i <= n; i++) dist[i] = 1e9;
    update(0, 0);
    ost = n-1;
    solve();
}

/*int main () {
    return 0;
}*/

#include<bits/stdc++.h>
#include "Baijan.h"

using namespace std;

typedef pair <int, int> pi;

const int MAXN = 2005;

int n, m, mx, ans, ex, tip, mn, ind, ost;
vector <pi> v[MAXN];
int bio[MAXN], dist[MAXN];

//void SendB (bool x) {}

void SendNum (int val, int br) {
    for (int i = br - 1; i >= 0; i--) {
        SendB((bool) (val & (1 << i)));
    }
}

void update (int x, int d) {
    bio[x] = 1; dist[x] = d;
    mx = max(mx, dist[x]);
    for (auto par : v[x]) {
        int sus = par.first, w = par.second;
        if (bio[sus] == 0 && dist[x] + w < dist[sus]) dist[sus] = dist[x] + w;
    }
}

void solve () {
    if (ost == 0) return;
    if (tip == 0) {
        mn = 501, ind = -1;
        for (int j = 1; j <= n; j++) {
            if (bio[j] == 0 && dist[j] - mx < mn) {
                mn = dist[j] - mx;
                ind = j;
            }
        }

        ans = 0; ex = 9;
    } else if (tip == 1) {
        if (mn < ans) {
            SendNum(1, 1);
            SendNum(mn, 9);
            SendNum(ind, 11);
            tip = 3;
            solve();
        } else {
            SendNum(0, 1);
            mn = ans;
            ans = 0; ex = 11;
        }
    } else if (tip == 2) {
        ind = ans;
        tip = 3;
        solve();
    } else if (tip == 3) {
        update(ind, mx + mn);
        tip = 0;
        ost--;
        solve();
    }
}

void ReceiveB (bool x) {
    ans *= 2;
    if (x) ans++;
    ex--;
    if (ex == 0) {
        tip++;
        solve();
    }
}

void InitB (int N, int B, std::vector <int> U, std::vector <int> V, std::vector <int> C) {
    n = N; m = B;
    for (int i = 0; i < m; i++) {
        v[U[i]].push_back({V[i], C[i]});
        v[V[i]].push_back({U[i], C[i]});
    }
    for (int i = 1; i <= n; i++) dist[i] = 1e9;
    update(0, 0);
    ost = n-1;
    solve();
}

/*int main () {
    return 0;
}*/

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 673 ms 784 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1536 KB Output is correct
2 Correct 760 ms 1808 KB Output is correct
3 Correct 840 ms 1800 KB Output is correct
4 Correct 1154 ms 55272 KB Output is correct
5 Correct 1300 ms 48312 KB Output is correct
6 Correct 306 ms 1536 KB Output is correct
7 Correct 1278 ms 48608 KB Output is correct

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 890 ms 1656 KB Output is correct
2 Correct 2 ms 1280 KB Output is correct
3 Incorrect 562 ms 908 KB Wrong Answer [2]
4 Halted 0 ms 0 KB -

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 520 ms 1688 KB Output is correct
2 Correct 372 ms 1600 KB Output is correct
3 Correct 602 ms 23824 KB Output is correct
4 Correct 616 ms 1536 KB Output is correct
5 Correct 646 ms 17368 KB Output is correct
6 Correct 536 ms 1536 KB Output is correct
7 Correct 334 ms 1688 KB Output is correct
8 Correct 460 ms 1680 KB Output is correct
9 Correct 662 ms 36064 KB Output is correct
10 Correct 810 ms 36128 KB Output is correct
11 Correct 1268 ms 61376 KB Output is correct
12 Correct 969 ms 53776 KB Output is correct
13 Correct 432 ms 1736 KB Output is correct
14 Correct 4 ms 1536 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 520 ms 1688 KB Output is correct
2 Correct 372 ms 1600 KB Output is correct
3 Correct 602 ms 23824 KB Output is correct
4 Correct 616 ms 1536 KB Output is correct
5 Correct 646 ms 17368 KB Output is correct
6 Correct 536 ms 1536 KB Output is correct
7 Correct 334 ms 1688 KB Output is correct
8 Correct 460 ms 1680 KB Output is correct
9 Correct 662 ms 36064 KB Output is correct
10 Correct 810 ms 36128 KB Output is correct
11 Correct 1268 ms 61376 KB Output is correct
12 Correct 969 ms 53776 KB Output is correct
13 Correct 432 ms 1736 KB Output is correct
14 Correct 4 ms 1536 KB Output is correct
15 Correct 386 ms 1536 KB Output is correct
16 Correct 622 ms 1744 KB Output is correct
17 Correct 646 ms 1600 KB Output is correct
18 Correct 884 ms 17600 KB Output is correct
19 Correct 658 ms 1600 KB Output is correct
20 Correct 686 ms 17992 KB Output is correct
21 Correct 536 ms 1600 KB Output is correct
22 Correct 600 ms 1824 KB Output is correct
23 Correct 1004 ms 44056 KB Output is correct
24 Correct 1354 ms 43848 KB Output is correct
25 Correct 1464 ms 75256 KB Output is correct
26 Correct 1160 ms 64560 KB Output is correct
27 Correct 420 ms 1792 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 520 ms 1688 KB Output is correct
2 Correct 372 ms 1600 KB Output is correct
3 Correct 602 ms 23824 KB Output is correct
4 Correct 616 ms 1536 KB Output is correct
5 Correct 646 ms 17368 KB Output is correct
6 Correct 536 ms 1536 KB Output is correct
7 Correct 334 ms 1688 KB Output is correct
8 Correct 460 ms 1680 KB Output is correct
9 Correct 662 ms 36064 KB Output is correct
10 Correct 810 ms 36128 KB Output is correct
11 Correct 1268 ms 61376 KB Output is correct
12 Correct 969 ms 53776 KB Output is correct
13 Correct 432 ms 1736 KB Output is correct
14 Correct 4 ms 1536 KB Output is correct
15 Correct 386 ms 1536 KB Output is correct
16 Correct 622 ms 1744 KB Output is correct
17 Correct 646 ms 1600 KB Output is correct
18 Correct 884 ms 17600 KB Output is correct
19 Correct 658 ms 1600 KB Output is correct
20 Correct 686 ms 17992 KB Output is correct
21 Correct 536 ms 1600 KB Output is correct
22 Correct 600 ms 1824 KB Output is correct
23 Correct 1004 ms 44056 KB Output is correct
24 Correct 1354 ms 43848 KB Output is correct
25 Correct 1464 ms 75256 KB Output is correct
26 Correct 1160 ms 64560 KB Output is correct
27 Correct 420 ms 1792 KB Output is correct
28 Correct 718 ms 1672 KB Output is correct
29 Correct 856 ms 1768 KB Output is correct
30 Correct 956 ms 42200 KB Output is correct
31 Correct 758 ms 1536 KB Output is correct
32 Correct 986 ms 37416 KB Output is correct
33 Correct 728 ms 1760 KB Output is correct
34 Correct 594 ms 2120 KB Output is correct
35 Correct 678 ms 1792 KB Output is correct
36 Correct 930 ms 49120 KB Output is correct
37 Correct 1480 ms 49400 KB Output is correct
38 Correct 1636 ms 85504 KB Output is correct
39 Correct 1486 ms 78816 KB Output is correct
40 Correct 668 ms 1736 KB Output is correct

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 673 ms 784 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -