oj.uz

Submission #482154

# Submission time Handle Problem Language Result Execution time Memory
482154 2021-10-23T11:53:40 Z cheissmart Two Transportations (JOI19_transportations) C++17
100 / 100
 844 ms 48924 KB 
#include "Azer.h"
#include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()

using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;


const int INF = 1e9 + 7;

namespace {
    const int N = 2005;    
    V<pi> G[N];
    int d[N], vis[N];
    int n;
    int state, last_dist;
    int u, dist, code, cnt;
    // state
    // 0: to sent
    // 1: waiting B cost
    // 2: watting B for who

    void send_cost(int cost) {
        for(int i = 8; i >= 0; i--)
            SendA(cost >> i & 1);
    }
    void send_who(int who) {
        for(int i = 10; i >= 0; i--)
            SendA(who >> i & 1);
    }

    void upd(int dist, int u) {
        if(u == (1 << 11) - 1)
            return;
        assert(dist >= last_dist);
        assert(!vis[u]);
        d[u] = dist;
        vis[u] = 1;
        last_dist = dist;
        for(auto [v, w]:G[u]) {
            if(d[u] + w < d[v]) {
                d[v] = d[u] + w;
            }
        }
    }

    void start() { 
        assert(state == 0);
        dist = last_dist + (1 << 9) - 1, u = (1 << 11) - 1;
        for(int i = 0; i < n; i++) if(!vis[i]) {
            if(d[i] < dist) {
                dist = d[i];
                u = i;
            }
        }
        send_cost(dist - last_dist);
        state = 1;
    }

}  // namespace

void InitA(int _n, int A, vi u, vi v, vi c) {
    n = _n;
    for(int i = 0; i < A; i++) {
        G[u[i]].EB(v[i], c[i]);
        G[v[i]].EB(u[i], c[i]);
    }
    memset(d, 0x3f, sizeof(d[0]) * n);
    memset(vis, 0, sizeof(vis[0]) * n);
    d[0] = 0;
    upd(d[0], 0);

    state = 0;
    last_dist = 0;
    code = 0;
    cnt = 0;
    start();
}

void ReceiveA(bool x) {
    if(state == 1) {
        code = code * 2 + x;
        cnt++;
        if(cnt == 9) {
            if(last_dist + code < dist) {
                dist = last_dist + code;
                state = 2;
                code = 0;
                cnt = 0;
            } else {
                send_who(u);
                upd(dist, u);
                state = 0;
                code = 0;
                cnt = 0;
                if(u != (1 << 11) - 1)
                    start();
            }
        }
    } else if(state == 2) {
        code = code * 2 + x;
        cnt++;
        if(cnt == 11) {
            u = code;
            upd(dist, u);
            state = 0;
            code = 0;
            cnt = 0;
            start();
        }
     }
}

vi Answer() {
    vi ans(n);
    for(int i = 0; i < n; i++) {
        assert(vis[i]);
        ans[i] = d[i];
    }
    return ans;
}


#include "Baijan.h"
#include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()

using namespace std;

typedef long long ll;
typedef pair<int, int> pi;
typedef V<int> vi;

const int INF = 1e9 + 7;
namespace {
    const int N = 2005;    
    V<pi> G[N];
    int d[N], vis[N];
    int n;
    int state, last_dist;
    int u, dist, code, cnt;
    // state
    // 0: wait A
    // 1: 

    void send_cost(int cost) {
        for(int i = 8; i >= 0; i--)
            SendB(cost >> i & 1);
    }
    void send_who(int who) {
        for(int i = 10; i >= 0; i--)
            SendB(who >> i & 1);
    }

    void upd(int dist, int u) {
        if(u == (1 << 11) - 1)
            return;
        d[u] = dist;
        vis[u] = 1;
        last_dist = dist;
        for(auto [v, w]:G[u]) {
            if(d[u] + w < d[v]) {
                d[v] = d[u] + w;
            }
        }
    }

    void start() { 
        dist = last_dist + (1 << 9) - 1, u = (1 << 11) - 1;
        for(int i = 0; i < n; i++) if(!vis[i]) {
            if(d[i] < dist) {
                dist = d[i];
                u = i;
            }
        }
    }
}  // namespace


void InitB(int _n, int B, vi u, vi v, vi c) {
    n = _n;
    for(int i = 0; i < B; i++) {
        G[u[i]].EB(v[i], c[i]);
        G[v[i]].EB(u[i], c[i]);
    }
    memset(d, 0x3f, sizeof(d[0]) * n);
    memset(vis, 0, sizeof(vis[0]) * n);
    d[0] = 0;
    upd(d[0], 0);
    
    state = 0;
    last_dist = 0;
    code = 0;
    cnt = 0;
}

void ReceiveB(bool x) {
    if(state == 0) {
        code = code * 2 + x;
        cnt++;
        if(cnt == 9) {
            start();
            if(last_dist + code > dist) {
                int tt = dist - last_dist;
                cnt = 0;
                code = 0;
                state = 0;
                upd(dist, u);
                send_cost(tt);
                send_who(u);
            } else {
                int tt = dist - last_dist;
                dist = last_dist + code;
                cnt = 0;
                code = 0;
                state = 1;
                send_cost(tt);
            }
        }
    } else if(state == 1) {
        code = code * 2 + x;
        cnt++;
        if(cnt == 11) {
            u = code;
            cnt = 0;
            code = 0;
            state = 0;
            upd(dist, u);
        }
    }
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 504 ms 784 KB Output is correct
2 Correct 1 ms 648 KB Output is correct
3 Correct 514 ms 784 KB Output is correct
4 Correct 580 ms 10084 KB Output is correct
5 Correct 24 ms 924 KB Output is correct
6 Correct 491 ms 2200 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 656 KB Output is correct
2 Correct 502 ms 736 KB Output is correct
3 Correct 516 ms 804 KB Output is correct
4 Correct 575 ms 27504 KB Output is correct
5 Correct 604 ms 24080 KB Output is correct
6 Correct 110 ms 648 KB Output is correct
7 Correct 576 ms 24316 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 476 ms 724 KB Output is correct
2 Correct 2 ms 648 KB Output is correct
3 Correct 433 ms 784 KB Output is correct
4 Correct 449 ms 736 KB Output is correct
5 Correct 515 ms 740 KB Output is correct
6 Correct 416 ms 728 KB Output is correct
7 Correct 477 ms 648 KB Output is correct
8 Correct 454 ms 792 KB Output is correct
9 Correct 436 ms 800 KB Output is correct
10 Correct 454 ms 784 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 251 ms 696 KB Output is correct
2 Correct 238 ms 768 KB Output is correct
3 Correct 279 ms 13304 KB Output is correct
4 Correct 207 ms 648 KB Output is correct
5 Correct 191 ms 10104 KB Output is correct
6 Correct 208 ms 648 KB Output is correct
7 Correct 197 ms 768 KB Output is correct
8 Correct 170 ms 724 KB Output is correct
9 Correct 352 ms 18052 KB Output is correct
10 Correct 252 ms 18224 KB Output is correct
11 Correct 427 ms 35840 KB Output is correct
12 Correct 398 ms 30716 KB Output is correct
13 Correct 246 ms 648 KB Output is correct
14 Correct 2 ms 668 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 251 ms 696 KB Output is correct
2 Correct 238 ms 768 KB Output is correct
3 Correct 279 ms 13304 KB Output is correct
4 Correct 207 ms 648 KB Output is correct
5 Correct 191 ms 10104 KB Output is correct
6 Correct 208 ms 648 KB Output is correct
7 Correct 197 ms 768 KB Output is correct
8 Correct 170 ms 724 KB Output is correct
9 Correct 352 ms 18052 KB Output is correct
10 Correct 252 ms 18224 KB Output is correct
11 Correct 427 ms 35840 KB Output is correct
12 Correct 398 ms 30716 KB Output is correct
13 Correct 246 ms 648 KB Output is correct
14 Correct 2 ms 668 KB Output is correct
15 Correct 288 ms 648 KB Output is correct
16 Correct 288 ms 648 KB Output is correct
17 Correct 267 ms 648 KB Output is correct
18 Correct 353 ms 10120 KB Output is correct
19 Correct 247 ms 648 KB Output is correct
20 Correct 321 ms 10352 KB Output is correct
21 Correct 242 ms 648 KB Output is correct
22 Correct 333 ms 648 KB Output is correct
23 Correct 427 ms 22152 KB Output is correct
24 Correct 400 ms 22148 KB Output is correct
25 Correct 540 ms 43512 KB Output is correct
26 Correct 449 ms 36476 KB Output is correct
27 Correct 307 ms 776 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 251 ms 696 KB Output is correct
2 Correct 238 ms 768 KB Output is correct
3 Correct 279 ms 13304 KB Output is correct
4 Correct 207 ms 648 KB Output is correct
5 Correct 191 ms 10104 KB Output is correct
6 Correct 208 ms 648 KB Output is correct
7 Correct 197 ms 768 KB Output is correct
8 Correct 170 ms 724 KB Output is correct
9 Correct 352 ms 18052 KB Output is correct
10 Correct 252 ms 18224 KB Output is correct
11 Correct 427 ms 35840 KB Output is correct
12 Correct 398 ms 30716 KB Output is correct
13 Correct 246 ms 648 KB Output is correct
14 Correct 2 ms 668 KB Output is correct
15 Correct 288 ms 648 KB Output is correct
16 Correct 288 ms 648 KB Output is correct
17 Correct 267 ms 648 KB Output is correct
18 Correct 353 ms 10120 KB Output is correct
19 Correct 247 ms 648 KB Output is correct
20 Correct 321 ms 10352 KB Output is correct
21 Correct 242 ms 648 KB Output is correct
22 Correct 333 ms 648 KB Output is correct
23 Correct 427 ms 22152 KB Output is correct
24 Correct 400 ms 22148 KB Output is correct
25 Correct 540 ms 43512 KB Output is correct
26 Correct 449 ms 36476 KB Output is correct
27 Correct 307 ms 776 KB Output is correct
28 Correct 361 ms 648 KB Output is correct
29 Correct 384 ms 656 KB Output is correct
30 Correct 479 ms 24064 KB Output is correct
31 Correct 413 ms 648 KB Output is correct
32 Correct 494 ms 21104 KB Output is correct
33 Correct 343 ms 768 KB Output is correct
34 Correct 388 ms 904 KB Output is correct
35 Correct 373 ms 904 KB Output is correct
36 Correct 547 ms 24700 KB Output is correct
37 Correct 496 ms 24704 KB Output is correct
38 Correct 675 ms 48924 KB Output is correct
39 Correct 581 ms 44252 KB Output is correct
40 Correct 410 ms 904 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 504 ms 784 KB Output is correct
2 Correct 1 ms 648 KB Output is correct
3 Correct 514 ms 784 KB Output is correct
4 Correct 580 ms 10084 KB Output is correct
5 Correct 24 ms 924 KB Output is correct
6 Correct 491 ms 2200 KB Output is correct
7 Correct 2 ms 656 KB Output is correct
8 Correct 502 ms 736 KB Output is correct
9 Correct 516 ms 804 KB Output is correct
10 Correct 575 ms 27504 KB Output is correct
11 Correct 604 ms 24080 KB Output is correct
12 Correct 110 ms 648 KB Output is correct
13 Correct 576 ms 24316 KB Output is correct
14 Correct 476 ms 724 KB Output is correct
15 Correct 2 ms 648 KB Output is correct
16 Correct 433 ms 784 KB Output is correct
17 Correct 449 ms 736 KB Output is correct
18 Correct 515 ms 740 KB Output is correct
19 Correct 416 ms 728 KB Output is correct
20 Correct 477 ms 648 KB Output is correct
21 Correct 454 ms 792 KB Output is correct
22 Correct 436 ms 800 KB Output is correct
23 Correct 454 ms 784 KB Output is correct
24 Correct 251 ms 696 KB Output is correct
25 Correct 238 ms 768 KB Output is correct
26 Correct 279 ms 13304 KB Output is correct
27 Correct 207 ms 648 KB Output is correct
28 Correct 191 ms 10104 KB Output is correct
29 Correct 208 ms 648 KB Output is correct
30 Correct 197 ms 768 KB Output is correct
31 Correct 170 ms 724 KB Output is correct
32 Correct 352 ms 18052 KB Output is correct
33 Correct 252 ms 18224 KB Output is correct
34 Correct 427 ms 35840 KB Output is correct
35 Correct 398 ms 30716 KB Output is correct
36 Correct 246 ms 648 KB Output is correct
37 Correct 2 ms 668 KB Output is correct
38 Correct 288 ms 648 KB Output is correct
39 Correct 288 ms 648 KB Output is correct
40 Correct 267 ms 648 KB Output is correct
41 Correct 353 ms 10120 KB Output is correct
42 Correct 247 ms 648 KB Output is correct
43 Correct 321 ms 10352 KB Output is correct
44 Correct 242 ms 648 KB Output is correct
45 Correct 333 ms 648 KB Output is correct
46 Correct 427 ms 22152 KB Output is correct
47 Correct 400 ms 22148 KB Output is correct
48 Correct 540 ms 43512 KB Output is correct
49 Correct 449 ms 36476 KB Output is correct
50 Correct 307 ms 776 KB Output is correct
51 Correct 361 ms 648 KB Output is correct
52 Correct 384 ms 656 KB Output is correct
53 Correct 479 ms 24064 KB Output is correct
54 Correct 413 ms 648 KB Output is correct
55 Correct 494 ms 21104 KB Output is correct
56 Correct 343 ms 768 KB Output is correct
57 Correct 388 ms 904 KB Output is correct
58 Correct 373 ms 904 KB Output is correct
59 Correct 547 ms 24700 KB Output is correct
60 Correct 496 ms 24704 KB Output is correct
61 Correct 675 ms 48924 KB Output is correct
62 Correct 581 ms 44252 KB Output is correct
63 Correct 410 ms 904 KB Output is correct
64 Correct 600 ms 952 KB Output is correct
65 Correct 518 ms 26488 KB Output is correct
66 Correct 655 ms 23544 KB Output is correct
67 Correct 578 ms 936 KB Output is correct
68 Correct 555 ms 936 KB Output is correct
69 Correct 844 ms 47620 KB Output is correct
70 Correct 798 ms 39384 KB Output is correct
71 Correct 604 ms 4976 KB Output is correct
72 Correct 473 ms 1172 KB Output is correct