| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1035989 | vjudge1 | Two Transportations (JOI19_transportations) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "Azer.h"
#include <bits/stdc++.h>
using namespace std;
int casef=0,NN_;
vector<int>Ua,Va,Ca;
void InitA(int N, int A, std::vector<int> U, std::vector<int> V,
std::vector<int> C) {
NN_=N;
if(!A)SendA(0);
else SendA(1);
casef=!!A;
Ua=U;
Va=V;
Ca=C;
}
vector<int>bits;
void ReceiveA(bool x) {
bits.push_back(x);
}
std::vector<int> Answer() {
if(casef) {
vector<vector<pair<int,int>>>adj(NN_);
int C=bits.size();
for(int i=0;i<C/31;i++){
int U=0,V=0,D=0;
for(int j=0;j<11;j++)
U=U*2+bits[i*31+j];
for(int j=11;j<22;j++)
V=V*2+bits[i*31+j];
for(int j=22;j<31;j++)
D=D*2+bits[i*31+j];
adj[U].push_back({V,D});
adj[V].push_back({U,D});
}
for(int i=0;i<Ua.size();i++){
adj[Ua[i]].push_back({Va[i],Ca[i]});
adj[Va[i]].push_back({Ua[i],Ca[i]});
}
vector<int>dist(NN_,1e9);
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<>>pq;
dist[0]=0;
pq.push({0,0});
while(pq.size()){
auto[d,x]=pq.top();
pq.pop();
if(dist[x]<d)continue;
for(auto [v,w]:adj[x])
if(dist[v]>w+d)
pq.push({dist[v]=w+d,v});
}
return dist;
}
std::vector<int> ans(NN_);
for(int i=0;i<bits.size();i++)
ans[i/20]=ans[i/20]<<1|bits[i];
return ans;
}