oj.uz

답안 #916611

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
916611 2024-01-26T07:10:26 Z winter0101 Two Transportations (JOI19_transportations) C++14
100 / 100
 582 ms 49048 KB 
#include<bits/stdc++.h>
#include "Azer.h"
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
/*
chay dijkstra sao cho co the duy tri duoc d toi uu cho 2 ben cung 1 luc (n<=900), de full chi can toi uu cach gui
*/
namespace {
 
int N;
int reada=0,hra=0,nra=0,vertice=0,value=0,lst=0,dem=0,va=0;
 
}  // namespace
const int maxn=2e3+9;
const int inf=5e7;
 
vector<pii>a[maxn];
int d[maxn];
bool vis[maxn];
void dit(){
int diff=value-lst;
for1(i,0,8){
SendA(diff>>i&1);
}
reada=0;
hra=0;
nra=9;
}
void update(){
if (dem==N)return;
int nw=-1;
for1(i,0,N-1){
if (vis[i])continue;
if (nw==-1)nw=i;
if (d[nw]>d[i])nw=i;
}
reada=0;
hra=0;
nra=0;
vertice=nw,value=d[nw];
if (value==inf)value=lst+(1<<9)-1;
dem++;
dit();
}
void InitA(int N, int A, std::vector<int> U, std::vector<int> V,std::vector<int> C) {
    ::N=N;
    for1(i,0,N-1){
    d[i]=inf;
    }
    for1(i,0,A-1){
    a[U[i]].pb({V[i],C[i]}),a[V[i]].pb({U[i],C[i]});
    }
    d[0]=0;
    update();
}
 
void ReceiveA(bool x) {
    reada|=(x<<hra);
    hra++;
    if (hra==nra){
    if (hra==9){
    if (reada<value-lst){//need read vertice of b
    va=reada;
    reada=0;
    hra=0;
    nra=11;
    }
    else {//don't need
    nra=0;
    hra=0;
    for1(i,0,10)SendA(vertice>>i&1);
    vis[vertice]=1;
    lst=d[vertice];
    for (auto v:a[vertice]){
    if (d[vertice]+v.se<d[v.fi]){
    d[v.fi]=d[vertice]+v.se;
    }
    }
    update();
    return;
    }
    }
    else {
    //cerr<<vertice<<" "<<reada<<" "<<va<<" "<<lst<<'\n';
    d[reada]=va+lst;
    vertice=reada;
    vis[vertice]=1;
    lst=d[vertice];
    for (auto v:a[vertice]){
    if (d[vertice]+v.se<d[v.fi]){
    d[v.fi]=d[vertice]+v.se;
    }
    }
    reada=0;
    nra=0;
    hra=0;
    update();
    return;
    }
    }
}
std::vector<int> Answer() {
  std::vector<int> ans(N);
  for (int k = 0; k < N; ++k) {
    ans[k] = d[k];
  }
  return ans;
}
#include<bits/stdc++.h>
#include "Baijan.h"
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
const int maxn=2e3+9;
const int inf=5e6+9;
namespace {
    int n;
    int readb=0,hrb=0,nrb=0,ver=0,vl=0,last=0,vb=0,demb=0;
}  // namespace
vector<pii>g[maxn];
int dis[maxn];
bool visit[maxn];
void du(){
int diff=vl-last;
//cerr<<diff<<'\n';
for1(i,0,8){
SendB(diff>>i&1);
}
}
void add(){
if (demb==n)return;
demb++;
int nw=-1;
for1(i,0,n-1){
if (visit[i])continue;
if (nw==-1)nw=i;
if (dis[nw]>dis[i])nw=i;
}
ver=nw;
vl=dis[nw];
if (vl==inf)vl=last+(1<<9)-1;
//if (ver==2)cout<<vl<<" "<<last<<'\n';
}
void InitB(int N, int B, std::vector<int> S, std::vector<int> T,std::vector<int> D) {
n=N;
for1(i,0,n-1)dis[i]=inf;
for1(i,0,B-1){
g[S[i]].pb({T[i],D[i]});
g[T[i]].pb({S[i],D[i]});
}
dis[0]=0;
readb=0;
nrb=9;
hrb=0;
}
 
void ReceiveB(bool y) {
readb|=(y<<hrb);
hrb++;
if (hrb==nrb){
    if (nrb==9){
    add();
    //cerr<<readb<<'\n';
    du();
    if (readb<=vl-last){
    vb=readb;
    readb=0;
    nrb=11;
    hrb=0;
    }
    else {
    for1(i,0,10)SendB(ver>>i&1);
    //cerr<<ver<<" "<<dis[ver]<<'\n';
    visit[ver]=1;
    last=dis[ver];
    for (auto v:g[ver]){
    if (dis[v.fi]>dis[ver]+v.se){
    dis[v.fi]=dis[ver]+v.se;
    }
    }
    readb=0;
    nrb=9;
    hrb=0;
    return;
    }
    }
    else {
    //cerr<<readb<<'\n';
    dis[readb]=vb+last;
    ver=readb;
    last=dis[ver];
    visit[ver]=1;
    for (auto v:g[ver]){
    if (dis[v.fi]>dis[ver]+v.se){
    dis[v.fi]=dis[ver]+v.se;
    }
    }
    readb=0;
    nrb=9;
    hrb=0;
    return;
    }
}
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 339 ms 1048 KB Output is correct
2 Correct 2 ms 664 KB Output is correct
3 Correct 402 ms 1044 KB Output is correct
4 Correct 492 ms 10256 KB Output is correct
5 Correct 12 ms 920 KB Output is correct
6 Correct 333 ms 2448 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 664 KB Output is correct
2 Correct 489 ms 876 KB Output is correct
3 Correct 309 ms 932 KB Output is correct
4 Correct 497 ms 27772 KB Output is correct
5 Correct 471 ms 24188 KB Output is correct
6 Correct 53 ms 916 KB Output is correct
7 Correct 454 ms 24452 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 334 ms 860 KB Output is correct
2 Correct 0 ms 664 KB Output is correct
3 Correct 312 ms 792 KB Output is correct
4 Correct 369 ms 876 KB Output is correct
5 Correct 358 ms 876 KB Output is correct
6 Correct 391 ms 868 KB Output is correct
7 Correct 330 ms 872 KB Output is correct
8 Correct 392 ms 800 KB Output is correct
9 Correct 352 ms 1048 KB Output is correct
10 Correct 284 ms 1304 KB Output is correct

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 155 ms 824 KB Output is correct
2 Correct 103 ms 1048 KB Output is correct
3 Correct 173 ms 13452 KB Output is correct
4 Correct 112 ms 848 KB Output is correct
5 Correct 179 ms 10192 KB Output is correct
6 Correct 144 ms 664 KB Output is correct
7 Correct 118 ms 664 KB Output is correct
8 Correct 139 ms 860 KB Output is correct
9 Correct 205 ms 18348 KB Output is correct
10 Correct 217 ms 18612 KB Output is correct
11 Correct 393 ms 35800 KB Output is correct
12 Correct 271 ms 30796 KB Output is correct
13 Correct 165 ms 664 KB Output is correct
14 Correct 2 ms 664 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 155 ms 824 KB Output is correct
2 Correct 103 ms 1048 KB Output is correct
3 Correct 173 ms 13452 KB Output is correct
4 Correct 112 ms 848 KB Output is correct
5 Correct 179 ms 10192 KB Output is correct
6 Correct 144 ms 664 KB Output is correct
7 Correct 118 ms 664 KB Output is correct
8 Correct 139 ms 860 KB Output is correct
9 Correct 205 ms 18348 KB Output is correct
10 Correct 217 ms 18612 KB Output is correct
11 Correct 393 ms 35800 KB Output is correct
12 Correct 271 ms 30796 KB Output is correct
13 Correct 165 ms 664 KB Output is correct
14 Correct 2 ms 664 KB Output is correct
15 Correct 151 ms 664 KB Output is correct
16 Correct 140 ms 664 KB Output is correct
17 Correct 183 ms 664 KB Output is correct
18 Correct 179 ms 10308 KB Output is correct
19 Correct 152 ms 664 KB Output is correct
20 Correct 206 ms 10536 KB Output is correct
21 Correct 223 ms 664 KB Output is correct
22 Correct 221 ms 664 KB Output is correct
23 Correct 341 ms 22784 KB Output is correct
24 Correct 325 ms 22480 KB Output is correct
25 Correct 390 ms 43884 KB Output is correct
26 Correct 378 ms 36768 KB Output is correct
27 Correct 201 ms 664 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 155 ms 824 KB Output is correct
2 Correct 103 ms 1048 KB Output is correct
3 Correct 173 ms 13452 KB Output is correct
4 Correct 112 ms 848 KB Output is correct
5 Correct 179 ms 10192 KB Output is correct
6 Correct 144 ms 664 KB Output is correct
7 Correct 118 ms 664 KB Output is correct
8 Correct 139 ms 860 KB Output is correct
9 Correct 205 ms 18348 KB Output is correct
10 Correct 217 ms 18612 KB Output is correct
11 Correct 393 ms 35800 KB Output is correct
12 Correct 271 ms 30796 KB Output is correct
13 Correct 165 ms 664 KB Output is correct
14 Correct 2 ms 664 KB Output is correct
15 Correct 151 ms 664 KB Output is correct
16 Correct 140 ms 664 KB Output is correct
17 Correct 183 ms 664 KB Output is correct
18 Correct 179 ms 10308 KB Output is correct
19 Correct 152 ms 664 KB Output is correct
20 Correct 206 ms 10536 KB Output is correct
21 Correct 223 ms 664 KB Output is correct
22 Correct 221 ms 664 KB Output is correct
23 Correct 341 ms 22784 KB Output is correct
24 Correct 325 ms 22480 KB Output is correct
25 Correct 390 ms 43884 KB Output is correct
26 Correct 378 ms 36768 KB Output is correct
27 Correct 201 ms 664 KB Output is correct
28 Correct 251 ms 664 KB Output is correct
29 Correct 304 ms 788 KB Output is correct
30 Correct 339 ms 24296 KB Output is correct
31 Correct 250 ms 796 KB Output is correct
32 Correct 308 ms 21244 KB Output is correct
33 Correct 203 ms 876 KB Output is correct
34 Correct 210 ms 1152 KB Output is correct
35 Correct 202 ms 896 KB Output is correct
36 Correct 369 ms 24804 KB Output is correct
37 Correct 353 ms 24976 KB Output is correct
38 Correct 444 ms 49048 KB Output is correct
39 Correct 455 ms 44384 KB Output is correct
40 Correct 210 ms 1176 KB Output is correct

Subtask #7
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 339 ms 1048 KB Output is correct
2 Correct 2 ms 664 KB Output is correct
3 Correct 402 ms 1044 KB Output is correct
4 Correct 492 ms 10256 KB Output is correct
5 Correct 12 ms 920 KB Output is correct
6 Correct 333 ms 2448 KB Output is correct
7 Correct 0 ms 664 KB Output is correct
8 Correct 489 ms 876 KB Output is correct
9 Correct 309 ms 932 KB Output is correct
10 Correct 497 ms 27772 KB Output is correct
11 Correct 471 ms 24188 KB Output is correct
12 Correct 53 ms 916 KB Output is correct
13 Correct 454 ms 24452 KB Output is correct
14 Correct 334 ms 860 KB Output is correct
15 Correct 0 ms 664 KB Output is correct
16 Correct 312 ms 792 KB Output is correct
17 Correct 369 ms 876 KB Output is correct
18 Correct 358 ms 876 KB Output is correct
19 Correct 391 ms 868 KB Output is correct
20 Correct 330 ms 872 KB Output is correct
21 Correct 392 ms 800 KB Output is correct
22 Correct 352 ms 1048 KB Output is correct
23 Correct 284 ms 1304 KB Output is correct
24 Correct 155 ms 824 KB Output is correct
25 Correct 103 ms 1048 KB Output is correct
26 Correct 173 ms 13452 KB Output is correct
27 Correct 112 ms 848 KB Output is correct
28 Correct 179 ms 10192 KB Output is correct
29 Correct 144 ms 664 KB Output is correct
30 Correct 118 ms 664 KB Output is correct
31 Correct 139 ms 860 KB Output is correct
32 Correct 205 ms 18348 KB Output is correct
33 Correct 217 ms 18612 KB Output is correct
34 Correct 393 ms 35800 KB Output is correct
35 Correct 271 ms 30796 KB Output is correct
36 Correct 165 ms 664 KB Output is correct
37 Correct 2 ms 664 KB Output is correct
38 Correct 151 ms 664 KB Output is correct
39 Correct 140 ms 664 KB Output is correct
40 Correct 183 ms 664 KB Output is correct
41 Correct 179 ms 10308 KB Output is correct
42 Correct 152 ms 664 KB Output is correct
43 Correct 206 ms 10536 KB Output is correct
44 Correct 223 ms 664 KB Output is correct
45 Correct 221 ms 664 KB Output is correct
46 Correct 341 ms 22784 KB Output is correct
47 Correct 325 ms 22480 KB Output is correct
48 Correct 390 ms 43884 KB Output is correct
49 Correct 378 ms 36768 KB Output is correct
50 Correct 201 ms 664 KB Output is correct
51 Correct 251 ms 664 KB Output is correct
52 Correct 304 ms 788 KB Output is correct
53 Correct 339 ms 24296 KB Output is correct
54 Correct 250 ms 796 KB Output is correct
55 Correct 308 ms 21244 KB Output is correct
56 Correct 203 ms 876 KB Output is correct
57 Correct 210 ms 1152 KB Output is correct
58 Correct 202 ms 896 KB Output is correct
59 Correct 369 ms 24804 KB Output is correct
60 Correct 353 ms 24976 KB Output is correct
61 Correct 444 ms 49048 KB Output is correct
62 Correct 455 ms 44384 KB Output is correct
63 Correct 210 ms 1176 KB Output is correct
64 Correct 359 ms 1220 KB Output is correct
65 Correct 458 ms 26916 KB Output is correct
66 Correct 470 ms 23724 KB Output is correct
67 Correct 374 ms 1192 KB Output is correct
68 Correct 309 ms 1204 KB Output is correct
69 Correct 582 ms 47636 KB Output is correct
70 Correct 532 ms 39804 KB Output is correct
71 Correct 322 ms 5292 KB Output is correct
72 Correct 311 ms 1176 KB Output is correct