oj.uz

Submission #943727

# Submission time Handle Problem Language Result Execution time Memory
943727 2024-03-11T18:44:45 Z yeediot Two Transportations (JOI19_transportations) C++14
100 / 100
 621 ms 72424 KB 
#include "Azer.h"
#include<bits/stdc++.h>
using namespace std;
#define S second
#define F first
namespace {
    const int mxn=5e5+5;
    int n;
    vector<pair<int,int>>adj[mxn];
    int cur=0;
    int bit=0;
    int prv=0;
    int first=0;
    int cnt=0;
    vector<int>dis;
    vector<bool>vis;
    pair<int,int>mn={511,511};
    void send(int a,int b){
        b--;
        for(;b>=0;b--){
            if(a&(1<<b)){
                SendA(1);
            }
            else{
                SendA(0);
            }
        }
    }
    void gmn(){
        dis[mn.S]=prv+mn.F;
        prv=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={511,511};
        for(int i=0;i<n;i++){
            if(vis[i])continue;
            mn=min(mn,{dis[i]-prv,i});
        }
        if(cnt<n)send(mn.F,9);
    }
    void gdis(){
        if(cur==511){
            send(mn.S,11);
            gmn();
            cur=bit=0;
        }
        else{
            mn.F=cur;
            first=1;
            cur=bit=0;
        }
    }
    void gid(){
        mn.S=cur;
        gmn();
        cur=bit=0;
        first=0;
    }
}  // 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=0;
    dis=vector<int>(N,1e9);
    vis=vector<bool>(N,0);
    dis[0]=0;
    vis[0]=1;
    cnt++;
    int v=0;
    for(auto [u,d]:adj[v]){
        dis[u]=min(dis[u],dis[v]+d);
    }
    for(int i=0;i<n;i++){
        if(vis[i])continue;
        mn=min(mn,{dis[i]-prv,i});
    }
    send(mn.F,9);
}

void ReceiveA(bool x) {
    cur=cur*2+x;
    bit++;
    if(bit==9 and first==0){
        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 n;
    int cur=0,bit=0,prv=0,first=0;
    vector<pair<int,int>>adj[mxn];
    vector<int>dis;
    vector<bool>vis;
    pair<int,int>mn={511,511};
    void send(int a,int b){
        b--;
        for(;b>=0;b--){
            if(a&(1<<b)){
                SendB(1);
            }
            else{
                SendB(0);
            }
        }
    }
    void gmn(){
        dis[mn.S]=prv+mn.F;
        prv=dis[mn.S];
        vis[mn.S]=1;
        for(auto [u,d]:adj[mn.S]){
            dis[u]=min(dis[u],dis[mn.S]+d);
        }
        mn={511,511};
        for(int i=0;i<n;i++){
            if(vis[i])continue;
            mn=min(mn,{dis[i]-prv,i});
        }
    }
    void gdis(){
        if(mn.F>cur){
            mn.F=cur;
            send(511,9);
            cur=bit=0;
            first=1;
        }
        else{
            send(mn.F,9);
            send(mn.S,11);
            gmn();
            cur=bit=0;
        }
    }
    void gid(){
        mn.S=cur;
        gmn();
        cur=bit=0;
        first=0;
    }
}  // 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,1e9);
    vis=vector<bool>(N,0);
    dis[0]=0;
    vis[0]=1;
    int v=0;
    for(auto [u,d]:adj[v]){
        dis[u]=min(dis[u],dis[v]+d);
    }
    for(int i=0;i<n;i++){
        if(vis[i])continue;
        mn=min(mn,{dis[i],i});
    }
}
void ReceiveB(bool x) {
    cur=cur*2+x;
    bit++;
    if(bit==9 and first==0){
        gdis();
    }
    else if(bit==11){
        gid();
    }
}

Compilation message

Azer.cpp: In function 'void {anonymous}::gmn()':
Azer.cpp:34:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   34 |         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:76:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   76 |     for(auto [u,d]:adj[v]){
      |              ^

Baijan.cpp: In function 'void {anonymous}::gmn()':
Baijan.cpp:29:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   29 |         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:70:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   70 |     for(auto [u,d]:adj[v]){
      |              ^

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 427 ms 24260 KB Output is correct
2 Correct 7 ms 24276 KB Output is correct
3 Correct 307 ms 24260 KB Output is correct
4 Correct 417 ms 33956 KB Output is correct
5 Correct 18 ms 24472 KB Output is correct
6 Correct 379 ms 25832 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 24276 KB Output is correct
2 Correct 415 ms 24352 KB Output is correct
3 Correct 312 ms 24408 KB Output is correct
4 Correct 544 ms 51160 KB Output is correct
5 Correct 473 ms 47796 KB Output is correct
6 Correct 71 ms 24256 KB Output is correct
7 Correct 482 ms 48088 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 405 ms 24332 KB Output is correct
2 Correct 7 ms 24272 KB Output is correct
3 Correct 428 ms 24264 KB Output is correct
4 Correct 358 ms 24356 KB Output is correct
5 Correct 339 ms 24348 KB Output is correct
6 Correct 449 ms 24444 KB Output is correct
7 Correct 420 ms 24344 KB Output is correct
8 Correct 387 ms 24276 KB Output is correct
9 Correct 331 ms 24260 KB Output is correct
10 Correct 347 ms 24264 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 24472 KB Output is correct
2 Correct 158 ms 24260 KB Output is correct
3 Correct 263 ms 36820 KB Output is correct
4 Correct 158 ms 24312 KB Output is correct
5 Correct 252 ms 33428 KB Output is correct
6 Correct 150 ms 24420 KB Output is correct
7 Correct 144 ms 24324 KB Output is correct
8 Correct 123 ms 24216 KB Output is correct
9 Correct 254 ms 41892 KB Output is correct
10 Correct 237 ms 41612 KB Output is correct
11 Correct 327 ms 59092 KB Output is correct
12 Correct 365 ms 54448 KB Output is correct
13 Correct 185 ms 24216 KB Output is correct
14 Correct 8 ms 24284 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 24472 KB Output is correct
2 Correct 158 ms 24260 KB Output is correct
3 Correct 263 ms 36820 KB Output is correct
4 Correct 158 ms 24312 KB Output is correct
5 Correct 252 ms 33428 KB Output is correct
6 Correct 150 ms 24420 KB Output is correct
7 Correct 144 ms 24324 KB Output is correct
8 Correct 123 ms 24216 KB Output is correct
9 Correct 254 ms 41892 KB Output is correct
10 Correct 237 ms 41612 KB Output is correct
11 Correct 327 ms 59092 KB Output is correct
12 Correct 365 ms 54448 KB Output is correct
13 Correct 185 ms 24216 KB Output is correct
14 Correct 8 ms 24284 KB Output is correct
15 Correct 190 ms 24216 KB Output is correct
16 Correct 251 ms 24272 KB Output is correct
17 Correct 189 ms 24216 KB Output is correct
18 Correct 221 ms 34040 KB Output is correct
19 Correct 166 ms 24316 KB Output is correct
20 Correct 260 ms 34196 KB Output is correct
21 Correct 191 ms 24340 KB Output is correct
22 Correct 215 ms 24216 KB Output is correct
23 Correct 289 ms 45796 KB Output is correct
24 Correct 345 ms 45940 KB Output is correct
25 Correct 504 ms 67052 KB Output is correct
26 Correct 354 ms 60136 KB Output is correct
27 Correct 170 ms 24360 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 24472 KB Output is correct
2 Correct 158 ms 24260 KB Output is correct
3 Correct 263 ms 36820 KB Output is correct
4 Correct 158 ms 24312 KB Output is correct
5 Correct 252 ms 33428 KB Output is correct
6 Correct 150 ms 24420 KB Output is correct
7 Correct 144 ms 24324 KB Output is correct
8 Correct 123 ms 24216 KB Output is correct
9 Correct 254 ms 41892 KB Output is correct
10 Correct 237 ms 41612 KB Output is correct
11 Correct 327 ms 59092 KB Output is correct
12 Correct 365 ms 54448 KB Output is correct
13 Correct 185 ms 24216 KB Output is correct
14 Correct 8 ms 24284 KB Output is correct
15 Correct 190 ms 24216 KB Output is correct
16 Correct 251 ms 24272 KB Output is correct
17 Correct 189 ms 24216 KB Output is correct
18 Correct 221 ms 34040 KB Output is correct
19 Correct 166 ms 24316 KB Output is correct
20 Correct 260 ms 34196 KB Output is correct
21 Correct 191 ms 24340 KB Output is correct
22 Correct 215 ms 24216 KB Output is correct
23 Correct 289 ms 45796 KB Output is correct
24 Correct 345 ms 45940 KB Output is correct
25 Correct 504 ms 67052 KB Output is correct
26 Correct 354 ms 60136 KB Output is correct
27 Correct 170 ms 24360 KB Output is correct
28 Correct 285 ms 24216 KB Output is correct
29 Correct 298 ms 24268 KB Output is correct
30 Correct 378 ms 47616 KB Output is correct
31 Correct 318 ms 24260 KB Output is correct
32 Correct 372 ms 44696 KB Output is correct
33 Correct 247 ms 24340 KB Output is correct
34 Correct 278 ms 24368 KB Output is correct
35 Correct 308 ms 24468 KB Output is correct
36 Correct 434 ms 48360 KB Output is correct
37 Correct 378 ms 48568 KB Output is correct
38 Correct 429 ms 72424 KB Output is correct
39 Correct 444 ms 67672 KB Output is correct
40 Correct 224 ms 24328 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 427 ms 24260 KB Output is correct
2 Correct 7 ms 24276 KB Output is correct
3 Correct 307 ms 24260 KB Output is correct
4 Correct 417 ms 33956 KB Output is correct
5 Correct 18 ms 24472 KB Output is correct
6 Correct 379 ms 25832 KB Output is correct
7 Correct 7 ms 24276 KB Output is correct
8 Correct 415 ms 24352 KB Output is correct
9 Correct 312 ms 24408 KB Output is correct
10 Correct 544 ms 51160 KB Output is correct
11 Correct 473 ms 47796 KB Output is correct
12 Correct 71 ms 24256 KB Output is correct
13 Correct 482 ms 48088 KB Output is correct
14 Correct 405 ms 24332 KB Output is correct
15 Correct 7 ms 24272 KB Output is correct
16 Correct 428 ms 24264 KB Output is correct
17 Correct 358 ms 24356 KB Output is correct
18 Correct 339 ms 24348 KB Output is correct
19 Correct 449 ms 24444 KB Output is correct
20 Correct 420 ms 24344 KB Output is correct
21 Correct 387 ms 24276 KB Output is correct
22 Correct 331 ms 24260 KB Output is correct
23 Correct 347 ms 24264 KB Output is correct
24 Correct 127 ms 24472 KB Output is correct
25 Correct 158 ms 24260 KB Output is correct
26 Correct 263 ms 36820 KB Output is correct
27 Correct 158 ms 24312 KB Output is correct
28 Correct 252 ms 33428 KB Output is correct
29 Correct 150 ms 24420 KB Output is correct
30 Correct 144 ms 24324 KB Output is correct
31 Correct 123 ms 24216 KB Output is correct
32 Correct 254 ms 41892 KB Output is correct
33 Correct 237 ms 41612 KB Output is correct
34 Correct 327 ms 59092 KB Output is correct
35 Correct 365 ms 54448 KB Output is correct
36 Correct 185 ms 24216 KB Output is correct
37 Correct 8 ms 24284 KB Output is correct
38 Correct 190 ms 24216 KB Output is correct
39 Correct 251 ms 24272 KB Output is correct
40 Correct 189 ms 24216 KB Output is correct
41 Correct 221 ms 34040 KB Output is correct
42 Correct 166 ms 24316 KB Output is correct
43 Correct 260 ms 34196 KB Output is correct
44 Correct 191 ms 24340 KB Output is correct
45 Correct 215 ms 24216 KB Output is correct
46 Correct 289 ms 45796 KB Output is correct
47 Correct 345 ms 45940 KB Output is correct
48 Correct 504 ms 67052 KB Output is correct
49 Correct 354 ms 60136 KB Output is correct
50 Correct 170 ms 24360 KB Output is correct
51 Correct 285 ms 24216 KB Output is correct
52 Correct 298 ms 24268 KB Output is correct
53 Correct 378 ms 47616 KB Output is correct
54 Correct 318 ms 24260 KB Output is correct
55 Correct 372 ms 44696 KB Output is correct
56 Correct 247 ms 24340 KB Output is correct
57 Correct 278 ms 24368 KB Output is correct
58 Correct 308 ms 24468 KB Output is correct
59 Correct 434 ms 48360 KB Output is correct
60 Correct 378 ms 48568 KB Output is correct
61 Correct 429 ms 72424 KB Output is correct
62 Correct 444 ms 67672 KB Output is correct
63 Correct 224 ms 24328 KB Output is correct
64 Correct 341 ms 24700 KB Output is correct
65 Correct 440 ms 50172 KB Output is correct
66 Correct 512 ms 47100 KB Output is correct
67 Correct 361 ms 24412 KB Output is correct
68 Correct 357 ms 24412 KB Output is correct
69 Correct 615 ms 71396 KB Output is correct
70 Correct 621 ms 62956 KB Output is correct
71 Correct 431 ms 28568 KB Output is correct
72 Correct 347 ms 24728 KB Output is correct