oj.uz

Submission #568949

# Submission time Handle Problem Language Result Execution time Memory
568949 2022-05-26T11:29:52 Z zaneyu Two Transportations (JOI19_transportations) C++14
100 / 100
 740 ms 72312 KB 
#include "Azer.h"
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=5e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?" ":"");
    return out;
}
namespace {

    int n;
    vector<pii> v[maxn];
    int dist[maxn];
    priority_queue<pii,vector<pii>,greater<pii>> pq;
    bool done[maxn];
    void relax(int u){
        done[u]=1;
        for(auto x:v[u]){
            MNTO(dist[x.f],dist[u]+x.s);
        }
    }
    int cnt,idx,mn,p,pv;
    int val=0;
    void send(){
        mn=INF+1;
        REP(i,n){
            if(!done[i]){
                if(mn>dist[i]){
                    mn=dist[i];
                    p=i;
                }
            }
        }
        if(mn==INF+1){
            return;
        }
        mn-=pv;
        MNTO(mn,511);
        REP(i,9) SendA((mn>>(8-i))&1);
        idx=1;
    }
}  

void InitA(int N, int A, std::vector<int> U, std::vector<int> V,
           std::vector<int> C) {
    n=N;
    REP(i,A){
        v[U[i]].pb({V[i],C[i]});
        v[V[i]].pb({U[i],C[i]});
    }
    REP(i,n) dist[i]=INF;
    dist[0]=0;
    pv=0;
    relax(0);
    send();
}
void ReceiveA(bool x) {
    val=val*2+x;
    ++cnt;
    if(idx==1){
        if(cnt==9){
            if(mn<=val){
                REP(i,11) SendA((p>>(10-i))&1);
                pv+=mn;
                relax(p);
                send();
            }
            else{
                pv+=val;
                idx=2;
            }
            cnt=0;
            val=0;
        }
    }
    else if(idx==2){
        if(cnt==11){
            dist[val]=pv;
            relax(val);
            send();
            cnt=0;
            val=0;
        }
    }
}

std::vector<int> Answer() {
    vector<int> ans;
    REP(i,n) ans.pb(dist[i]);
    return ans;
}

#include "Baijan.h"
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=5e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?" ":"");
    return out;
}
namespace {

    int n;
    vector<pii> v[maxn];
    int dist[maxn];
    priority_queue<pii,vector<pii>,greater<pii>> pq;
    bool done[maxn];
    void relax(int u){
        done[u]=1;
        for(auto x:v[u]){
            MNTO(dist[x.f],dist[u]+x.s);
        }
    }
    int cnt,idx,mn,p,pv;
    int val=0;
    void send(){
        mn=INF+1;
        REP(i,n){
            if(!done[i]){
                if(mn>dist[i]){
                    mn=dist[i];
                    p=i;
                }
            }
        }
        if(mn==INF+1){
            return;
        }
        mn-=pv;
        MNTO(mn,511);
        REP(i,9) SendB((mn>>(8-i))&1);
        idx=1;
    }
}
void InitB(int N, int B, std::vector<int> S, std::vector<int> T,
           std::vector<int> D) {
    n=N;
    REP(i,B){
        v[S[i]].pb({T[i],D[i]});
        v[T[i]].pb({S[i],D[i]});
    }
    REP(i,n) dist[i]=INF;
    dist[0]=0;
    pv=0;
    relax(0);
    send();
}
void ReceiveB(bool y) {
    val=val*2+y;
    ++cnt;
    if(idx==1){
        if(cnt==9){
            if(mn<val){
                REP(i,11) SendB((p>>(10-i))&1);
                pv+=mn;
                relax(p);
                send();
            }
            else{
                pv+=val;
                idx=2;
            }
            cnt=0;
            val=0;
        }
    }
    else if(idx==2){
        if(cnt==11){
            dist[val]=pv;
            relax(val);
            send();
            cnt=0;
            val=0;
        }
    }
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 385 ms 24144 KB Output is correct
2 Correct 17 ms 23952 KB Output is correct
3 Correct 461 ms 24276 KB Output is correct
4 Correct 575 ms 33508 KB Output is correct
5 Correct 46 ms 24208 KB Output is correct
6 Correct 536 ms 25612 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23952 KB Output is correct
2 Correct 496 ms 24232 KB Output is correct
3 Correct 561 ms 24208 KB Output is correct
4 Correct 640 ms 50908 KB Output is correct
5 Correct 740 ms 47560 KB Output is correct
6 Correct 91 ms 24008 KB Output is correct
7 Correct 601 ms 47728 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 553 ms 24220 KB Output is correct
2 Correct 18 ms 23956 KB Output is correct
3 Correct 474 ms 24068 KB Output is correct
4 Correct 397 ms 24232 KB Output is correct
5 Correct 412 ms 24224 KB Output is correct
6 Correct 434 ms 24228 KB Output is correct
7 Correct 456 ms 24096 KB Output is correct
8 Correct 469 ms 24156 KB Output is correct
9 Correct 413 ms 24144 KB Output is correct
10 Correct 461 ms 24144 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 202 ms 24040 KB Output is correct
2 Correct 219 ms 24008 KB Output is correct
3 Correct 265 ms 36640 KB Output is correct
4 Correct 230 ms 24080 KB Output is correct
5 Correct 303 ms 33516 KB Output is correct
6 Correct 243 ms 24048 KB Output is correct
7 Correct 230 ms 24208 KB Output is correct
8 Correct 216 ms 24208 KB Output is correct
9 Correct 325 ms 41476 KB Output is correct
10 Correct 322 ms 41624 KB Output is correct
11 Correct 419 ms 59156 KB Output is correct
12 Correct 393 ms 54020 KB Output is correct
13 Correct 203 ms 24208 KB Output is correct
14 Correct 18 ms 23952 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 202 ms 24040 KB Output is correct
2 Correct 219 ms 24008 KB Output is correct
3 Correct 265 ms 36640 KB Output is correct
4 Correct 230 ms 24080 KB Output is correct
5 Correct 303 ms 33516 KB Output is correct
6 Correct 243 ms 24048 KB Output is correct
7 Correct 230 ms 24208 KB Output is correct
8 Correct 216 ms 24208 KB Output is correct
9 Correct 325 ms 41476 KB Output is correct
10 Correct 322 ms 41624 KB Output is correct
11 Correct 419 ms 59156 KB Output is correct
12 Correct 393 ms 54020 KB Output is correct
13 Correct 203 ms 24208 KB Output is correct
14 Correct 18 ms 23952 KB Output is correct
15 Correct 254 ms 24040 KB Output is correct
16 Correct 277 ms 24068 KB Output is correct
17 Correct 264 ms 24028 KB Output is correct
18 Correct 349 ms 33484 KB Output is correct
19 Correct 250 ms 24208 KB Output is correct
20 Correct 352 ms 33784 KB Output is correct
21 Correct 246 ms 24216 KB Output is correct
22 Correct 239 ms 24208 KB Output is correct
23 Correct 403 ms 45596 KB Output is correct
24 Correct 392 ms 45504 KB Output is correct
25 Correct 561 ms 66868 KB Output is correct
26 Correct 458 ms 59752 KB Output is correct
27 Correct 269 ms 24208 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 202 ms 24040 KB Output is correct
2 Correct 219 ms 24008 KB Output is correct
3 Correct 265 ms 36640 KB Output is correct
4 Correct 230 ms 24080 KB Output is correct
5 Correct 303 ms 33516 KB Output is correct
6 Correct 243 ms 24048 KB Output is correct
7 Correct 230 ms 24208 KB Output is correct
8 Correct 216 ms 24208 KB Output is correct
9 Correct 325 ms 41476 KB Output is correct
10 Correct 322 ms 41624 KB Output is correct
11 Correct 419 ms 59156 KB Output is correct
12 Correct 393 ms 54020 KB Output is correct
13 Correct 203 ms 24208 KB Output is correct
14 Correct 18 ms 23952 KB Output is correct
15 Correct 254 ms 24040 KB Output is correct
16 Correct 277 ms 24068 KB Output is correct
17 Correct 264 ms 24028 KB Output is correct
18 Correct 349 ms 33484 KB Output is correct
19 Correct 250 ms 24208 KB Output is correct
20 Correct 352 ms 33784 KB Output is correct
21 Correct 246 ms 24216 KB Output is correct
22 Correct 239 ms 24208 KB Output is correct
23 Correct 403 ms 45596 KB Output is correct
24 Correct 392 ms 45504 KB Output is correct
25 Correct 561 ms 66868 KB Output is correct
26 Correct 458 ms 59752 KB Output is correct
27 Correct 269 ms 24208 KB Output is correct
28 Correct 260 ms 24080 KB Output is correct
29 Correct 311 ms 24044 KB Output is correct
30 Correct 483 ms 47480 KB Output is correct
31 Correct 326 ms 24136 KB Output is correct
32 Correct 336 ms 44416 KB Output is correct
33 Correct 339 ms 24216 KB Output is correct
34 Correct 299 ms 24176 KB Output is correct
35 Correct 332 ms 24248 KB Output is correct
36 Correct 493 ms 48132 KB Output is correct
37 Correct 406 ms 48252 KB Output is correct
38 Correct 581 ms 72312 KB Output is correct
39 Correct 461 ms 67728 KB Output is correct
40 Correct 335 ms 24328 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 385 ms 24144 KB Output is correct
2 Correct 17 ms 23952 KB Output is correct
3 Correct 461 ms 24276 KB Output is correct
4 Correct 575 ms 33508 KB Output is correct
5 Correct 46 ms 24208 KB Output is correct
6 Correct 536 ms 25612 KB Output is correct
7 Correct 16 ms 23952 KB Output is correct
8 Correct 496 ms 24232 KB Output is correct
9 Correct 561 ms 24208 KB Output is correct
10 Correct 640 ms 50908 KB Output is correct
11 Correct 740 ms 47560 KB Output is correct
12 Correct 91 ms 24008 KB Output is correct
13 Correct 601 ms 47728 KB Output is correct
14 Correct 553 ms 24220 KB Output is correct
15 Correct 18 ms 23956 KB Output is correct
16 Correct 474 ms 24068 KB Output is correct
17 Correct 397 ms 24232 KB Output is correct
18 Correct 412 ms 24224 KB Output is correct
19 Correct 434 ms 24228 KB Output is correct
20 Correct 456 ms 24096 KB Output is correct
21 Correct 469 ms 24156 KB Output is correct
22 Correct 413 ms 24144 KB Output is correct
23 Correct 461 ms 24144 KB Output is correct
24 Correct 202 ms 24040 KB Output is correct
25 Correct 219 ms 24008 KB Output is correct
26 Correct 265 ms 36640 KB Output is correct
27 Correct 230 ms 24080 KB Output is correct
28 Correct 303 ms 33516 KB Output is correct
29 Correct 243 ms 24048 KB Output is correct
30 Correct 230 ms 24208 KB Output is correct
31 Correct 216 ms 24208 KB Output is correct
32 Correct 325 ms 41476 KB Output is correct
33 Correct 322 ms 41624 KB Output is correct
34 Correct 419 ms 59156 KB Output is correct
35 Correct 393 ms 54020 KB Output is correct
36 Correct 203 ms 24208 KB Output is correct
37 Correct 18 ms 23952 KB Output is correct
38 Correct 254 ms 24040 KB Output is correct
39 Correct 277 ms 24068 KB Output is correct
40 Correct 264 ms 24028 KB Output is correct
41 Correct 349 ms 33484 KB Output is correct
42 Correct 250 ms 24208 KB Output is correct
43 Correct 352 ms 33784 KB Output is correct
44 Correct 246 ms 24216 KB Output is correct
45 Correct 239 ms 24208 KB Output is correct
46 Correct 403 ms 45596 KB Output is correct
47 Correct 392 ms 45504 KB Output is correct
48 Correct 561 ms 66868 KB Output is correct
49 Correct 458 ms 59752 KB Output is correct
50 Correct 269 ms 24208 KB Output is correct
51 Correct 260 ms 24080 KB Output is correct
52 Correct 311 ms 24044 KB Output is correct
53 Correct 483 ms 47480 KB Output is correct
54 Correct 326 ms 24136 KB Output is correct
55 Correct 336 ms 44416 KB Output is correct
56 Correct 339 ms 24216 KB Output is correct
57 Correct 299 ms 24176 KB Output is correct
58 Correct 332 ms 24248 KB Output is correct
59 Correct 493 ms 48132 KB Output is correct
60 Correct 406 ms 48252 KB Output is correct
61 Correct 581 ms 72312 KB Output is correct
62 Correct 461 ms 67728 KB Output is correct
63 Correct 335 ms 24328 KB Output is correct
64 Correct 395 ms 24316 KB Output is correct
65 Correct 571 ms 50032 KB Output is correct
66 Correct 534 ms 46780 KB Output is correct
67 Correct 442 ms 24288 KB Output is correct
68 Correct 455 ms 24296 KB Output is correct
69 Correct 690 ms 71024 KB Output is correct
70 Correct 681 ms 62904 KB Output is correct
71 Correct 532 ms 28360 KB Output is correct
72 Correct 440 ms 24556 KB Output is correct