oj.uz

Submission #780625

# Submission time Handle Problem Language Result Execution time Memory
780625 2023-07-12T10:53:31 Z bachhoangxuan Two Transportations (JOI19_transportations) C++17
100 / 100
 677 ms 48796 KB 
#include "Azer.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>

namespace A{
    const int inf=(1<<20)-1;
    int N,cnt=0,pu=0,pv=0,cur=0,lst=0;
    vector<bool> used;
    vector<int> dist;
    vector<vector<pii>> edge;
    void d(int u){
        used[u]=true;lst=dist[u];
        for(pii v:edge[u]) dist[v.first]=min(dist[v.first],dist[u]+v.second);
    }
    void Send(){
        int u=-1;
        for(int i=0;i<N;i++) if(!used[i] && (u==-1 || dist[i]<dist[u])) u=i;
        if(u==-1) return;
        int x=min(dist[u]-lst,501);pu=u;
        for(int i=0;i<9;i++) SendA((x>>i)&1);
    }
    void Receive(bool x){
        if(cnt<9){
            if(x) cur|=(1<<cnt);
            if(++cnt==9){
                cur+=lst;
                if(dist[pu]<cur){
                    for(int i=0;i<11;i++) SendA((pu>>i)&1);
                    d(pu);Send();cnt=cur=0;
                }
                else pv=0;
            }
        }
        else{
            if(x) pv|=(1<<(cnt-9));
            if(++cnt==20){
                dist[pv]=min(dist[pv],cur);
                d(pv);Send();
                cnt=cur=0;
            }
        }
    }
}  // namespace

void InitA(int N, int A, vector<int> U, vector<int> V, vector<int> C) {
    A::N=N;
    A::used.resize(N);
    A::dist.assign(N,A::inf);
    A::edge.resize(N);
    for(int i=0;i<A;i++){
        A::edge[U[i]].push_back({V[i],C[i]});
        A::edge[V[i]].push_back({U[i],C[i]});
    }
    A::dist[0]=0;A::d(0);
    A::Send();
}

void ReceiveA(bool x) {
    A::Receive(x);
}

vector<int> Answer() {
  return A::dist;
}

#include "Baijan.h"
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>

namespace B{
    const int inf=(1<<20)-1;
    int N,cnt=0,pu=0,pv=0,cur=0,lst=0;
    vector<bool> used;
    vector<int> dist;
    vector<vector<pii>> edge;
    void d(int u){
        used[u]=true;lst=dist[u];
        for(pii v:edge[u]) dist[v.first]=min(dist[v.first],dist[u]+v.second);
    }
    void Send(){
        int u=-1;
        for(int i=0;i<N;i++) if(!used[i] && (u==-1 || dist[i]<dist[u])) u=i;
        if(u==-1) return;
        int x=min(dist[u]-lst,501);pu=u;
        for(int i=0;i<9;i++) SendB((x>>i)&1);
    }
    void Receive(bool x){
        if(cnt<9){
            if(x) cur|=(1<<cnt);
            if(++cnt==9){
                cur+=lst;
                if(dist[pu]<=cur){
                    for(int i=0;i<11;i++) SendB((pu>>i)&1);
                    d(pu);Send();cnt=cur=0;
                }
                else pv=0;
            }
        }
        else{
            if(x) pv|=(1<<(cnt-9));
            if(++cnt==20){
                dist[pv]=min(dist[pv],cur);
                d(pv);Send();
                cnt=cur=0;
            }
        }
    }
}  // namespace

void InitB(int N, int B, vector<int> U, vector<int> V, vector<int> C) {
    B::N=N;
    B::used.resize(N);
    B::dist.assign(N,B::inf);
    B::edge.resize(N);
    for(int i=0;i<B;i++){
        B::edge[U[i]].push_back({V[i],C[i]});
        B::edge[V[i]].push_back({U[i],C[i]});
    }
    B::dist[0]=0;B::d(0);
    B::Send();
}

void ReceiveB(bool x) {
    B::Receive(x);
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 346 ms 784 KB Output is correct
2 Correct 2 ms 400 KB Output is correct
3 Correct 479 ms 784 KB Output is correct
4 Correct 474 ms 10044 KB Output is correct
5 Correct 24 ms 656 KB Output is correct
6 Correct 418 ms 2120 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 400 KB Output is correct
2 Correct 488 ms 740 KB Output is correct
3 Correct 393 ms 800 KB Output is correct
4 Correct 524 ms 27536 KB Output is correct
5 Correct 591 ms 24164 KB Output is correct
6 Correct 65 ms 528 KB Output is correct
7 Correct 494 ms 24108 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 297 ms 724 KB Output is correct
2 Correct 0 ms 400 KB Output is correct
3 Correct 410 ms 656 KB Output is correct
4 Correct 384 ms 748 KB Output is correct
5 Correct 324 ms 796 KB Output is correct
6 Correct 481 ms 732 KB Output is correct
7 Correct 401 ms 736 KB Output is correct
8 Correct 426 ms 668 KB Output is correct
9 Correct 472 ms 660 KB Output is correct
10 Correct 308 ms 788 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 656 KB Output is correct
2 Correct 226 ms 528 KB Output is correct
3 Correct 249 ms 13212 KB Output is correct
4 Correct 239 ms 656 KB Output is correct
5 Correct 246 ms 9980 KB Output is correct
6 Correct 230 ms 656 KB Output is correct
7 Correct 186 ms 656 KB Output is correct
8 Correct 157 ms 696 KB Output is correct
9 Correct 248 ms 18076 KB Output is correct
10 Correct 204 ms 18108 KB Output is correct
11 Correct 348 ms 35512 KB Output is correct
12 Correct 313 ms 30816 KB Output is correct
13 Correct 191 ms 656 KB Output is correct
14 Correct 0 ms 400 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 656 KB Output is correct
2 Correct 226 ms 528 KB Output is correct
3 Correct 249 ms 13212 KB Output is correct
4 Correct 239 ms 656 KB Output is correct
5 Correct 246 ms 9980 KB Output is correct
6 Correct 230 ms 656 KB Output is correct
7 Correct 186 ms 656 KB Output is correct
8 Correct 157 ms 696 KB Output is correct
9 Correct 248 ms 18076 KB Output is correct
10 Correct 204 ms 18108 KB Output is correct
11 Correct 348 ms 35512 KB Output is correct
12 Correct 313 ms 30816 KB Output is correct
13 Correct 191 ms 656 KB Output is correct
14 Correct 0 ms 400 KB Output is correct
15 Correct 205 ms 664 KB Output is correct
16 Correct 280 ms 568 KB Output is correct
17 Correct 223 ms 528 KB Output is correct
18 Correct 250 ms 10000 KB Output is correct
19 Correct 222 ms 692 KB Output is correct
20 Correct 295 ms 10216 KB Output is correct
21 Correct 228 ms 656 KB Output is correct
22 Correct 261 ms 656 KB Output is correct
23 Correct 357 ms 22024 KB Output is correct
24 Correct 325 ms 22132 KB Output is correct
25 Correct 433 ms 43552 KB Output is correct
26 Correct 405 ms 36556 KB Output is correct
27 Correct 198 ms 736 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 656 KB Output is correct
2 Correct 226 ms 528 KB Output is correct
3 Correct 249 ms 13212 KB Output is correct
4 Correct 239 ms 656 KB Output is correct
5 Correct 246 ms 9980 KB Output is correct
6 Correct 230 ms 656 KB Output is correct
7 Correct 186 ms 656 KB Output is correct
8 Correct 157 ms 696 KB Output is correct
9 Correct 248 ms 18076 KB Output is correct
10 Correct 204 ms 18108 KB Output is correct
11 Correct 348 ms 35512 KB Output is correct
12 Correct 313 ms 30816 KB Output is correct
13 Correct 191 ms 656 KB Output is correct
14 Correct 0 ms 400 KB Output is correct
15 Correct 205 ms 664 KB Output is correct
16 Correct 280 ms 568 KB Output is correct
17 Correct 223 ms 528 KB Output is correct
18 Correct 250 ms 10000 KB Output is correct
19 Correct 222 ms 692 KB Output is correct
20 Correct 295 ms 10216 KB Output is correct
21 Correct 228 ms 656 KB Output is correct
22 Correct 261 ms 656 KB Output is correct
23 Correct 357 ms 22024 KB Output is correct
24 Correct 325 ms 22132 KB Output is correct
25 Correct 433 ms 43552 KB Output is correct
26 Correct 405 ms 36556 KB Output is correct
27 Correct 198 ms 736 KB Output is correct
28 Correct 314 ms 688 KB Output is correct
29 Correct 168 ms 656 KB Output is correct
30 Correct 420 ms 23960 KB Output is correct
31 Correct 301 ms 656 KB Output is correct
32 Correct 433 ms 21032 KB Output is correct
33 Correct 257 ms 732 KB Output is correct
34 Correct 304 ms 756 KB Output is correct
35 Correct 309 ms 744 KB Output is correct
36 Correct 406 ms 24612 KB Output is correct
37 Correct 387 ms 24748 KB Output is correct
38 Correct 459 ms 48796 KB Output is correct
39 Correct 506 ms 44152 KB Output is correct
40 Correct 322 ms 912 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 346 ms 784 KB Output is correct
2 Correct 2 ms 400 KB Output is correct
3 Correct 479 ms 784 KB Output is correct
4 Correct 474 ms 10044 KB Output is correct
5 Correct 24 ms 656 KB Output is correct
6 Correct 418 ms 2120 KB Output is correct
7 Correct 0 ms 400 KB Output is correct
8 Correct 488 ms 740 KB Output is correct
9 Correct 393 ms 800 KB Output is correct
10 Correct 524 ms 27536 KB Output is correct
11 Correct 591 ms 24164 KB Output is correct
12 Correct 65 ms 528 KB Output is correct
13 Correct 494 ms 24108 KB Output is correct
14 Correct 297 ms 724 KB Output is correct
15 Correct 0 ms 400 KB Output is correct
16 Correct 410 ms 656 KB Output is correct
17 Correct 384 ms 748 KB Output is correct
18 Correct 324 ms 796 KB Output is correct
19 Correct 481 ms 732 KB Output is correct
20 Correct 401 ms 736 KB Output is correct
21 Correct 426 ms 668 KB Output is correct
22 Correct 472 ms 660 KB Output is correct
23 Correct 308 ms 788 KB Output is correct
24 Correct 185 ms 656 KB Output is correct
25 Correct 226 ms 528 KB Output is correct
26 Correct 249 ms 13212 KB Output is correct
27 Correct 239 ms 656 KB Output is correct
28 Correct 246 ms 9980 KB Output is correct
29 Correct 230 ms 656 KB Output is correct
30 Correct 186 ms 656 KB Output is correct
31 Correct 157 ms 696 KB Output is correct
32 Correct 248 ms 18076 KB Output is correct
33 Correct 204 ms 18108 KB Output is correct
34 Correct 348 ms 35512 KB Output is correct
35 Correct 313 ms 30816 KB Output is correct
36 Correct 191 ms 656 KB Output is correct
37 Correct 0 ms 400 KB Output is correct
38 Correct 205 ms 664 KB Output is correct
39 Correct 280 ms 568 KB Output is correct
40 Correct 223 ms 528 KB Output is correct
41 Correct 250 ms 10000 KB Output is correct
42 Correct 222 ms 692 KB Output is correct
43 Correct 295 ms 10216 KB Output is correct
44 Correct 228 ms 656 KB Output is correct
45 Correct 261 ms 656 KB Output is correct
46 Correct 357 ms 22024 KB Output is correct
47 Correct 325 ms 22132 KB Output is correct
48 Correct 433 ms 43552 KB Output is correct
49 Correct 405 ms 36556 KB Output is correct
50 Correct 198 ms 736 KB Output is correct
51 Correct 314 ms 688 KB Output is correct
52 Correct 168 ms 656 KB Output is correct
53 Correct 420 ms 23960 KB Output is correct
54 Correct 301 ms 656 KB Output is correct
55 Correct 433 ms 21032 KB Output is correct
56 Correct 257 ms 732 KB Output is correct
57 Correct 304 ms 756 KB Output is correct
58 Correct 309 ms 744 KB Output is correct
59 Correct 406 ms 24612 KB Output is correct
60 Correct 387 ms 24748 KB Output is correct
61 Correct 459 ms 48796 KB Output is correct
62 Correct 506 ms 44152 KB Output is correct
63 Correct 322 ms 912 KB Output is correct
64 Correct 424 ms 956 KB Output is correct
65 Correct 516 ms 26524 KB Output is correct
66 Correct 504 ms 23276 KB Output is correct
67 Correct 413 ms 888 KB Output is correct
68 Correct 420 ms 932 KB Output is correct
69 Correct 677 ms 47632 KB Output is correct
70 Correct 667 ms 39424 KB Output is correct
71 Correct 360 ms 4952 KB Output is correct
72 Correct 429 ms 1168 KB Output is correct