oj.uz

Submission #943732

# Submission time Handle Problem Language Result Execution time Memory
943732 2024-03-11T18:50:00 Z yeediot Two Transportations (JOI19_transportations) C++14
100 / 100
 683 ms 72780 KB 
#include "Azer.h"
#include<bits/stdc++.h>
using namespace std;
#define S second
#define F first
namespace {
    const int mxn=5e5+5;
    int cur=0,bit=0,n,cnt;
    vector<pair<int,int>>adj[mxn];
    vector<int>dis;
    vector<bool>vis;
    int prev=0;
    bool first=1;
    pair<int,int>mn={(1<<9)-1,(1<<9)-1};
    void send(int a,int b){
        b--;
        for(;b>=0;b--){
            SendA(a>>b&1);
        }
    }
    void gmn(){
        dis[mn.S]=prev+mn.F;
        prev=dis[mn.S];
        cnt--;
        vis[mn.S]=1;
        for(auto [u,d]:adj[mn.S]){
            dis[u]=min(dis[u],dis[mn.S]+d);
        }
        mn={(1<<9)-1,(1<<9)-1};
        for(int i=0;i<n;i++){
            if(vis[i])continue;
            mn=min(mn,{dis[i]-prev,i});
        }
        if(cnt>0)send(mn.F,9);
    }
    void gdis(){
        if(cur==(1<<9)-1){
            send(mn.S,11);
            gmn();
            first=1;
        }
        else{
            mn.F=cur;
            first=0;
        }
        cur=bit=0;
    }
    void gid(){
        mn.S=cur;
        cur=bit=0;
        first=1;
        gmn();
    }
}  // namespace
void InitA(int N, int A, std::vector<int> U, std::vector<int> V,std::vector<int> C) {
    for(int i=0;i<A;i++){
        adj[V[i]].push_back({U[i],C[i]});
        adj[U[i]].push_back({V[i],C[i]});
    }
    n=N;
    cnt=n;
    dis=vector<int>(N);
    vis=vector<bool>(N);
    dis[0]=0;
    vis[0]=1;
    cnt--;
    for(int i=1;i<N;i++){
        dis[i]=1e9;
        vis[i]=0;
    }
    int v=0;
    for(auto [u,d]:adj[v]){
        dis[u]=min(dis[u],dis[v]+d);
        mn=min(mn,{dis[u],u});
    }
    send(mn.F,9);
}
 
void ReceiveA(bool x) {
    cur=cur*2+x;
    bit++;
    if(bit==9 and first){
        gdis();
    }
    else if(bit==11){
        gid();
    }
}
 
std::vector<int> Answer() {
    return dis;
}
#include "Baijan.h"
#include<bits/stdc++.h>
using namespace std;
#define S second
#define F first
namespace {
    const int mxn=5e5+5;
    int cur=0,bit=0,n;
    vector<pair<int,int>>adj[mxn];
    vector<int>dis;
    int prev=0;
    vector<bool>vis;
    bool first=1;
    pair<int,int>mn={(1<<9)-1,(1<<9)-1};
    void send(int a,int b){
        b--;
        for(;b>=0;b--){
            SendB(a>>b&1);
        }
    }
    void gmn(){
        dis[mn.S]=prev+mn.F;
        prev=dis[mn.S];
        vis[mn.S]=1;
        for(auto [u,d]:adj[mn.S]){
            dis[u]=min(dis[u],dis[mn.S]+d);
        }
        mn={(1<<9)-1,(1<<9)-1};
        for(int i=0;i<n;i++){
            if(vis[i])continue;
            mn=min(mn,{dis[i]-prev,i});
        }
    }
    void gdis(){
        if(mn.F>cur){
            mn.F=cur;
            send((1<<9)-1,9);
            first=0;
        }
        else{
            send(mn.F,9);
            send(mn.S,11);
            gmn();
        }
        cur=bit=0;
    }
    void gid(){
        mn.S=cur;
        cur=bit=0;
        first=1;
        gmn();
    }
}  // namespace
void InitB(int N, int B, std::vector<int> U, std::vector<int> V,std::vector<int> C) {
    for(int i=0;i<B;i++){
        adj[V[i]].push_back({U[i],C[i]});
        adj[U[i]].push_back({V[i],C[i]});
    }
    n=N;
    dis=vector<int>(N);
    vis=vector<bool>(N);
    dis[0]=0;
    vis[0]=1;
    for(int i=1;i<N;i++){
        dis[i]=1e9;
        vis[i]=0;
    }
    int v=0;
    for(auto [u,d]:adj[v]){
        dis[u]=min(dis[u],dis[v]+d);
        mn=min(mn,{dis[u],u});
    }
}
void ReceiveB(bool x) {
    cur=cur*2+x;
    bit++;
    if(bit==9 and first){
        gdis();
    }
    else if(bit==11){
        gid();
    }
}

Compilation message

Azer.cpp: In function 'void {anonymous}::gmn()':
Azer.cpp:26:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   26 |         for(auto [u,d]:adj[mn.S]){
      |                  ^
Azer.cpp: In function 'void InitA(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
Azer.cpp:72:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   72 |     for(auto [u,d]:adj[v]){
      |              ^

Baijan.cpp: In function 'void {anonymous}::gmn()':
Baijan.cpp:25:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   25 |         for(auto [u,d]:adj[mn.S]){
      |                  ^
Baijan.cpp: In function 'void InitB(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
Baijan.cpp:69:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   69 |     for(auto [u,d]:adj[v]){
      |              ^

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 358 ms 24280 KB Output is correct
2 Correct 8 ms 24276 KB Output is correct
3 Correct 391 ms 24264 KB Output is correct
4 Correct 469 ms 33760 KB Output is correct
5 Correct 23 ms 24472 KB Output is correct
6 Correct 345 ms 25836 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 24292 KB Output is correct
2 Correct 307 ms 24356 KB Output is correct
3 Correct 361 ms 24408 KB Output is correct
4 Correct 516 ms 51148 KB Output is correct
5 Correct 536 ms 47840 KB Output is correct
6 Correct 86 ms 24256 KB Output is correct
7 Correct 502 ms 47836 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 409 ms 24332 KB Output is correct
2 Correct 8 ms 24276 KB Output is correct
3 Correct 324 ms 24260 KB Output is correct
4 Correct 358 ms 24348 KB Output is correct
5 Correct 341 ms 24356 KB Output is correct
6 Correct 331 ms 24584 KB Output is correct
7 Correct 316 ms 24352 KB Output is correct
8 Correct 368 ms 24272 KB Output is correct
9 Correct 403 ms 24516 KB Output is correct
10 Correct 371 ms 24264 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 24288 KB Output is correct
2 Correct 136 ms 24260 KB Output is correct
3 Correct 258 ms 36848 KB Output is correct
4 Correct 142 ms 24216 KB Output is correct
5 Correct 238 ms 33452 KB Output is correct
6 Correct 154 ms 24300 KB Output is correct
7 Correct 210 ms 24216 KB Output is correct
8 Correct 153 ms 24100 KB Output is correct
9 Correct 239 ms 41776 KB Output is correct
10 Correct 311 ms 41816 KB Output is correct
11 Correct 388 ms 59004 KB Output is correct
12 Correct 368 ms 54404 KB Output is correct
13 Correct 129 ms 24216 KB Output is correct
14 Correct 8 ms 24272 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 24288 KB Output is correct
2 Correct 136 ms 24260 KB Output is correct
3 Correct 258 ms 36848 KB Output is correct
4 Correct 142 ms 24216 KB Output is correct
5 Correct 238 ms 33452 KB Output is correct
6 Correct 154 ms 24300 KB Output is correct
7 Correct 210 ms 24216 KB Output is correct
8 Correct 153 ms 24100 KB Output is correct
9 Correct 239 ms 41776 KB Output is correct
10 Correct 311 ms 41816 KB Output is correct
11 Correct 388 ms 59004 KB Output is correct
12 Correct 368 ms 54404 KB Output is correct
13 Correct 129 ms 24216 KB Output is correct
14 Correct 8 ms 24272 KB Output is correct
15 Correct 205 ms 24296 KB Output is correct
16 Correct 215 ms 24216 KB Output is correct
17 Correct 200 ms 24316 KB Output is correct
18 Correct 255 ms 33868 KB Output is correct
19 Correct 210 ms 24216 KB Output is correct
20 Correct 243 ms 33932 KB Output is correct
21 Correct 195 ms 24340 KB Output is correct
22 Correct 214 ms 24216 KB Output is correct
23 Correct 289 ms 45788 KB Output is correct
24 Correct 326 ms 45544 KB Output is correct
25 Correct 423 ms 67260 KB Output is correct
26 Correct 359 ms 60628 KB Output is correct
27 Correct 145 ms 24364 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 24288 KB Output is correct
2 Correct 136 ms 24260 KB Output is correct
3 Correct 258 ms 36848 KB Output is correct
4 Correct 142 ms 24216 KB Output is correct
5 Correct 238 ms 33452 KB Output is correct
6 Correct 154 ms 24300 KB Output is correct
7 Correct 210 ms 24216 KB Output is correct
8 Correct 153 ms 24100 KB Output is correct
9 Correct 239 ms 41776 KB Output is correct
10 Correct 311 ms 41816 KB Output is correct
11 Correct 388 ms 59004 KB Output is correct
12 Correct 368 ms 54404 KB Output is correct
13 Correct 129 ms 24216 KB Output is correct
14 Correct 8 ms 24272 KB Output is correct
15 Correct 205 ms 24296 KB Output is correct
16 Correct 215 ms 24216 KB Output is correct
17 Correct 200 ms 24316 KB Output is correct
18 Correct 255 ms 33868 KB Output is correct
19 Correct 210 ms 24216 KB Output is correct
20 Correct 243 ms 33932 KB Output is correct
21 Correct 195 ms 24340 KB Output is correct
22 Correct 214 ms 24216 KB Output is correct
23 Correct 289 ms 45788 KB Output is correct
24 Correct 326 ms 45544 KB Output is correct
25 Correct 423 ms 67260 KB Output is correct
26 Correct 359 ms 60628 KB Output is correct
27 Correct 145 ms 24364 KB Output is correct
28 Correct 238 ms 24564 KB Output is correct
29 Correct 247 ms 24260 KB Output is correct
30 Correct 353 ms 47612 KB Output is correct
31 Correct 237 ms 24512 KB Output is correct
32 Correct 332 ms 44632 KB Output is correct
33 Correct 278 ms 24336 KB Output is correct
34 Correct 261 ms 24364 KB Output is correct
35 Correct 232 ms 24372 KB Output is correct
36 Correct 323 ms 48748 KB Output is correct
37 Correct 408 ms 48368 KB Output is correct
38 Correct 524 ms 72780 KB Output is correct
39 Correct 479 ms 67768 KB Output is correct
40 Correct 217 ms 24396 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 358 ms 24280 KB Output is correct
2 Correct 8 ms 24276 KB Output is correct
3 Correct 391 ms 24264 KB Output is correct
4 Correct 469 ms 33760 KB Output is correct
5 Correct 23 ms 24472 KB Output is correct
6 Correct 345 ms 25836 KB Output is correct
7 Correct 12 ms 24292 KB Output is correct
8 Correct 307 ms 24356 KB Output is correct
9 Correct 361 ms 24408 KB Output is correct
10 Correct 516 ms 51148 KB Output is correct
11 Correct 536 ms 47840 KB Output is correct
12 Correct 86 ms 24256 KB Output is correct
13 Correct 502 ms 47836 KB Output is correct
14 Correct 409 ms 24332 KB Output is correct
15 Correct 8 ms 24276 KB Output is correct
16 Correct 324 ms 24260 KB Output is correct
17 Correct 358 ms 24348 KB Output is correct
18 Correct 341 ms 24356 KB Output is correct
19 Correct 331 ms 24584 KB Output is correct
20 Correct 316 ms 24352 KB Output is correct
21 Correct 368 ms 24272 KB Output is correct
22 Correct 403 ms 24516 KB Output is correct
23 Correct 371 ms 24264 KB Output is correct
24 Correct 150 ms 24288 KB Output is correct
25 Correct 136 ms 24260 KB Output is correct
26 Correct 258 ms 36848 KB Output is correct
27 Correct 142 ms 24216 KB Output is correct
28 Correct 238 ms 33452 KB Output is correct
29 Correct 154 ms 24300 KB Output is correct
30 Correct 210 ms 24216 KB Output is correct
31 Correct 153 ms 24100 KB Output is correct
32 Correct 239 ms 41776 KB Output is correct
33 Correct 311 ms 41816 KB Output is correct
34 Correct 388 ms 59004 KB Output is correct
35 Correct 368 ms 54404 KB Output is correct
36 Correct 129 ms 24216 KB Output is correct
37 Correct 8 ms 24272 KB Output is correct
38 Correct 205 ms 24296 KB Output is correct
39 Correct 215 ms 24216 KB Output is correct
40 Correct 200 ms 24316 KB Output is correct
41 Correct 255 ms 33868 KB Output is correct
42 Correct 210 ms 24216 KB Output is correct
43 Correct 243 ms 33932 KB Output is correct
44 Correct 195 ms 24340 KB Output is correct
45 Correct 214 ms 24216 KB Output is correct
46 Correct 289 ms 45788 KB Output is correct
47 Correct 326 ms 45544 KB Output is correct
48 Correct 423 ms 67260 KB Output is correct
49 Correct 359 ms 60628 KB Output is correct
50 Correct 145 ms 24364 KB Output is correct
51 Correct 238 ms 24564 KB Output is correct
52 Correct 247 ms 24260 KB Output is correct
53 Correct 353 ms 47612 KB Output is correct
54 Correct 237 ms 24512 KB Output is correct
55 Correct 332 ms 44632 KB Output is correct
56 Correct 278 ms 24336 KB Output is correct
57 Correct 261 ms 24364 KB Output is correct
58 Correct 232 ms 24372 KB Output is correct
59 Correct 323 ms 48748 KB Output is correct
60 Correct 408 ms 48368 KB Output is correct
61 Correct 524 ms 72780 KB Output is correct
62 Correct 479 ms 67768 KB Output is correct
63 Correct 217 ms 24396 KB Output is correct
64 Correct 324 ms 24432 KB Output is correct
65 Correct 446 ms 50176 KB Output is correct
66 Correct 509 ms 47100 KB Output is correct
67 Correct 345 ms 24416 KB Output is correct
68 Correct 334 ms 24408 KB Output is correct
69 Correct 603 ms 71404 KB Output is correct
70 Correct 683 ms 63048 KB Output is correct
71 Correct 382 ms 28616 KB Output is correct
72 Correct 399 ms 24728 KB Output is correct