oj.uz

답안 #916609

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
916609 2024-01-26T07:06:39 Z winter0101 Two Transportations (JOI19_transportations) C++14
100 / 100
 618 ms 49120 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)
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 338 ms 1044 KB Output is correct
2 Correct 0 ms 664 KB Output is correct
3 Correct 352 ms 1048 KB Output is correct
4 Correct 450 ms 10492 KB Output is correct
5 Correct 15 ms 920 KB Output is correct
6 Correct 312 ms 2460 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 664 KB Output is correct
2 Correct 314 ms 876 KB Output is correct
3 Correct 402 ms 936 KB Output is correct
4 Correct 474 ms 27768 KB Output is correct
5 Correct 440 ms 24336 KB Output is correct
6 Correct 68 ms 664 KB Output is correct
7 Correct 468 ms 24592 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 314 ms 860 KB Output is correct
2 Correct 1 ms 664 KB Output is correct
3 Correct 342 ms 800 KB Output is correct
4 Correct 319 ms 876 KB Output is correct
5 Correct 352 ms 876 KB Output is correct
6 Correct 317 ms 860 KB Output is correct
7 Correct 366 ms 876 KB Output is correct
8 Correct 339 ms 796 KB Output is correct
9 Correct 268 ms 916 KB Output is correct
10 Correct 434 ms 1048 KB Output is correct

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 155 ms 820 KB Output is correct
2 Correct 164 ms 788 KB Output is correct
3 Correct 217 ms 13576 KB Output is correct
4 Correct 119 ms 848 KB Output is correct
5 Correct 198 ms 10192 KB Output is correct
6 Correct 167 ms 664 KB Output is correct
7 Correct 175 ms 856 KB Output is correct
8 Correct 151 ms 664 KB Output is correct
9 Correct 219 ms 18216 KB Output is correct
10 Correct 262 ms 18276 KB Output is correct
11 Correct 307 ms 35896 KB Output is correct
12 Correct 315 ms 30948 KB Output is correct
13 Correct 166 ms 664 KB Output is correct
14 Correct 0 ms 664 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 155 ms 820 KB Output is correct
2 Correct 164 ms 788 KB Output is correct
3 Correct 217 ms 13576 KB Output is correct
4 Correct 119 ms 848 KB Output is correct
5 Correct 198 ms 10192 KB Output is correct
6 Correct 167 ms 664 KB Output is correct
7 Correct 175 ms 856 KB Output is correct
8 Correct 151 ms 664 KB Output is correct
9 Correct 219 ms 18216 KB Output is correct
10 Correct 262 ms 18276 KB Output is correct
11 Correct 307 ms 35896 KB Output is correct
12 Correct 315 ms 30948 KB Output is correct
13 Correct 166 ms 664 KB Output is correct
14 Correct 0 ms 664 KB Output is correct
15 Correct 144 ms 844 KB Output is correct
16 Correct 144 ms 856 KB Output is correct
17 Correct 178 ms 668 KB Output is correct
18 Correct 215 ms 10400 KB Output is correct
19 Correct 146 ms 664 KB Output is correct
20 Correct 248 ms 10568 KB Output is correct
21 Correct 223 ms 672 KB Output is correct
22 Correct 188 ms 832 KB Output is correct
23 Correct 284 ms 22416 KB Output is correct
24 Correct 320 ms 22416 KB Output is correct
25 Correct 373 ms 43660 KB Output is correct
26 Correct 387 ms 36548 KB Output is correct
27 Correct 162 ms 900 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 155 ms 820 KB Output is correct
2 Correct 164 ms 788 KB Output is correct
3 Correct 217 ms 13576 KB Output is correct
4 Correct 119 ms 848 KB Output is correct
5 Correct 198 ms 10192 KB Output is correct
6 Correct 167 ms 664 KB Output is correct
7 Correct 175 ms 856 KB Output is correct
8 Correct 151 ms 664 KB Output is correct
9 Correct 219 ms 18216 KB Output is correct
10 Correct 262 ms 18276 KB Output is correct
11 Correct 307 ms 35896 KB Output is correct
12 Correct 315 ms 30948 KB Output is correct
13 Correct 166 ms 664 KB Output is correct
14 Correct 0 ms 664 KB Output is correct
15 Correct 144 ms 844 KB Output is correct
16 Correct 144 ms 856 KB Output is correct
17 Correct 178 ms 668 KB Output is correct
18 Correct 215 ms 10400 KB Output is correct
19 Correct 146 ms 664 KB Output is correct
20 Correct 248 ms 10568 KB Output is correct
21 Correct 223 ms 672 KB Output is correct
22 Correct 188 ms 832 KB Output is correct
23 Correct 284 ms 22416 KB Output is correct
24 Correct 320 ms 22416 KB Output is correct
25 Correct 373 ms 43660 KB Output is correct
26 Correct 387 ms 36548 KB Output is correct
27 Correct 162 ms 900 KB Output is correct
28 Correct 223 ms 836 KB Output is correct
29 Correct 178 ms 796 KB Output is correct
30 Correct 339 ms 24332 KB Output is correct
31 Correct 201 ms 792 KB Output is correct
32 Correct 324 ms 21248 KB Output is correct
33 Correct 219 ms 864 KB Output is correct
34 Correct 200 ms 896 KB Output is correct
35 Correct 232 ms 900 KB Output is correct
36 Correct 334 ms 25028 KB Output is correct
37 Correct 324 ms 24816 KB Output is correct
38 Correct 479 ms 49120 KB Output is correct
39 Correct 447 ms 44384 KB Output is correct
40 Correct 241 ms 1180 KB Output is correct

Subtask #7
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 338 ms 1044 KB Output is correct
2 Correct 0 ms 664 KB Output is correct
3 Correct 352 ms 1048 KB Output is correct
4 Correct 450 ms 10492 KB Output is correct
5 Correct 15 ms 920 KB Output is correct
6 Correct 312 ms 2460 KB Output is correct
7 Correct 0 ms 664 KB Output is correct
8 Correct 314 ms 876 KB Output is correct
9 Correct 402 ms 936 KB Output is correct
10 Correct 474 ms 27768 KB Output is correct
11 Correct 440 ms 24336 KB Output is correct
12 Correct 68 ms 664 KB Output is correct
13 Correct 468 ms 24592 KB Output is correct
14 Correct 314 ms 860 KB Output is correct
15 Correct 1 ms 664 KB Output is correct
16 Correct 342 ms 800 KB Output is correct
17 Correct 319 ms 876 KB Output is correct
18 Correct 352 ms 876 KB Output is correct
19 Correct 317 ms 860 KB Output is correct
20 Correct 366 ms 876 KB Output is correct
21 Correct 339 ms 796 KB Output is correct
22 Correct 268 ms 916 KB Output is correct
23 Correct 434 ms 1048 KB Output is correct
24 Correct 155 ms 820 KB Output is correct
25 Correct 164 ms 788 KB Output is correct
26 Correct 217 ms 13576 KB Output is correct
27 Correct 119 ms 848 KB Output is correct
28 Correct 198 ms 10192 KB Output is correct
29 Correct 167 ms 664 KB Output is correct
30 Correct 175 ms 856 KB Output is correct
31 Correct 151 ms 664 KB Output is correct
32 Correct 219 ms 18216 KB Output is correct
33 Correct 262 ms 18276 KB Output is correct
34 Correct 307 ms 35896 KB Output is correct
35 Correct 315 ms 30948 KB Output is correct
36 Correct 166 ms 664 KB Output is correct
37 Correct 0 ms 664 KB Output is correct
38 Correct 144 ms 844 KB Output is correct
39 Correct 144 ms 856 KB Output is correct
40 Correct 178 ms 668 KB Output is correct
41 Correct 215 ms 10400 KB Output is correct
42 Correct 146 ms 664 KB Output is correct
43 Correct 248 ms 10568 KB Output is correct
44 Correct 223 ms 672 KB Output is correct
45 Correct 188 ms 832 KB Output is correct
46 Correct 284 ms 22416 KB Output is correct
47 Correct 320 ms 22416 KB Output is correct
48 Correct 373 ms 43660 KB Output is correct
49 Correct 387 ms 36548 KB Output is correct
50 Correct 162 ms 900 KB Output is correct
51 Correct 223 ms 836 KB Output is correct
52 Correct 178 ms 796 KB Output is correct
53 Correct 339 ms 24332 KB Output is correct
54 Correct 201 ms 792 KB Output is correct
55 Correct 324 ms 21248 KB Output is correct
56 Correct 219 ms 864 KB Output is correct
57 Correct 200 ms 896 KB Output is correct
58 Correct 232 ms 900 KB Output is correct
59 Correct 334 ms 25028 KB Output is correct
60 Correct 324 ms 24816 KB Output is correct
61 Correct 479 ms 49120 KB Output is correct
62 Correct 447 ms 44384 KB Output is correct
63 Correct 241 ms 1180 KB Output is correct
64 Correct 324 ms 1216 KB Output is correct
65 Correct 530 ms 26784 KB Output is correct
66 Correct 450 ms 23504 KB Output is correct
67 Correct 307 ms 1192 KB Output is correct
68 Correct 291 ms 1192 KB Output is correct
69 Correct 618 ms 47920 KB Output is correct
70 Correct 548 ms 39668 KB Output is correct
71 Correct 412 ms 5352 KB Output is correct
72 Correct 378 ms 1176 KB Output is correct