oj.uz

답안 #414934

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
414934 2021-05-31T10:46:12 Z Pro_ktmr Two Transportations (JOI19_transportations) C++17
100 / 100
 1024 ms 48948 KB 
#include"Azer.h"

#include"bits/stdc++.h"
#include<unordered_set>
#include<unordered_map>
#include<random>
using namespace std;
typedef long long ll;
const ll MOD = (ll)(1e9+7);
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)

namespace A{
    int N;
    vector<pair<int,int>> e[2000];
    vector<bool> decided;
    int dcnt = 0;
    vector<int> cost;

    int state = 0;
    int cnt = 0;

    int send = 0;
    int receive = 0;
    int idx = 0;
    int bef = 0;
    priority_queue<pair<int,int>> pq;

    void Dijkstra(int n, int v){
        v = bef + v;
        bef = v;
        decided[n] = true;
        cost[n] = v;
        dcnt++;
        if(dcnt == N) return;

        //cout << "A1: " << n << " " << v << endl;

        rep(i, e[n].size()){
            if(cost[e[n][i].first] > v + e[n][i].second){
                cost[e[n][i].first] = v + e[n][i].second;
                pq.push({-cost[e[n][i].first], e[n][i].first});
            }
        }

        while(!pq.empty() && decided[pq.top().second]) pq.pop();
        if(pq.empty()) send = 501;
        else send = -pq.top().first - bef;
        rep(i, 9) SendA((send>>8-i)&1);

        if(pq.empty()) idx = 2000;
        else idx = pq.top().second;

        //cout << "A2: " << idx << " " << send+bef << endl;
    }
}  // namespace

void InitA(int _N, int A, vector<int> U, vector<int> V, vector<int> C) {
    using namespace A;
    N = _N;
    rep(i, A){
        e[U[i]].pb({V[i], C[i]});
        e[V[i]].pb({U[i], C[i]});
    }
    decided.assign(N, false);
    cost.assign(N, INT_MAX);

    Dijkstra(0, 0);
}

void ReceiveA(bool x) {
    using namespace A;
    if(state == 0){
        receive = (receive<<1) + x;
        cnt++;
        if(cnt == 9){
            cnt = 0;
            if(send <= receive){
                rep(i, 11) SendA((idx>>10-i)&1);
                Dijkstra(idx, send);
                receive = 0;
            }
            else{
                state = 1;
                idx = 0;
            }
        }
    }
    else{
        idx = (idx<<1) + x;
        cnt++;
        if(cnt == 11){
            cnt = 0;
            state = 0;
            Dijkstra(idx, receive);
            receive = 0;
        }
    }
}

vector<int> Answer() {
    using namespace A;
    return cost;
}

#include"Baijan.h"

#include"bits/stdc++.h"
#include<unordered_set>
#include<unordered_map>
#include<random>
using namespace std;
typedef long long ll;
const ll MOD = (ll)(1e9+7);
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)

namespace B{
    int N;
    vector<pair<int,int>> e[2000];
    vector<bool> decided;
    int dcnt = 0;
    vector<int> cost;

    int state = 0;
    int cnt = 0;

    int send = 0;
    int receive = 0;
    int idx = 0;
    int bef = 0;
    priority_queue<pair<int,int>> pq;

    void Dijkstra(int n, int v){
        v = bef + v;
        bef = v;
        decided[n] = true;
        cost[n] = v;
        dcnt++;
        if(dcnt == N) return;

        //cout << "B1: " << n << " " << v << endl;

        rep(i, e[n].size()){
            if(cost[e[n][i].first] > v + e[n][i].second){
                cost[e[n][i].first] = v + e[n][i].second;
                pq.push({-cost[e[n][i].first], e[n][i].first});
            }
        }

        while(!pq.empty() && decided[pq.top().second]) pq.pop();
        if(pq.empty()) send = 501;
        else send = -pq.top().first - bef;
        rep(i, 9) SendB((send>>8-i)&1);

        if(pq.empty()) idx = 2000;
        else idx = pq.top().second;

        //cout << "B2: " << idx << " " << send+bef << endl;
    }
}  // namespace

void InitB(int _N, int B, vector<int> S, vector<int> T, vector<int> D) {
    using namespace B;
    N = _N;
    rep(i, B){
        e[S[i]].pb({T[i], D[i]});
        e[T[i]].pb({S[i], D[i]});
    }
    decided.assign(N, false);
    cost.assign(N, INT_MAX);

    Dijkstra(0, 0);
}

void ReceiveB(bool y) {
    using namespace B;
    if(state == 0){
        receive = (receive<<1) + y;
        cnt++;
        if(cnt == 9){
            cnt = 0;
            if(send < receive){
                rep(i, 11) SendB((idx>>10-i)&1);
                Dijkstra(idx, send);
                receive = 0;
            }
            else{
                state = 1;
                idx = 0;
            }
        }
    }
    else{
        idx = (idx<<1) + y;
        cnt++;
        if(cnt == 11){
            cnt = 0;
            state = 0;
            Dijkstra(idx, receive);
            receive = 0;
        }
    }
}

Compilation message

Azer.cpp: In function 'void A::Dijkstra(int, int)':
Azer.cpp:13:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   13 | #define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
      |                           ^
Azer.cpp:41:9: note: in expansion of macro 'rep'
   41 |         rep(i, e[n].size()){
      |         ^~~
Azer.cpp:13:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   13 | #define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
      |                           ^
Azer.cpp:51:9: note: in expansion of macro 'rep'
   51 |         rep(i, 9) SendA((send>>8-i)&1);
      |         ^~~
Azer.cpp:51:33: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   51 |         rep(i, 9) SendA((send>>8-i)&1);
      |                                ~^~
Azer.cpp: In function 'void InitA(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
Azer.cpp:13:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   13 | #define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
      |                           ^
Azer.cpp:63:5: note: in expansion of macro 'rep'
   63 |     rep(i, A){
      |     ^~~
Azer.cpp: In function 'void ReceiveA(bool)':
Azer.cpp:13:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   13 | #define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
      |                           ^
Azer.cpp:81:17: note: in expansion of macro 'rep'
   81 |                 rep(i, 11) SendA((idx>>10-i)&1);
      |                 ^~~
Azer.cpp:81:42: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   81 |                 rep(i, 11) SendA((idx>>10-i)&1);
      |                                        ~~^~

Baijan.cpp: In function 'void B::Dijkstra(int, int)':
Baijan.cpp:13:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   13 | #define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
      |                           ^
Baijan.cpp:41:9: note: in expansion of macro 'rep'
   41 |         rep(i, e[n].size()){
      |         ^~~
Baijan.cpp:13:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   13 | #define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
      |                           ^
Baijan.cpp:51:9: note: in expansion of macro 'rep'
   51 |         rep(i, 9) SendB((send>>8-i)&1);
      |         ^~~
Baijan.cpp:51:33: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   51 |         rep(i, 9) SendB((send>>8-i)&1);
      |                                ~^~
Baijan.cpp: In function 'void InitB(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
Baijan.cpp:13:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   13 | #define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
      |                           ^
Baijan.cpp:63:5: note: in expansion of macro 'rep'
   63 |     rep(i, B){
      |     ^~~
Baijan.cpp: In function 'void ReceiveB(bool)':
Baijan.cpp:13:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   13 | #define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
      |                           ^
Baijan.cpp:81:17: note: in expansion of macro 'rep'
   81 |                 rep(i, 11) SendB((idx>>10-i)&1);
      |                 ^~~
Baijan.cpp:81:42: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   81 |                 rep(i, 11) SendB((idx>>10-i)&1);
      |                                        ~~^~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 672 ms 776 KB Output is correct
2 Correct 2 ms 640 KB Output is correct
3 Correct 360 ms 780 KB Output is correct
4 Correct 817 ms 10080 KB Output is correct
5 Correct 27 ms 828 KB Output is correct
6 Correct 683 ms 2180 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 644 KB Output is correct
2 Correct 619 ms 732 KB Output is correct
3 Correct 629 ms 768 KB Output is correct
4 Correct 812 ms 27528 KB Output is correct
5 Correct 716 ms 24052 KB Output is correct
6 Correct 114 ms 640 KB Output is correct
7 Correct 821 ms 24380 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 542 ms 708 KB Output is correct
2 Correct 2 ms 640 KB Output is correct
3 Correct 812 ms 772 KB Output is correct
4 Correct 562 ms 732 KB Output is correct
5 Correct 700 ms 728 KB Output is correct
6 Correct 523 ms 732 KB Output is correct
7 Correct 567 ms 644 KB Output is correct
8 Correct 745 ms 648 KB Output is correct
9 Correct 428 ms 644 KB Output is correct
10 Correct 728 ms 768 KB Output is correct

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 291 ms 668 KB Output is correct
2 Correct 240 ms 640 KB Output is correct
3 Correct 418 ms 13296 KB Output is correct
4 Correct 269 ms 640 KB Output is correct
5 Correct 390 ms 10028 KB Output is correct
6 Correct 348 ms 640 KB Output is correct
7 Correct 386 ms 640 KB Output is correct
8 Correct 373 ms 640 KB Output is correct
9 Correct 272 ms 18092 KB Output is correct
10 Correct 418 ms 18152 KB Output is correct
11 Correct 500 ms 35668 KB Output is correct
12 Correct 531 ms 30648 KB Output is correct
13 Correct 330 ms 644 KB Output is correct
14 Correct 2 ms 640 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 291 ms 668 KB Output is correct
2 Correct 240 ms 640 KB Output is correct
3 Correct 418 ms 13296 KB Output is correct
4 Correct 269 ms 640 KB Output is correct
5 Correct 390 ms 10028 KB Output is correct
6 Correct 348 ms 640 KB Output is correct
7 Correct 386 ms 640 KB Output is correct
8 Correct 373 ms 640 KB Output is correct
9 Correct 272 ms 18092 KB Output is correct
10 Correct 418 ms 18152 KB Output is correct
11 Correct 500 ms 35668 KB Output is correct
12 Correct 531 ms 30648 KB Output is correct
13 Correct 330 ms 644 KB Output is correct
14 Correct 2 ms 640 KB Output is correct
15 Correct 299 ms 680 KB Output is correct
16 Correct 348 ms 764 KB Output is correct
17 Correct 294 ms 640 KB Output is correct
18 Correct 433 ms 10088 KB Output is correct
19 Correct 456 ms 640 KB Output is correct
20 Correct 429 ms 10308 KB Output is correct
21 Correct 287 ms 716 KB Output is correct
22 Correct 378 ms 660 KB Output is correct
23 Correct 628 ms 22132 KB Output is correct
24 Correct 607 ms 22136 KB Output is correct
25 Correct 683 ms 43592 KB Output is correct
26 Correct 694 ms 36380 KB Output is correct
27 Correct 281 ms 740 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 291 ms 668 KB Output is correct
2 Correct 240 ms 640 KB Output is correct
3 Correct 418 ms 13296 KB Output is correct
4 Correct 269 ms 640 KB Output is correct
5 Correct 390 ms 10028 KB Output is correct
6 Correct 348 ms 640 KB Output is correct
7 Correct 386 ms 640 KB Output is correct
8 Correct 373 ms 640 KB Output is correct
9 Correct 272 ms 18092 KB Output is correct
10 Correct 418 ms 18152 KB Output is correct
11 Correct 500 ms 35668 KB Output is correct
12 Correct 531 ms 30648 KB Output is correct
13 Correct 330 ms 644 KB Output is correct
14 Correct 2 ms 640 KB Output is correct
15 Correct 299 ms 680 KB Output is correct
16 Correct 348 ms 764 KB Output is correct
17 Correct 294 ms 640 KB Output is correct
18 Correct 433 ms 10088 KB Output is correct
19 Correct 456 ms 640 KB Output is correct
20 Correct 429 ms 10308 KB Output is correct
21 Correct 287 ms 716 KB Output is correct
22 Correct 378 ms 660 KB Output is correct
23 Correct 628 ms 22132 KB Output is correct
24 Correct 607 ms 22136 KB Output is correct
25 Correct 683 ms 43592 KB Output is correct
26 Correct 694 ms 36380 KB Output is correct
27 Correct 281 ms 740 KB Output is correct
28 Correct 290 ms 684 KB Output is correct
29 Correct 499 ms 640 KB Output is correct
30 Correct 606 ms 24044 KB Output is correct
31 Correct 490 ms 640 KB Output is correct
32 Correct 626 ms 21088 KB Output is correct
33 Correct 518 ms 784 KB Output is correct
34 Correct 440 ms 744 KB Output is correct
35 Correct 521 ms 752 KB Output is correct
36 Correct 671 ms 24692 KB Output is correct
37 Correct 601 ms 24696 KB Output is correct
38 Correct 849 ms 48948 KB Output is correct
39 Correct 707 ms 44176 KB Output is correct
40 Correct 567 ms 896 KB Output is correct

Subtask #7
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 672 ms 776 KB Output is correct
2 Correct 2 ms 640 KB Output is correct
3 Correct 360 ms 780 KB Output is correct
4 Correct 817 ms 10080 KB Output is correct
5 Correct 27 ms 828 KB Output is correct
6 Correct 683 ms 2180 KB Output is correct
7 Correct 2 ms 644 KB Output is correct
8 Correct 619 ms 732 KB Output is correct
9 Correct 629 ms 768 KB Output is correct
10 Correct 812 ms 27528 KB Output is correct
11 Correct 716 ms 24052 KB Output is correct
12 Correct 114 ms 640 KB Output is correct
13 Correct 821 ms 24380 KB Output is correct
14 Correct 542 ms 708 KB Output is correct
15 Correct 2 ms 640 KB Output is correct
16 Correct 812 ms 772 KB Output is correct
17 Correct 562 ms 732 KB Output is correct
18 Correct 700 ms 728 KB Output is correct
19 Correct 523 ms 732 KB Output is correct
20 Correct 567 ms 644 KB Output is correct
21 Correct 745 ms 648 KB Output is correct
22 Correct 428 ms 644 KB Output is correct
23 Correct 728 ms 768 KB Output is correct
24 Correct 291 ms 668 KB Output is correct
25 Correct 240 ms 640 KB Output is correct
26 Correct 418 ms 13296 KB Output is correct
27 Correct 269 ms 640 KB Output is correct
28 Correct 390 ms 10028 KB Output is correct
29 Correct 348 ms 640 KB Output is correct
30 Correct 386 ms 640 KB Output is correct
31 Correct 373 ms 640 KB Output is correct
32 Correct 272 ms 18092 KB Output is correct
33 Correct 418 ms 18152 KB Output is correct
34 Correct 500 ms 35668 KB Output is correct
35 Correct 531 ms 30648 KB Output is correct
36 Correct 330 ms 644 KB Output is correct
37 Correct 2 ms 640 KB Output is correct
38 Correct 299 ms 680 KB Output is correct
39 Correct 348 ms 764 KB Output is correct
40 Correct 294 ms 640 KB Output is correct
41 Correct 433 ms 10088 KB Output is correct
42 Correct 456 ms 640 KB Output is correct
43 Correct 429 ms 10308 KB Output is correct
44 Correct 287 ms 716 KB Output is correct
45 Correct 378 ms 660 KB Output is correct
46 Correct 628 ms 22132 KB Output is correct
47 Correct 607 ms 22136 KB Output is correct
48 Correct 683 ms 43592 KB Output is correct
49 Correct 694 ms 36380 KB Output is correct
50 Correct 281 ms 740 KB Output is correct
51 Correct 290 ms 684 KB Output is correct
52 Correct 499 ms 640 KB Output is correct
53 Correct 606 ms 24044 KB Output is correct
54 Correct 490 ms 640 KB Output is correct
55 Correct 626 ms 21088 KB Output is correct
56 Correct 518 ms 784 KB Output is correct
57 Correct 440 ms 744 KB Output is correct
58 Correct 521 ms 752 KB Output is correct
59 Correct 671 ms 24692 KB Output is correct
60 Correct 601 ms 24696 KB Output is correct
61 Correct 849 ms 48948 KB Output is correct
62 Correct 707 ms 44176 KB Output is correct
63 Correct 567 ms 896 KB Output is correct
64 Correct 611 ms 940 KB Output is correct
65 Correct 758 ms 26508 KB Output is correct
66 Correct 910 ms 23332 KB Output is correct
67 Correct 841 ms 920 KB Output is correct
68 Correct 685 ms 920 KB Output is correct
69 Correct 1024 ms 47604 KB Output is correct
70 Correct 1007 ms 39340 KB Output is correct
71 Correct 673 ms 5016 KB Output is correct
72 Correct 697 ms 1152 KB Output is correct