oj.uz

답안 #583437

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
583437 2022-06-25T11:11:44 Z lcj Two Transportations (JOI19_transportations) C++17
100 / 100
 685 ms 77972 KB 
#include <bits/stdc++.h>
#include "Azer.h"

using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

int n, a;
vector<vector<pll>> neighbours;
vector<int> dist;
vector<bool> vis;
priority_queue<pll, vector<pll>, greater<pll>> pq;
int cmaxdist = 0;
default_random_engine generator;

void step();

void InitA(int N, int A, std::vector<int> U, std::vector<int> V, std::vector<int> C) {
    n = N;a = A;
    neighbours.assign(n, {});
    for (int i = 0; i < a; i++)
    {
        neighbours[U[i]].push_back({V[i], C[i]});
        neighbours[V[i]].push_back({U[i], C[i]});
    }
    generator.seed(42);
    dist.assign(n, 1e9);
    vis.assign(n, 0);
    dist[0] = 0;
    pq.push({0, 0});
    step();
}
int buf = 0;
int cnt = 0;
int target = 0;

int tempd = 0;
int tempn = 0;

void sendNum(int num, int k) {
    //cout << "A > " << num << endl;
    assert(num < (1<<k));
    for (int i = 0; i < k; i++)
    {
        SendA(num & (1 << i));
    }
}

bool rstate = 0;
void step() {
    uniform_int_distribution<int> distr(0, 1);
    rstate = distr(generator);

    while (!pq.empty() && (dist[pq.top().second] < pq.top().first || vis[pq.top().second]))
    {
        pq.pop();
    }
    //cout << "Atop " << pq.top().second << " " << pq.top().first<<endl;
    if (rstate) {
        sendNum(pq.empty() ? 501 : pq.top().first-cmaxdist, 9);
        target = 1;
    }
    else {
        target = 9;
    }
}

void visnode(pll cur) {
    //cout << "Visiting " << cur.second << endl;
    vis[cur.second] = 1;
    cmaxdist = max(cmaxdist, (int)cur.first);
    dist[cur.second] = cur.first;
    for (auto nn : neighbours[cur.second]) {
        if (dist[nn.first] > cur.first+nn.second) {
            dist[nn.first] = cur.first+nn.second;
            pq.push({dist[nn.first], nn.first});
        }
    }
}

void onexit() {
    //cout << "exit" << endl;
    if (!rstate) {
        sendNum(1, 1);
    }
}

void ReceiveA(bool x) {
    buf += x*(1 << cnt);
    cnt++;
    if (cnt==target) {
        cnt = 0;
        int buffer = buf;
        buf = 0;
        if (target == 9) {
            if (rstate) {
                int trudist = buffer+cmaxdist;
                pll cur = {trudist, tempn};
                visnode(cur);
                step();
            }
            else {
                tempd = buffer+cmaxdist;
                int own = pq.empty() ? 501 : pq.top().first-cmaxdist;
                if (own == 501 && buffer == 501) {
                    onexit();
                    return;
                }
                if (buffer <= own) {
                    sendNum(1, 1);
                    target = 11;
                }
                else {
                    sendNum(0, 1);
                    auto cur = pq.top();
                    sendNum(cur.second, 11);
                    sendNum(own, 9);
                    pq.pop();
                    visnode(cur);
                    step();
                }
            }
        }
        else if (target == 11) {
            if (rstate) {
                tempn = buffer;
                target = 9;
            }
            else {
                pll cur = {tempd, buffer};
                visnode(cur);
                step();
            }
        }
        else {
            if (buffer) { //Own is better
                if (pq.empty()) {
                    onexit();
                    return;
                }
                const auto cur = pq.top();
                pq.pop();
                visnode(cur);
                sendNum(cur.second, 11);
                step();
            }
            else { //Other is better
                target = 11;
            }
        }
    }
}

std::vector<int> Answer() {
    return dist;
}
#include <bits/stdc++.h>
#include "Baijan.h"

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

namespace name
{
    int n, a;
vector<vector<pll>> neighbours;
vector<int> dist;
vector<bool> vis;
priority_queue<pll, vector<pll>, greater<pll>> pq;
int cmaxdist = 0;
default_random_engine generator;

void step();

void InitB(int N, int B, std::vector<int> S, std::vector<int> T, std::vector<int> D) {
    n = N;a = B;
    neighbours.assign(n, {});
    for (int i = 0; i < a; i++)
    {
        neighbours[S[i]].push_back({T[i], D[i]});
        neighbours[T[i]].push_back({S[i], D[i]});
    }
    generator.seed(42);
    dist.assign(n, 1e9);
    vis.assign(n, 0);
    dist[0] = 0;
    pq.push({0, 0});
    step();
}
int buf = 0;
int cnt = 0;
int target = 0;

int tempd = 0;
int tempn = 0;

void sendNum(int num, int k) {
    //cout << "B > " << num << endl;
    assert(num < (1<<k));
    for (int i = 0; i < k; i++)
    {
        SendB(num & (1 << i));
    }
}

bool rstate = 0;
void step() {
    uniform_int_distribution<int> distr(0, 1);
    rstate = !distr(generator);

    while (!pq.empty() && (dist[pq.top().second] < pq.top().first || vis[pq.top().second]))
    {
        pq.pop();
    }
    //cout << "Btop " << pq.top().second << " " << pq.top().first<<endl;
    if (rstate) {
        sendNum(pq.empty() ? 501 : pq.top().first-cmaxdist, 9);
        target = 1;
    }
    else {
        target = 9;
    }
}

void visnode(pll cur) {
    //cout << "Visiting " << cur.second << endl;
    vis[cur.second] = 1;
    cmaxdist = max(cmaxdist, (int)cur.first);
    dist[cur.second] = cur.first;
    for (auto nn : neighbours[cur.second]) {
        if (dist[nn.first] > cur.first+nn.second) {
            dist[nn.first] = cur.first+nn.second;
            pq.push({dist[nn.first], nn.first});
        }
    }
}

void onexit() {
    //cout << "exit" << endl;
    if (!rstate) {
        sendNum(1, 1);
    }
}

void ReceiveB(bool x) {
    buf += x*(1 << cnt);
    cnt++;
    if (cnt==target) {
        cnt = 0;
        int buffer = buf;
        buf = 0;
        if (target == 9) {
            if (rstate) {
                int trudist = buffer+cmaxdist;
                pll cur = {trudist, tempn};
                visnode(cur);
                step();
            }
            else {
                tempd = buffer+cmaxdist;
                int own = pq.empty() ? 501 : pq.top().first-cmaxdist;
                if (own == 501 && buffer == 501) {
                    onexit();
                    return;
                }
                if (buffer <= own) {
                    sendNum(1, 1);
                    target = 11;
                }
                else {
                    sendNum(0, 1);
                    auto cur = pq.top();
                    sendNum(cur.second, 11);
                    sendNum(own, 9);
                    pq.pop();
                    visnode(cur);
                    step();
                }
            }
        }
        else if (target == 11) {
            if (rstate) {
                tempn = buffer;
                target = 9;
            }
            else {
                pll cur = {tempd, buffer};
                visnode(cur);
                step();
            }
        }
        else {
            if (buffer) { //Own is better
                if (pq.empty()) {
                    onexit();
                    return;
                }
                const auto cur = pq.top();
                pq.pop();
                visnode(cur);
                sendNum(cur.second, 11);
                step();
            }
            else { //Other is better
                target = 11;
            }
        }
    }
}
} 

void InitB(int N, int B, std::vector<int> S, std::vector<int> T, std::vector<int> D) {
    name::InitB(N, B, S, T, D);
}

void ReceiveB(bool x) {
    name::ReceiveB(x);
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 441 ms 788 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 464 ms 784 KB Output is correct
4 Correct 386 ms 17080 KB Output is correct
5 Correct 29 ms 912 KB Output is correct
6 Correct 433 ms 3208 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 400 KB Output is correct
2 Correct 406 ms 744 KB Output is correct
3 Correct 390 ms 856 KB Output is correct
4 Correct 539 ms 39816 KB Output is correct
5 Correct 592 ms 34332 KB Output is correct
6 Correct 103 ms 528 KB Output is correct
7 Correct 552 ms 34628 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 454 ms 736 KB Output is correct
2 Correct 2 ms 400 KB Output is correct
3 Correct 460 ms 788 KB Output is correct
4 Correct 275 ms 744 KB Output is correct
5 Correct 511 ms 744 KB Output is correct
6 Correct 476 ms 744 KB Output is correct
7 Correct 460 ms 740 KB Output is correct
8 Correct 447 ms 796 KB Output is correct
9 Correct 504 ms 784 KB Output is correct
10 Correct 384 ms 784 KB Output is correct

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 136 ms 664 KB Output is correct
2 Correct 231 ms 640 KB Output is correct
3 Correct 270 ms 21752 KB Output is correct
4 Correct 183 ms 656 KB Output is correct
5 Correct 272 ms 15584 KB Output is correct
6 Correct 213 ms 656 KB Output is correct
7 Correct 212 ms 720 KB Output is correct
8 Correct 161 ms 720 KB Output is correct
9 Correct 277 ms 26264 KB Output is correct
10 Correct 348 ms 30704 KB Output is correct
11 Correct 388 ms 56124 KB Output is correct
12 Correct 319 ms 48444 KB Output is correct
13 Correct 192 ms 744 KB Output is correct
14 Correct 2 ms 400 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 136 ms 664 KB Output is correct
2 Correct 231 ms 640 KB Output is correct
3 Correct 270 ms 21752 KB Output is correct
4 Correct 183 ms 656 KB Output is correct
5 Correct 272 ms 15584 KB Output is correct
6 Correct 213 ms 656 KB Output is correct
7 Correct 212 ms 720 KB Output is correct
8 Correct 161 ms 720 KB Output is correct
9 Correct 277 ms 26264 KB Output is correct
10 Correct 348 ms 30704 KB Output is correct
11 Correct 388 ms 56124 KB Output is correct
12 Correct 319 ms 48444 KB Output is correct
13 Correct 192 ms 744 KB Output is correct
14 Correct 2 ms 400 KB Output is correct
15 Correct 223 ms 676 KB Output is correct
16 Correct 168 ms 652 KB Output is correct
17 Correct 192 ms 648 KB Output is correct
18 Correct 322 ms 15792 KB Output is correct
19 Correct 238 ms 712 KB Output is correct
20 Correct 315 ms 16156 KB Output is correct
21 Correct 254 ms 736 KB Output is correct
22 Correct 287 ms 664 KB Output is correct
23 Correct 407 ms 31636 KB Output is correct
24 Correct 357 ms 37696 KB Output is correct
25 Correct 510 ms 68684 KB Output is correct
26 Correct 449 ms 57264 KB Output is correct
27 Correct 208 ms 920 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 136 ms 664 KB Output is correct
2 Correct 231 ms 640 KB Output is correct
3 Correct 270 ms 21752 KB Output is correct
4 Correct 183 ms 656 KB Output is correct
5 Correct 272 ms 15584 KB Output is correct
6 Correct 213 ms 656 KB Output is correct
7 Correct 212 ms 720 KB Output is correct
8 Correct 161 ms 720 KB Output is correct
9 Correct 277 ms 26264 KB Output is correct
10 Correct 348 ms 30704 KB Output is correct
11 Correct 388 ms 56124 KB Output is correct
12 Correct 319 ms 48444 KB Output is correct
13 Correct 192 ms 744 KB Output is correct
14 Correct 2 ms 400 KB Output is correct
15 Correct 223 ms 676 KB Output is correct
16 Correct 168 ms 652 KB Output is correct
17 Correct 192 ms 648 KB Output is correct
18 Correct 322 ms 15792 KB Output is correct
19 Correct 238 ms 712 KB Output is correct
20 Correct 315 ms 16156 KB Output is correct
21 Correct 254 ms 736 KB Output is correct
22 Correct 287 ms 664 KB Output is correct
23 Correct 407 ms 31636 KB Output is correct
24 Correct 357 ms 37696 KB Output is correct
25 Correct 510 ms 68684 KB Output is correct
26 Correct 449 ms 57264 KB Output is correct
27 Correct 208 ms 920 KB Output is correct
28 Correct 317 ms 692 KB Output is correct
29 Correct 353 ms 784 KB Output is correct
30 Correct 459 ms 38304 KB Output is correct
31 Correct 268 ms 784 KB Output is correct
32 Correct 363 ms 34632 KB Output is correct
33 Correct 349 ms 888 KB Output is correct
34 Correct 329 ms 912 KB Output is correct
35 Correct 312 ms 932 KB Output is correct
36 Correct 573 ms 36240 KB Output is correct
37 Correct 458 ms 42216 KB Output is correct
38 Correct 556 ms 77972 KB Output is correct
39 Correct 466 ms 68484 KB Output is correct
40 Correct 241 ms 1036 KB Output is correct

Subtask #7
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 441 ms 788 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 464 ms 784 KB Output is correct
4 Correct 386 ms 17080 KB Output is correct
5 Correct 29 ms 912 KB Output is correct
6 Correct 433 ms 3208 KB Output is correct
7 Correct 1 ms 400 KB Output is correct
8 Correct 406 ms 744 KB Output is correct
9 Correct 390 ms 856 KB Output is correct
10 Correct 539 ms 39816 KB Output is correct
11 Correct 592 ms 34332 KB Output is correct
12 Correct 103 ms 528 KB Output is correct
13 Correct 552 ms 34628 KB Output is correct
14 Correct 454 ms 736 KB Output is correct
15 Correct 2 ms 400 KB Output is correct
16 Correct 460 ms 788 KB Output is correct
17 Correct 275 ms 744 KB Output is correct
18 Correct 511 ms 744 KB Output is correct
19 Correct 476 ms 744 KB Output is correct
20 Correct 460 ms 740 KB Output is correct
21 Correct 447 ms 796 KB Output is correct
22 Correct 504 ms 784 KB Output is correct
23 Correct 384 ms 784 KB Output is correct
24 Correct 136 ms 664 KB Output is correct
25 Correct 231 ms 640 KB Output is correct
26 Correct 270 ms 21752 KB Output is correct
27 Correct 183 ms 656 KB Output is correct
28 Correct 272 ms 15584 KB Output is correct
29 Correct 213 ms 656 KB Output is correct
30 Correct 212 ms 720 KB Output is correct
31 Correct 161 ms 720 KB Output is correct
32 Correct 277 ms 26264 KB Output is correct
33 Correct 348 ms 30704 KB Output is correct
34 Correct 388 ms 56124 KB Output is correct
35 Correct 319 ms 48444 KB Output is correct
36 Correct 192 ms 744 KB Output is correct
37 Correct 2 ms 400 KB Output is correct
38 Correct 223 ms 676 KB Output is correct
39 Correct 168 ms 652 KB Output is correct
40 Correct 192 ms 648 KB Output is correct
41 Correct 322 ms 15792 KB Output is correct
42 Correct 238 ms 712 KB Output is correct
43 Correct 315 ms 16156 KB Output is correct
44 Correct 254 ms 736 KB Output is correct
45 Correct 287 ms 664 KB Output is correct
46 Correct 407 ms 31636 KB Output is correct
47 Correct 357 ms 37696 KB Output is correct
48 Correct 510 ms 68684 KB Output is correct
49 Correct 449 ms 57264 KB Output is correct
50 Correct 208 ms 920 KB Output is correct
51 Correct 317 ms 692 KB Output is correct
52 Correct 353 ms 784 KB Output is correct
53 Correct 459 ms 38304 KB Output is correct
54 Correct 268 ms 784 KB Output is correct
55 Correct 363 ms 34632 KB Output is correct
56 Correct 349 ms 888 KB Output is correct
57 Correct 329 ms 912 KB Output is correct
58 Correct 312 ms 932 KB Output is correct
59 Correct 573 ms 36240 KB Output is correct
60 Correct 458 ms 42216 KB Output is correct
61 Correct 556 ms 77972 KB Output is correct
62 Correct 466 ms 68484 KB Output is correct
63 Correct 241 ms 1036 KB Output is correct
64 Correct 445 ms 1148 KB Output is correct
65 Correct 500 ms 43384 KB Output is correct
66 Correct 411 ms 37460 KB Output is correct
67 Correct 384 ms 988 KB Output is correct
68 Correct 417 ms 988 KB Output is correct
69 Correct 685 ms 74040 KB Output is correct
70 Correct 685 ms 62304 KB Output is correct
71 Correct 394 ms 7724 KB Output is correct
72 Correct 326 ms 1536 KB Output is correct