oj.uz

Submission #996313

# Submission time Handle Problem Language Result Execution time Memory
996313 2024-06-10T12:33:01 Z 79brue Two Transportations (JOI19_transportations) C++17
100 / 100
 546 ms 49276 KB 
#include "Azer.h"
#include <bits/stdc++.h>

using namespace std;
const int INF = 2e9;

namespace {
    int n, cnt;
    vector<pair<int, int> > link[2002];
    int dist[2002];
    bool visited[2002];

    int recent_dist;
    int curr_node, curr_dist;
    int opp_node, opp_dist, opp_qidx, mode;

    void update(int x){
        visited[x] = 1;
        for(auto [y, z]: link[x]){
            dist[y] = min(dist[y], dist[x] + z);
        }
        recent_dist = dist[x];
    }

    void send_info(){
        curr_node = -1, curr_dist = INF;
        for(int i=0; i<n; i++) if(!visited[i] && curr_dist > dist[i]){
            curr_node = i;
            curr_dist = dist[i];
        }

        int diff = min(curr_dist - recent_dist, 511);
        assert((0 <= curr_dist - recent_dist && curr_dist - recent_dist < 512) || curr_dist == INF);
        for(int i=0; i<9; i++) SendA((diff >> i) & 1);

        opp_node = opp_qidx = mode = 0, opp_dist = recent_dist;
    }
}

void InitA(int N, int A, vector<int> U, vector<int> V, vector<int> C) {
    n = N;
    for(int i=0; i<A; i++){
        link[U[i]].push_back(make_pair(V[i], C[i]));
        link[V[i]].push_back(make_pair(U[i], C[i]));
    }

    for(int i=1; i<n; i++) dist[i] = INF;
    update(0);

    cnt = 1;
    send_info();
}

void ReceiveA(bool x) {
    if(!mode){
        opp_dist += (int(x) << opp_qidx++);
        if(opp_qidx == 9){ /// 정보가 모두 전달되었다
            opp_qidx = 0;
//            printf("Azer: my %d %d, opp %d\n", curr_node, curr_dist, opp_dist);
            if(curr_dist <= opp_dist){ /// 내가 정보를 보내고 업데이트
                update(curr_node);
                for(int i=0; i<11; i++) SendA((curr_node >> i) & 1);

                if(++cnt == n) return;
                else send_info();
            }
            else mode = 1;
        }
    }
    else{
        opp_node += (int(x) << opp_qidx++);
        if(opp_qidx == 11){
            dist[opp_node] = opp_dist;
            update(opp_node);

            if(++cnt == n) return;
            else send_info();
            mode = 0;
        }
    }
}

vector<int> Answer(){
    return vector<int> (dist, dist+n);
}

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

using namespace std;
const int INF = 2e9;

namespace{
    int n, cnt;
    vector<pair<int, int> > link[2002];
    int dist[2002];
    bool visited[2002];

    int recent_dist;
    int curr_node, curr_dist;
    int opp_node, opp_dist, opp_qidx, mode;

    void update(int x){
        visited[x] = 1;
        for(auto [y, z]: link[x]){
            dist[y] = min(dist[y], dist[x] + z);
        }
        recent_dist = dist[x];
    }

    void send_info(){
        curr_node = -1, curr_dist = INF;
        for(int i=0; i<n; i++) if(!visited[i] && curr_dist > dist[i]){
            curr_node = i;
            curr_dist = dist[i];
        }

        int diff = min(curr_dist - recent_dist, 511);
        assert((0 <= curr_dist - recent_dist && curr_dist - recent_dist < 512) || curr_dist == INF);
        for(int i=0; i<9; i++) SendB((diff >> i) & 1);

        opp_node = opp_qidx = mode = 0, opp_dist = recent_dist;
    }
}

void InitB(int N, int B, vector<int> S, vector<int> T, vector<int> D) {
    n = N;
    for(int i=0; i<B; i++){
        link[S[i]].push_back(make_pair(T[i], D[i]));
        link[T[i]].push_back(make_pair(S[i], D[i]));
    }

    for(int i=1; i<n; i++) dist[i] = INF;
    update(0);

    cnt = 1;
    send_info();
}

void ReceiveB(bool x) {
    if(!mode){
        opp_dist += (int(x) << opp_qidx++);
        if(opp_qidx == 9){ /// 정보가 모두 전달되었다
            opp_qidx = 0;
//            printf("Baijan: my %d %d, opp %d\n", curr_node, curr_dist, opp_dist);
            if(curr_dist < opp_dist){ /// 내가 정보를 보내고 업데이트
                update(curr_node);
                for(int i=0; i<11; i++) SendB((curr_node >> i) & 1);

                if(++cnt == n) return;
                else send_info();
            }
            else mode = 1;
        }
    }
    else{
        opp_node += (int(x) << opp_qidx++);
        if(opp_qidx == 11){
            dist[opp_node] = opp_dist;
            update(opp_node);

            if(++cnt == n) return;
            else send_info();
            mode = 0;
        }
    }
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 379 ms 1052 KB Output is correct
2 Correct 0 ms 664 KB Output is correct
3 Correct 364 ms 1052 KB Output is correct
4 Correct 397 ms 10260 KB Output is correct
5 Correct 17 ms 920 KB Output is correct
6 Correct 412 ms 2456 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 664 KB Output is correct
2 Correct 353 ms 876 KB Output is correct
3 Correct 329 ms 936 KB Output is correct
4 Correct 436 ms 27768 KB Output is correct
5 Correct 441 ms 24196 KB Output is correct
6 Correct 65 ms 664 KB Output is correct
7 Correct 430 ms 24448 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 389 ms 864 KB Output is correct
2 Correct 1 ms 664 KB Output is correct
3 Correct 414 ms 792 KB Output is correct
4 Correct 371 ms 876 KB Output is correct
5 Correct 311 ms 872 KB Output is correct
6 Correct 327 ms 864 KB Output is correct
7 Correct 370 ms 876 KB Output is correct
8 Correct 356 ms 800 KB Output is correct
9 Correct 366 ms 792 KB Output is correct
10 Correct 415 ms 1052 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 664 KB Output is correct
2 Correct 139 ms 792 KB Output is correct
3 Correct 197 ms 13276 KB Output is correct
4 Correct 127 ms 664 KB Output is correct
5 Correct 200 ms 10060 KB Output is correct
6 Correct 126 ms 664 KB Output is correct
7 Correct 147 ms 664 KB Output is correct
8 Correct 150 ms 664 KB Output is correct
9 Correct 221 ms 18324 KB Output is correct
10 Correct 254 ms 18460 KB Output is correct
11 Correct 302 ms 35800 KB Output is correct
12 Correct 262 ms 30560 KB Output is correct
13 Correct 167 ms 664 KB Output is correct
14 Correct 0 ms 664 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 664 KB Output is correct
2 Correct 139 ms 792 KB Output is correct
3 Correct 197 ms 13276 KB Output is correct
4 Correct 127 ms 664 KB Output is correct
5 Correct 200 ms 10060 KB Output is correct
6 Correct 126 ms 664 KB Output is correct
7 Correct 147 ms 664 KB Output is correct
8 Correct 150 ms 664 KB Output is correct
9 Correct 221 ms 18324 KB Output is correct
10 Correct 254 ms 18460 KB Output is correct
11 Correct 302 ms 35800 KB Output is correct
12 Correct 262 ms 30560 KB Output is correct
13 Correct 167 ms 664 KB Output is correct
14 Correct 0 ms 664 KB Output is correct
15 Correct 166 ms 664 KB Output is correct
16 Correct 161 ms 664 KB Output is correct
17 Correct 177 ms 664 KB Output is correct
18 Correct 224 ms 10176 KB Output is correct
19 Correct 215 ms 664 KB Output is correct
20 Correct 232 ms 10600 KB Output is correct
21 Correct 199 ms 916 KB Output is correct
22 Correct 185 ms 664 KB Output is correct
23 Correct 322 ms 22396 KB Output is correct
24 Correct 296 ms 22356 KB Output is correct
25 Correct 385 ms 43660 KB Output is correct
26 Correct 320 ms 36612 KB Output is correct
27 Correct 201 ms 888 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 664 KB Output is correct
2 Correct 139 ms 792 KB Output is correct
3 Correct 197 ms 13276 KB Output is correct
4 Correct 127 ms 664 KB Output is correct
5 Correct 200 ms 10060 KB Output is correct
6 Correct 126 ms 664 KB Output is correct
7 Correct 147 ms 664 KB Output is correct
8 Correct 150 ms 664 KB Output is correct
9 Correct 221 ms 18324 KB Output is correct
10 Correct 254 ms 18460 KB Output is correct
11 Correct 302 ms 35800 KB Output is correct
12 Correct 262 ms 30560 KB Output is correct
13 Correct 167 ms 664 KB Output is correct
14 Correct 0 ms 664 KB Output is correct
15 Correct 166 ms 664 KB Output is correct
16 Correct 161 ms 664 KB Output is correct
17 Correct 177 ms 664 KB Output is correct
18 Correct 224 ms 10176 KB Output is correct
19 Correct 215 ms 664 KB Output is correct
20 Correct 232 ms 10600 KB Output is correct
21 Correct 199 ms 916 KB Output is correct
22 Correct 185 ms 664 KB Output is correct
23 Correct 322 ms 22396 KB Output is correct
24 Correct 296 ms 22356 KB Output is correct
25 Correct 385 ms 43660 KB Output is correct
26 Correct 320 ms 36612 KB Output is correct
27 Correct 201 ms 888 KB Output is correct
28 Correct 243 ms 664 KB Output is correct
29 Correct 228 ms 788 KB Output is correct
30 Correct 426 ms 24232 KB Output is correct
31 Correct 272 ms 796 KB Output is correct
32 Correct 332 ms 21188 KB Output is correct
33 Correct 245 ms 916 KB Output is correct
34 Correct 283 ms 896 KB Output is correct
35 Correct 234 ms 900 KB Output is correct
36 Correct 353 ms 24972 KB Output is correct
37 Correct 391 ms 24984 KB Output is correct
38 Correct 468 ms 49276 KB Output is correct
39 Correct 486 ms 44412 KB Output is correct
40 Correct 263 ms 1176 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 379 ms 1052 KB Output is correct
2 Correct 0 ms 664 KB Output is correct
3 Correct 364 ms 1052 KB Output is correct
4 Correct 397 ms 10260 KB Output is correct
5 Correct 17 ms 920 KB Output is correct
6 Correct 412 ms 2456 KB Output is correct
7 Correct 0 ms 664 KB Output is correct
8 Correct 353 ms 876 KB Output is correct
9 Correct 329 ms 936 KB Output is correct
10 Correct 436 ms 27768 KB Output is correct
11 Correct 441 ms 24196 KB Output is correct
12 Correct 65 ms 664 KB Output is correct
13 Correct 430 ms 24448 KB Output is correct
14 Correct 389 ms 864 KB Output is correct
15 Correct 1 ms 664 KB Output is correct
16 Correct 414 ms 792 KB Output is correct
17 Correct 371 ms 876 KB Output is correct
18 Correct 311 ms 872 KB Output is correct
19 Correct 327 ms 864 KB Output is correct
20 Correct 370 ms 876 KB Output is correct
21 Correct 356 ms 800 KB Output is correct
22 Correct 366 ms 792 KB Output is correct
23 Correct 415 ms 1052 KB Output is correct
24 Correct 151 ms 664 KB Output is correct
25 Correct 139 ms 792 KB Output is correct
26 Correct 197 ms 13276 KB Output is correct
27 Correct 127 ms 664 KB Output is correct
28 Correct 200 ms 10060 KB Output is correct
29 Correct 126 ms 664 KB Output is correct
30 Correct 147 ms 664 KB Output is correct
31 Correct 150 ms 664 KB Output is correct
32 Correct 221 ms 18324 KB Output is correct
33 Correct 254 ms 18460 KB Output is correct
34 Correct 302 ms 35800 KB Output is correct
35 Correct 262 ms 30560 KB Output is correct
36 Correct 167 ms 664 KB Output is correct
37 Correct 0 ms 664 KB Output is correct
38 Correct 166 ms 664 KB Output is correct
39 Correct 161 ms 664 KB Output is correct
40 Correct 177 ms 664 KB Output is correct
41 Correct 224 ms 10176 KB Output is correct
42 Correct 215 ms 664 KB Output is correct
43 Correct 232 ms 10600 KB Output is correct
44 Correct 199 ms 916 KB Output is correct
45 Correct 185 ms 664 KB Output is correct
46 Correct 322 ms 22396 KB Output is correct
47 Correct 296 ms 22356 KB Output is correct
48 Correct 385 ms 43660 KB Output is correct
49 Correct 320 ms 36612 KB Output is correct
50 Correct 201 ms 888 KB Output is correct
51 Correct 243 ms 664 KB Output is correct
52 Correct 228 ms 788 KB Output is correct
53 Correct 426 ms 24232 KB Output is correct
54 Correct 272 ms 796 KB Output is correct
55 Correct 332 ms 21188 KB Output is correct
56 Correct 245 ms 916 KB Output is correct
57 Correct 283 ms 896 KB Output is correct
58 Correct 234 ms 900 KB Output is correct
59 Correct 353 ms 24972 KB Output is correct
60 Correct 391 ms 24984 KB Output is correct
61 Correct 468 ms 49276 KB Output is correct
62 Correct 486 ms 44412 KB Output is correct
63 Correct 263 ms 1176 KB Output is correct
64 Correct 387 ms 1224 KB Output is correct
65 Correct 484 ms 26500 KB Output is correct
66 Correct 510 ms 23592 KB Output is correct
67 Correct 374 ms 1176 KB Output is correct
68 Correct 395 ms 1196 KB Output is correct
69 Correct 538 ms 47884 KB Output is correct
70 Correct 546 ms 39688 KB Output is correct
71 Correct 408 ms 5272 KB Output is correct
72 Correct 361 ms 1176 KB Output is correct