oj.uz

Submission #943730

# Submission time Handle Problem Language Result Execution time Memory
943730 2024-03-11T18:47:20 Z yeediot Two Transportations (JOI19_transportations) C++14
100 / 100
 648 ms 72688 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<n)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=0;
    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 350 ms 24264 KB Output is correct
2 Correct 7 ms 24276 KB Output is correct
3 Correct 378 ms 24264 KB Output is correct
4 Correct 571 ms 33952 KB Output is correct
5 Correct 18 ms 24472 KB Output is correct
6 Correct 413 ms 25836 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 24280 KB Output is correct
2 Correct 302 ms 24352 KB Output is correct
3 Correct 389 ms 24412 KB Output is correct
4 Correct 522 ms 51156 KB Output is correct
5 Correct 482 ms 48084 KB Output is correct
6 Correct 67 ms 24256 KB Output is correct
7 Correct 586 ms 47832 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 382 ms 24328 KB Output is correct
2 Correct 8 ms 24276 KB Output is correct
3 Correct 405 ms 24264 KB Output is correct
4 Correct 296 ms 24356 KB Output is correct
5 Correct 350 ms 24348 KB Output is correct
6 Correct 451 ms 24336 KB Output is correct
7 Correct 429 ms 24348 KB Output is correct
8 Correct 371 ms 24276 KB Output is correct
9 Correct 355 ms 24264 KB Output is correct
10 Correct 356 ms 24260 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 24216 KB Output is correct
2 Correct 152 ms 24264 KB Output is correct
3 Correct 182 ms 37068 KB Output is correct
4 Correct 150 ms 24216 KB Output is correct
5 Correct 217 ms 33696 KB Output is correct
6 Correct 151 ms 24216 KB Output is correct
7 Correct 172 ms 24216 KB Output is correct
8 Correct 148 ms 24216 KB Output is correct
9 Correct 266 ms 41812 KB Output is correct
10 Correct 244 ms 41604 KB Output is correct
11 Correct 346 ms 59008 KB Output is correct
12 Correct 309 ms 54424 KB Output is correct
13 Correct 198 ms 24216 KB Output is correct
14 Correct 8 ms 24444 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 24216 KB Output is correct
2 Correct 152 ms 24264 KB Output is correct
3 Correct 182 ms 37068 KB Output is correct
4 Correct 150 ms 24216 KB Output is correct
5 Correct 217 ms 33696 KB Output is correct
6 Correct 151 ms 24216 KB Output is correct
7 Correct 172 ms 24216 KB Output is correct
8 Correct 148 ms 24216 KB Output is correct
9 Correct 266 ms 41812 KB Output is correct
10 Correct 244 ms 41604 KB Output is correct
11 Correct 346 ms 59008 KB Output is correct
12 Correct 309 ms 54424 KB Output is correct
13 Correct 198 ms 24216 KB Output is correct
14 Correct 8 ms 24444 KB Output is correct
15 Correct 210 ms 24216 KB Output is correct
16 Correct 167 ms 24216 KB Output is correct
17 Correct 162 ms 24216 KB Output is correct
18 Correct 239 ms 33812 KB Output is correct
19 Correct 173 ms 24216 KB Output is correct
20 Correct 223 ms 34416 KB Output is correct
21 Correct 203 ms 24216 KB Output is correct
22 Correct 180 ms 24344 KB Output is correct
23 Correct 322 ms 45860 KB Output is correct
24 Correct 312 ms 45792 KB Output is correct
25 Correct 414 ms 67296 KB Output is correct
26 Correct 339 ms 60620 KB Output is correct
27 Correct 169 ms 24364 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 24216 KB Output is correct
2 Correct 152 ms 24264 KB Output is correct
3 Correct 182 ms 37068 KB Output is correct
4 Correct 150 ms 24216 KB Output is correct
5 Correct 217 ms 33696 KB Output is correct
6 Correct 151 ms 24216 KB Output is correct
7 Correct 172 ms 24216 KB Output is correct
8 Correct 148 ms 24216 KB Output is correct
9 Correct 266 ms 41812 KB Output is correct
10 Correct 244 ms 41604 KB Output is correct
11 Correct 346 ms 59008 KB Output is correct
12 Correct 309 ms 54424 KB Output is correct
13 Correct 198 ms 24216 KB Output is correct
14 Correct 8 ms 24444 KB Output is correct
15 Correct 210 ms 24216 KB Output is correct
16 Correct 167 ms 24216 KB Output is correct
17 Correct 162 ms 24216 KB Output is correct
18 Correct 239 ms 33812 KB Output is correct
19 Correct 173 ms 24216 KB Output is correct
20 Correct 223 ms 34416 KB Output is correct
21 Correct 203 ms 24216 KB Output is correct
22 Correct 180 ms 24344 KB Output is correct
23 Correct 322 ms 45860 KB Output is correct
24 Correct 312 ms 45792 KB Output is correct
25 Correct 414 ms 67296 KB Output is correct
26 Correct 339 ms 60620 KB Output is correct
27 Correct 169 ms 24364 KB Output is correct
28 Correct 223 ms 24308 KB Output is correct
29 Correct 302 ms 24268 KB Output is correct
30 Correct 341 ms 47624 KB Output is correct
31 Correct 252 ms 24264 KB Output is correct
32 Correct 344 ms 44628 KB Output is correct
33 Correct 204 ms 24340 KB Output is correct
34 Correct 298 ms 24384 KB Output is correct
35 Correct 228 ms 24364 KB Output is correct
36 Correct 451 ms 48364 KB Output is correct
37 Correct 371 ms 48624 KB Output is correct
38 Correct 504 ms 72688 KB Output is correct
39 Correct 427 ms 67904 KB Output is correct
40 Correct 250 ms 24216 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 350 ms 24264 KB Output is correct
2 Correct 7 ms 24276 KB Output is correct
3 Correct 378 ms 24264 KB Output is correct
4 Correct 571 ms 33952 KB Output is correct
5 Correct 18 ms 24472 KB Output is correct
6 Correct 413 ms 25836 KB Output is correct
7 Correct 8 ms 24280 KB Output is correct
8 Correct 302 ms 24352 KB Output is correct
9 Correct 389 ms 24412 KB Output is correct
10 Correct 522 ms 51156 KB Output is correct
11 Correct 482 ms 48084 KB Output is correct
12 Correct 67 ms 24256 KB Output is correct
13 Correct 586 ms 47832 KB Output is correct
14 Correct 382 ms 24328 KB Output is correct
15 Correct 8 ms 24276 KB Output is correct
16 Correct 405 ms 24264 KB Output is correct
17 Correct 296 ms 24356 KB Output is correct
18 Correct 350 ms 24348 KB Output is correct
19 Correct 451 ms 24336 KB Output is correct
20 Correct 429 ms 24348 KB Output is correct
21 Correct 371 ms 24276 KB Output is correct
22 Correct 355 ms 24264 KB Output is correct
23 Correct 356 ms 24260 KB Output is correct
24 Correct 141 ms 24216 KB Output is correct
25 Correct 152 ms 24264 KB Output is correct
26 Correct 182 ms 37068 KB Output is correct
27 Correct 150 ms 24216 KB Output is correct
28 Correct 217 ms 33696 KB Output is correct
29 Correct 151 ms 24216 KB Output is correct
30 Correct 172 ms 24216 KB Output is correct
31 Correct 148 ms 24216 KB Output is correct
32 Correct 266 ms 41812 KB Output is correct
33 Correct 244 ms 41604 KB Output is correct
34 Correct 346 ms 59008 KB Output is correct
35 Correct 309 ms 54424 KB Output is correct
36 Correct 198 ms 24216 KB Output is correct
37 Correct 8 ms 24444 KB Output is correct
38 Correct 210 ms 24216 KB Output is correct
39 Correct 167 ms 24216 KB Output is correct
40 Correct 162 ms 24216 KB Output is correct
41 Correct 239 ms 33812 KB Output is correct
42 Correct 173 ms 24216 KB Output is correct
43 Correct 223 ms 34416 KB Output is correct
44 Correct 203 ms 24216 KB Output is correct
45 Correct 180 ms 24344 KB Output is correct
46 Correct 322 ms 45860 KB Output is correct
47 Correct 312 ms 45792 KB Output is correct
48 Correct 414 ms 67296 KB Output is correct
49 Correct 339 ms 60620 KB Output is correct
50 Correct 169 ms 24364 KB Output is correct
51 Correct 223 ms 24308 KB Output is correct
52 Correct 302 ms 24268 KB Output is correct
53 Correct 341 ms 47624 KB Output is correct
54 Correct 252 ms 24264 KB Output is correct
55 Correct 344 ms 44628 KB Output is correct
56 Correct 204 ms 24340 KB Output is correct
57 Correct 298 ms 24384 KB Output is correct
58 Correct 228 ms 24364 KB Output is correct
59 Correct 451 ms 48364 KB Output is correct
60 Correct 371 ms 48624 KB Output is correct
61 Correct 504 ms 72688 KB Output is correct
62 Correct 427 ms 67904 KB Output is correct
63 Correct 250 ms 24216 KB Output is correct
64 Correct 426 ms 24432 KB Output is correct
65 Correct 560 ms 50016 KB Output is correct
66 Correct 502 ms 47096 KB Output is correct
67 Correct 391 ms 24412 KB Output is correct
68 Correct 325 ms 24416 KB Output is correct
69 Correct 648 ms 71408 KB Output is correct
70 Correct 544 ms 63276 KB Output is correct
71 Correct 369 ms 28660 KB Output is correct
72 Correct 434 ms 24728 KB Output is correct