oj.uz

Submission #134864

# Submission time Handle Problem Language Result Execution time Memory
134864 2019-07-23T10:43:20 Z scanhex Two Transportations (JOI19_transportations) C++17
100 / 100
 1930 ms 85344 KB 
#include<bits/stdc++.h>
using namespace std;
#include "Azer.h"

namespace {
const int N=2020;
const int SZ=9;
vector<pair<int,int>>g[N];
deque<int>q;
void send(int x,int len){
	if(len==SZ)x=min(x,(1<<SZ)-1);
	for(int i=len-1;i>=0;--i)
		SendA(x>>i&1);
}
int receive(int len){
	assert(q.size()>=len);
	int ans=0;
	for(int i=0;i<len;++i)
		ans*=2,ans+=q.front(),q.pop_front();
	return ans;
}
int d[N];
int n;
const int oo=(1<<SZ)-1;
int state=0;
int rest=0;
int kek,mem;
auto cmp=[&](const int a,const int b){
	if(d[a]!=d[b])
		return d[a]<d[b];
	return a<b;
};
set<int,decltype(cmp)>st(cmp);
int last=0;
void relax(){
//	cerr<<"a "<<kek<<' '<<mem<<'\n';
	st.erase(kek);
	d[kek]=mem;
	last=mem;
	for(auto& [a,b]:g[kek]){
		if(d[kek]+b<d[a]){
			st.erase(a);
			d[a]=d[kek]+b;
			st.insert(a);
		}
	}
}
void proc(){
	int num=0;
	for(int x:q)num*=2,num+=x;
	q.clear();
	if(!st.size())return;
	if(state==0){
		kek=*st.begin();
		mem=d[kek];
//		cerr<<"a "<<mem<<'\n';
		send(mem-last,SZ);
		state=1;
		rest=SZ;
		return;
	}
	if(state==1){
		if(num==mem-last){
			send(kek,11);
			relax();
			state=0;
			proc();
			return;
		}
		else{
			mem=num+last;
			state=3;
			rest=11;
			return;
		}
	}
	if(state==3){
		kek=num;
		relax();
		state=0;
		proc();
		return;
	}
}
}  // namespace

void InitA(int N, int A, std::vector<int> U, std::vector<int> V,
		std::vector<int> C) {
	n=N;
	for(int i=0;i<A;++i){
		g[U[i]].emplace_back(V[i],C[i]);
		g[V[i]].emplace_back(U[i],C[i]);
	}
	fill(d,d+n,1<<20);
	d[0]=0;
	for(int i=0;i<n;++i)st.insert(i);
	proc();
}

void ReceiveA(bool x) {
	q.push_back(x);
	if(--rest==0){
		proc();
	}
}

std::vector<int> Answer() {
	vector<int>ans(d,d+n);
	return ans;
}

#include<bits/stdc++.h>
using namespace std;
#include "Baijan.h"

namespace {
const int N=2020;
const int SZ=9;
vector<pair<int,int>>g[N];
deque<int>q;
void send(int x,int len){
	if(len==SZ)x=min(x,(1<<SZ)-1);
	for(int i=len-1;i>=0;--i)
		SendB(x>>i&1);
}
int receive(int len){
	assert(q.size()>=len);
	int ans=0;
	for(int i=0;i<len;++i)
		ans*=2,ans+=q.front(),q.pop_front();
	return ans;
}
int d[N];
int n;
const int oo=(1<<SZ)-1;
int rest=0;
int state=0;
int kek,mem;
auto cmp=[&](const int a,const int b){
	if(d[a]!=d[b])
		return d[a]<d[b];
	return a<b;
};
set<int,decltype(cmp)>st(cmp);
int last=0;
void relax(){
//	cerr<<kek<<' '<<mem<<'\n';
	st.erase(kek);
	d[kek]=mem;
	last=mem;
	for(auto& [a,b]:g[kek]){
		if(d[kek]+b<d[a]){
			st.erase(a);
			d[a]=d[kek]+b;
			st.insert(a);
		}
	}
}

void proc(){
	int num=0;
	for(int x:q)num*=2,num+=x;
	q.clear();
//	cerr<<num<<'\n';
	if(!st.size())return;
	if(state==0){
		kek=*st.begin();
		mem=d[kek];
		int di=num+last;
//		cerr<<di<<'\n';
		if(mem>=di){
			send(num,SZ);
			mem=di;
			state=1;
			rest=11;
			return;
		}
		else{
//			cerr<<"rofl\n";
			send(mem-last,SZ);
			send(kek,11);
			state=0;
			rest=SZ;
			relax();
			return;
		}
	}
	if(state==1){
		kek=num;
		relax();
		state=0;
		rest=SZ;
		return;
	}
}
}  // namespace

void InitB(int N, int B, std::vector<int> U, std::vector<int> V,
           std::vector<int> C) {
	n=N;
	for(int i=0;i<B;++i){
		g[U[i]].emplace_back(V[i],C[i]);
		g[V[i]].emplace_back(U[i],C[i]);
	}
	fill(d,d+n,1<<20);
	d[0]=0;
	for(int i=0;i<n;++i)st.insert(i);
	rest=SZ;
}


void ReceiveB(bool y) {
	q.push_back(y);
	if(--rest==0)proc();
}

Compilation message

In file included from /usr/include/c++/7/cassert:44:0,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:33,
                 from Azer.cpp:1:
Azer.cpp: In function 'int {anonymous}::receive(int)':
Azer.cpp:16:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  assert(q.size()>=len);
         ~~~~~~~~^~~
Azer.cpp: At global scope:
Azer.cpp:15:5: warning: 'int {anonymous}::receive(int)' defined but not used [-Wunused-function]
 int receive(int len){
     ^~~~~~~

In file included from /usr/include/c++/7/cassert:44:0,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:33,
                 from Baijan.cpp:1:
Baijan.cpp: In function 'int {anonymous}::receive(int)':
Baijan.cpp:16:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  assert(q.size()>=len);
         ~~~~~~~~^~~
Baijan.cpp: At global scope:
Baijan.cpp:15:5: warning: 'int {anonymous}::receive(int)' defined but not used [-Wunused-function]
 int receive(int len){
     ^~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1282 ms 2024 KB Output is correct
2 Correct 4 ms 1248 KB Output is correct
3 Correct 1162 ms 1856 KB Output is correct
4 Correct 1556 ms 20328 KB Output is correct
5 Correct 76 ms 1672 KB Output is correct
6 Correct 886 ms 4736 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1344 KB Output is correct
2 Correct 1186 ms 2272 KB Output is correct
3 Correct 1142 ms 2272 KB Output is correct
4 Correct 1534 ms 55656 KB Output is correct
5 Correct 1738 ms 48264 KB Output is correct
6 Correct 394 ms 1232 KB Output is correct
7 Correct 1431 ms 48544 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 946 ms 2088 KB Output is correct
2 Correct 8 ms 992 KB Output is correct
3 Correct 1160 ms 1920 KB Output is correct
4 Correct 1016 ms 2024 KB Output is correct
5 Correct 896 ms 1928 KB Output is correct
6 Correct 900 ms 1920 KB Output is correct
7 Correct 998 ms 2024 KB Output is correct
8 Correct 758 ms 2016 KB Output is correct
9 Correct 798 ms 1856 KB Output is correct
10 Correct 1000 ms 1888 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 520 ms 1600 KB Output is correct
2 Correct 416 ms 1576 KB Output is correct
3 Correct 662 ms 23704 KB Output is correct
4 Correct 522 ms 1496 KB Output is correct
5 Correct 818 ms 17232 KB Output is correct
6 Correct 410 ms 1560 KB Output is correct
7 Correct 418 ms 1760 KB Output is correct
8 Correct 473 ms 1504 KB Output is correct
9 Correct 942 ms 36112 KB Output is correct
10 Correct 787 ms 35992 KB Output is correct
11 Correct 1176 ms 60848 KB Output is correct
12 Correct 948 ms 53472 KB Output is correct
13 Correct 442 ms 1776 KB Output is correct
14 Correct 6 ms 1216 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 520 ms 1600 KB Output is correct
2 Correct 416 ms 1576 KB Output is correct
3 Correct 662 ms 23704 KB Output is correct
4 Correct 522 ms 1496 KB Output is correct
5 Correct 818 ms 17232 KB Output is correct
6 Correct 410 ms 1560 KB Output is correct
7 Correct 418 ms 1760 KB Output is correct
8 Correct 473 ms 1504 KB Output is correct
9 Correct 942 ms 36112 KB Output is correct
10 Correct 787 ms 35992 KB Output is correct
11 Correct 1176 ms 60848 KB Output is correct
12 Correct 948 ms 53472 KB Output is correct
13 Correct 442 ms 1776 KB Output is correct
14 Correct 6 ms 1216 KB Output is correct
15 Correct 334 ms 1504 KB Output is correct
16 Correct 516 ms 1496 KB Output is correct
17 Correct 470 ms 1760 KB Output is correct
18 Correct 686 ms 17632 KB Output is correct
19 Correct 569 ms 1640 KB Output is correct
20 Correct 502 ms 17944 KB Output is correct
21 Correct 620 ms 1560 KB Output is correct
22 Correct 519 ms 1784 KB Output is correct
23 Correct 860 ms 44216 KB Output is correct
24 Correct 1020 ms 44080 KB Output is correct
25 Correct 1348 ms 74880 KB Output is correct
26 Correct 1126 ms 63896 KB Output is correct
27 Correct 492 ms 2016 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 520 ms 1600 KB Output is correct
2 Correct 416 ms 1576 KB Output is correct
3 Correct 662 ms 23704 KB Output is correct
4 Correct 522 ms 1496 KB Output is correct
5 Correct 818 ms 17232 KB Output is correct
6 Correct 410 ms 1560 KB Output is correct
7 Correct 418 ms 1760 KB Output is correct
8 Correct 473 ms 1504 KB Output is correct
9 Correct 942 ms 36112 KB Output is correct
10 Correct 787 ms 35992 KB Output is correct
11 Correct 1176 ms 60848 KB Output is correct
12 Correct 948 ms 53472 KB Output is correct
13 Correct 442 ms 1776 KB Output is correct
14 Correct 6 ms 1216 KB Output is correct
15 Correct 334 ms 1504 KB Output is correct
16 Correct 516 ms 1496 KB Output is correct
17 Correct 470 ms 1760 KB Output is correct
18 Correct 686 ms 17632 KB Output is correct
19 Correct 569 ms 1640 KB Output is correct
20 Correct 502 ms 17944 KB Output is correct
21 Correct 620 ms 1560 KB Output is correct
22 Correct 519 ms 1784 KB Output is correct
23 Correct 860 ms 44216 KB Output is correct
24 Correct 1020 ms 44080 KB Output is correct
25 Correct 1348 ms 74880 KB Output is correct
26 Correct 1126 ms 63896 KB Output is correct
27 Correct 492 ms 2016 KB Output is correct
28 Correct 721 ms 1600 KB Output is correct
29 Correct 394 ms 1600 KB Output is correct
30 Correct 1230 ms 41936 KB Output is correct
31 Correct 730 ms 1760 KB Output is correct
32 Correct 1148 ms 37384 KB Output is correct
33 Correct 832 ms 1832 KB Output is correct
34 Correct 616 ms 1792 KB Output is correct
35 Correct 820 ms 2088 KB Output is correct
36 Correct 1340 ms 49256 KB Output is correct
37 Correct 1034 ms 49344 KB Output is correct
38 Correct 1740 ms 85344 KB Output is correct
39 Correct 1590 ms 78432 KB Output is correct
40 Correct 758 ms 2016 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1282 ms 2024 KB Output is correct
2 Correct 4 ms 1248 KB Output is correct
3 Correct 1162 ms 1856 KB Output is correct
4 Correct 1556 ms 20328 KB Output is correct
5 Correct 76 ms 1672 KB Output is correct
6 Correct 886 ms 4736 KB Output is correct
7 Correct 4 ms 1344 KB Output is correct
8 Correct 1186 ms 2272 KB Output is correct
9 Correct 1142 ms 2272 KB Output is correct
10 Correct 1534 ms 55656 KB Output is correct
11 Correct 1738 ms 48264 KB Output is correct
12 Correct 394 ms 1232 KB Output is correct
13 Correct 1431 ms 48544 KB Output is correct
14 Correct 946 ms 2088 KB Output is correct
15 Correct 8 ms 992 KB Output is correct
16 Correct 1160 ms 1920 KB Output is correct
17 Correct 1016 ms 2024 KB Output is correct
18 Correct 896 ms 1928 KB Output is correct
19 Correct 900 ms 1920 KB Output is correct
20 Correct 998 ms 2024 KB Output is correct
21 Correct 758 ms 2016 KB Output is correct
22 Correct 798 ms 1856 KB Output is correct
23 Correct 1000 ms 1888 KB Output is correct
24 Correct 520 ms 1600 KB Output is correct
25 Correct 416 ms 1576 KB Output is correct
26 Correct 662 ms 23704 KB Output is correct
27 Correct 522 ms 1496 KB Output is correct
28 Correct 818 ms 17232 KB Output is correct
29 Correct 410 ms 1560 KB Output is correct
30 Correct 418 ms 1760 KB Output is correct
31 Correct 473 ms 1504 KB Output is correct
32 Correct 942 ms 36112 KB Output is correct
33 Correct 787 ms 35992 KB Output is correct
34 Correct 1176 ms 60848 KB Output is correct
35 Correct 948 ms 53472 KB Output is correct
36 Correct 442 ms 1776 KB Output is correct
37 Correct 6 ms 1216 KB Output is correct
38 Correct 334 ms 1504 KB Output is correct
39 Correct 516 ms 1496 KB Output is correct
40 Correct 470 ms 1760 KB Output is correct
41 Correct 686 ms 17632 KB Output is correct
42 Correct 569 ms 1640 KB Output is correct
43 Correct 502 ms 17944 KB Output is correct
44 Correct 620 ms 1560 KB Output is correct
45 Correct 519 ms 1784 KB Output is correct
46 Correct 860 ms 44216 KB Output is correct
47 Correct 1020 ms 44080 KB Output is correct
48 Correct 1348 ms 74880 KB Output is correct
49 Correct 1126 ms 63896 KB Output is correct
50 Correct 492 ms 2016 KB Output is correct
51 Correct 721 ms 1600 KB Output is correct
52 Correct 394 ms 1600 KB Output is correct
53 Correct 1230 ms 41936 KB Output is correct
54 Correct 730 ms 1760 KB Output is correct
55 Correct 1148 ms 37384 KB Output is correct
56 Correct 832 ms 1832 KB Output is correct
57 Correct 616 ms 1792 KB Output is correct
58 Correct 820 ms 2088 KB Output is correct
59 Correct 1340 ms 49256 KB Output is correct
60 Correct 1034 ms 49344 KB Output is correct
61 Correct 1740 ms 85344 KB Output is correct
62 Correct 1590 ms 78432 KB Output is correct
63 Correct 758 ms 2016 KB Output is correct
64 Correct 1090 ms 2528 KB Output is correct
65 Correct 1214 ms 46952 KB Output is correct
66 Correct 1346 ms 40744 KB Output is correct
67 Correct 940 ms 2144 KB Output is correct
68 Correct 1176 ms 2112 KB Output is correct
69 Correct 1930 ms 83024 KB Output is correct
70 Correct 1586 ms 67888 KB Output is correct
71 Correct 1304 ms 8992 KB Output is correct
72 Correct 954 ms 2560 KB Output is correct