oj.uz

Submission #831370

# Submission time Handle Problem Language Result Execution time Memory
831370 2023-08-20T07:28:55 Z NoName14159 Two Transportations (JOI19_transportations) C++17
84 / 100
 569 ms 49376 KB 
#include "Azer.h"
#include <stdlib.h>
#include <cassert>
#include <queue>
#define MAXN 2007
#define MAXM 500007
#define vi std::vector<int>
#define pii std::pair<int,int>
#define vpii std::vector<pii>
#define pqpii std::priority_queue<pii,vpii,std::greater<pii>>
#define LOOP(I,X) for(int I=0;I<X;I++)
#define pub push_back
namespace{
	enum Mode{
		CL, // choose leader
		RE, // recommend edge
		DW, // determine winner
		SR, // send relax
		RX  // relax
	};
	Mode mode;
	bool leader;
	bool winner;
	int n;
	int dis[MAXN];
	bool visited[MAXN]={};
	vpii e[MAXN];
	pqpii pq;
	pii rec;
	int rec_other;
	int relax_w=0;
	int relax_v;
	bool buf[58007];
	int buf_size=0;
	int buf_now=0;
	int t=0;
	int bits_next;
int cnt=0;
	int Read(int bits){
		int ans=0;
		LOOP(i,bits){
			ans<<=1;
			ans|=(int)buf[buf_now+i];
		}
		buf_now+=bits;
		return ans;
	}
	void Send(int bits,int x){
		LOOP(i,bits){
cnt++;
assert(buf_size+cnt<=58000);
			SendA((bool)((x>>(bits-1-i))&1));
		}
	}
	void Do(){
		while(t<n-1){
			if(mode==CL){
				mode=RE;
				if(leader){
					bool new_leader=(bool)(rand()%2);
					Send(1,(int)new_leader);
					if(new_leader){
						leader=!leader;
					}
				}else{
					bool new_leader=(bool)Read(1);
					if(new_leader){
						leader=!leader;
					}
				}
				if(leader){
					bits_next=9;
					return;
				}
			}
			if(mode==RE){
				mode=DW;
				while(!pq.empty()){
					pii x=pq.top();
					if(!visited[x.second]){
						break;
					}
					pq.pop();
				}
				if(pq.empty()){
					rec={511,-1};
				}else{
					rec=pq.top();
					rec.first-=relax_w;
				}
				if(leader){
					rec_other=Read(9);
				}else{
					Send(9,rec.first);
					bits_next=1;
					return;
				}
			}
			if(mode==DW){
				mode=SR;
				if(leader){
					if(rec.first<=rec_other){
						Send(1,1);
						winner=true;
					}else{
						Send(1,0);
						winner=false;
					}
				}else{
					winner=!((bool)Read(1));
				}
				if(!winner){
					if(leader){
						bits_next=11;
					}else{
						bits_next=20;
					}
					return;
				}
			}
			if(mode==SR){
				mode=RX;
				if(leader){
					if(winner){
						Send(11,rec.second);
						relax_v=rec.second;
						Send(9,rec.first);
						relax_w+=rec.first;
					}else{
						relax_v=Read(11);
						relax_w+=rec_other;
					}
				}else{
					if(winner){
						Send(11,rec.second);
						relax_v=rec.second;
						relax_w+=rec.first;
					}else{
						relax_v=Read(11);
						relax_w+=Read(9);
					}
				}
			}
			if(mode==RX){
				mode=CL;
				dis[relax_v]=relax_w;
				visited[relax_v]=true;
				for(pii x:e[relax_v]){
					if(!visited[x.first]){
						pq.push({relax_w+x.second,x.first});
					}
				}
				t++;
				if(!leader){
					bits_next=1;
					return;
				}
			}
		}
	}
}
void InitA(int N,int A,vi U,vi V,vi C){
	srand(49);
	n=N;
	LOOP(i,A){
		e[U[i]].pub({V[i],C[i]});
		e[V[i]].pub({U[i],C[i]});
	}
	dis[0]=0;
	visited[0]=true;
	for(pii x:e[0]){
		pq.push({x.second,x.first});
	}
	mode=CL;
	leader=true;
	Do();
}
void ReceiveA(bool x){
	buf[buf_size]=x;
	buf_size++;
	if(buf_size-buf_now==bits_next){
		Do();
	}
}
vi Answer(){
	vi ans;
	LOOP(i,n){
		ans.pub(dis[i]);
	}
	return ans;
}

#include "Baijan.h"
#include <stdlib.h>
#include <cassert>
#include <queue>
#define MAXN 2007
#define MAXM 500007
#define vi std::vector<int>
#define pii std::pair<int,int>
#define vpii std::vector<pii>
#define pqpii std::priority_queue<pii,vpii,std::greater<pii>>
#define LOOP(I,X) for(int I=0;I<X;I++)
#define pub push_back
namespace{
	enum Mode{
		CL, // choose leader
		RE, // recommend edge
		DW, // determine winner
		SR, // send relax
		RX  // relax
	};
	Mode mode;
	bool leader;
	bool winner;
	int n;
	int dis[MAXN];
	bool visited[MAXN]={};
	vpii e[MAXN];
	pqpii pq;
	pii rec;
	int rec_other;
	int relax_w=0;
	int relax_v;
	bool buf[58007];
	int buf_size=0;
	int buf_now=0;
	int t=0;
	int bits_next;
int cnt=0;
	int Read(int bits){
		int ans=0;
		LOOP(i,bits){
			ans<<=1;
			ans|=(int)buf[buf_now+i];
		}
		buf_now+=bits;
		return ans;
	}
	void Send(int bits,int x){
		LOOP(i,bits){
cnt++;
assert(buf_size+cnt<=58000);
			SendB((bool)((x>>(bits-1-i))&1));
		}
	}
	void Do(){
		while(t<n-1){
			if(mode==CL){
				mode=RE;
				if(leader){
					bool new_leader=(bool)(rand()%2);
					Send(1,(int)new_leader);
					if(new_leader){
						leader=!leader;
					}
				}else{
					bool new_leader=(bool)Read(1);
					if(new_leader){
						leader=!leader;
					}
				}
				if(leader){
					bits_next=9;
					return;
				}
			}
			if(mode==RE){
				mode=DW;
				while(!pq.empty()){
					pii x=pq.top();
					if(!visited[x.second]){
						break;
					}
					pq.pop();
				}
				if(pq.empty()){
					rec={511,-1};
				}else{
					rec=pq.top();
					rec.first-=relax_w;
				}
				if(leader){
					rec_other=Read(9);
				}else{
					Send(9,rec.first);
					bits_next=1;
					return;
				}
			}
			if(mode==DW){
				mode=SR;
				if(leader){
					if(rec.first<=rec_other){
						Send(1,1);
						winner=true;
					}else{
						Send(1,0);
						winner=false;
					}
				}else{
					winner=!((bool)Read(1));
				}
				if(!winner){
					if(leader){
						bits_next=11;
					}else{
						bits_next=20;
					}
					return;
				}
			}
			if(mode==SR){
				mode=RX;
				if(leader){
					if(winner){
						Send(11,rec.second);
						relax_v=rec.second;
						Send(9,rec.first);
						relax_w+=rec.first;
					}else{
						relax_v=Read(11);
						relax_w+=rec_other;
					}
				}else{
					if(winner){
						Send(11,rec.second);
						relax_v=rec.second;
						relax_w+=rec.first;
					}else{
						relax_v=Read(11);
						relax_w+=Read(9);
					}
				}
			}
			if(mode==RX){
				mode=CL;
				dis[relax_v]=relax_w;
				visited[relax_v]=true;
				for(pii x:e[relax_v]){
					if(!visited[x.first]){
						pq.push({relax_w+x.second,x.first});
					}
				}
				t++;
				if(!leader){
					bits_next=1;
					return;
				}
			}
		}
	}
}
void InitB(int N,int A,vi U,vi V,vi C){
	srand(49);
	n=N;
	LOOP(i,A){
		e[U[i]].pub({V[i],C[i]});
		e[V[i]].pub({U[i],C[i]});
	}
	dis[0]=0;
	visited[0]=true;
	for(pii x:e[0]){
		pq.push({x.second,x.first});
	}
	mode=CL;
	leader=false;
	bits_next=1;
}
void ReceiveB(bool x){
	buf[buf_size]=x;
	buf_size++;
	if(buf_size-buf_now==bits_next){
		Do();
	}
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 337 ms 808 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 240 ms 936 KB Output is correct
4 Correct 378 ms 10216 KB Output is correct
5 Correct 23 ms 912 KB Output is correct
6 Correct 322 ms 2380 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 656 KB Output is correct
2 Correct 341 ms 860 KB Output is correct
3 Correct 297 ms 900 KB Output is correct
4 Correct 515 ms 27832 KB Output is correct
5 Correct 421 ms 24556 KB Output is correct
6 Correct 66 ms 704 KB Output is correct
7 Correct 408 ms 24540 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 337 ms 820 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 266 ms 912 KB Output is correct
4 Correct 318 ms 980 KB Output is correct
5 Correct 312 ms 852 KB Output is correct
6 Correct 360 ms 828 KB Output is correct
7 Correct 334 ms 808 KB Output is correct
8 Correct 343 ms 772 KB Output is correct
9 Correct 220 ms 800 KB Output is correct
10 Correct 331 ms 812 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 732 KB Output is correct
2 Correct 153 ms 656 KB Output is correct
3 Correct 261 ms 13312 KB Output is correct
4 Correct 159 ms 768 KB Output is correct
5 Correct 256 ms 10068 KB Output is correct
6 Correct 141 ms 752 KB Output is correct
7 Correct 150 ms 916 KB Output is correct
8 Correct 147 ms 924 KB Output is correct
9 Correct 229 ms 19424 KB Output is correct
10 Correct 231 ms 19488 KB Output is correct
11 Correct 391 ms 38460 KB Output is correct
12 Correct 326 ms 36060 KB Output is correct
13 Correct 150 ms 836 KB Output is correct
14 Correct 0 ms 704 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 732 KB Output is correct
2 Correct 153 ms 656 KB Output is correct
3 Correct 261 ms 13312 KB Output is correct
4 Correct 159 ms 768 KB Output is correct
5 Correct 256 ms 10068 KB Output is correct
6 Correct 141 ms 752 KB Output is correct
7 Correct 150 ms 916 KB Output is correct
8 Correct 147 ms 924 KB Output is correct
9 Correct 229 ms 19424 KB Output is correct
10 Correct 231 ms 19488 KB Output is correct
11 Correct 391 ms 38460 KB Output is correct
12 Correct 326 ms 36060 KB Output is correct
13 Correct 150 ms 836 KB Output is correct
14 Correct 0 ms 704 KB Output is correct
15 Correct 164 ms 748 KB Output is correct
16 Correct 173 ms 728 KB Output is correct
17 Correct 207 ms 720 KB Output is correct
18 Correct 265 ms 10116 KB Output is correct
19 Correct 208 ms 792 KB Output is correct
20 Correct 294 ms 10376 KB Output is correct
21 Correct 186 ms 952 KB Output is correct
22 Correct 172 ms 816 KB Output is correct
23 Correct 326 ms 22620 KB Output is correct
24 Correct 340 ms 22564 KB Output is correct
25 Correct 451 ms 44176 KB Output is correct
26 Correct 425 ms 40528 KB Output is correct
27 Correct 185 ms 880 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 732 KB Output is correct
2 Correct 153 ms 656 KB Output is correct
3 Correct 261 ms 13312 KB Output is correct
4 Correct 159 ms 768 KB Output is correct
5 Correct 256 ms 10068 KB Output is correct
6 Correct 141 ms 752 KB Output is correct
7 Correct 150 ms 916 KB Output is correct
8 Correct 147 ms 924 KB Output is correct
9 Correct 229 ms 19424 KB Output is correct
10 Correct 231 ms 19488 KB Output is correct
11 Correct 391 ms 38460 KB Output is correct
12 Correct 326 ms 36060 KB Output is correct
13 Correct 150 ms 836 KB Output is correct
14 Correct 0 ms 704 KB Output is correct
15 Correct 164 ms 748 KB Output is correct
16 Correct 173 ms 728 KB Output is correct
17 Correct 207 ms 720 KB Output is correct
18 Correct 265 ms 10116 KB Output is correct
19 Correct 208 ms 792 KB Output is correct
20 Correct 294 ms 10376 KB Output is correct
21 Correct 186 ms 952 KB Output is correct
22 Correct 172 ms 816 KB Output is correct
23 Correct 326 ms 22620 KB Output is correct
24 Correct 340 ms 22564 KB Output is correct
25 Correct 451 ms 44176 KB Output is correct
26 Correct 425 ms 40528 KB Output is correct
27 Correct 185 ms 880 KB Output is correct
28 Correct 235 ms 772 KB Output is correct
29 Correct 158 ms 752 KB Output is correct
30 Correct 454 ms 24048 KB Output is correct
31 Correct 189 ms 748 KB Output is correct
32 Correct 412 ms 21188 KB Output is correct
33 Correct 235 ms 736 KB Output is correct
34 Correct 252 ms 872 KB Output is correct
35 Correct 222 ms 1016 KB Output is correct
36 Correct 359 ms 25164 KB Output is correct
37 Correct 331 ms 25060 KB Output is correct
38 Correct 569 ms 49376 KB Output is correct
39 Correct 544 ms 46972 KB Output is correct
40 Correct 238 ms 1072 KB Output is correct

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 337 ms 808 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 240 ms 936 KB Output is correct
4 Correct 378 ms 10216 KB Output is correct
5 Correct 23 ms 912 KB Output is correct
6 Correct 322 ms 2380 KB Output is correct
7 Correct 0 ms 656 KB Output is correct
8 Correct 341 ms 860 KB Output is correct
9 Correct 297 ms 900 KB Output is correct
10 Correct 515 ms 27832 KB Output is correct
11 Correct 421 ms 24556 KB Output is correct
12 Correct 66 ms 704 KB Output is correct
13 Correct 408 ms 24540 KB Output is correct
14 Correct 337 ms 820 KB Output is correct
15 Correct 0 ms 656 KB Output is correct
16 Correct 266 ms 912 KB Output is correct
17 Correct 318 ms 980 KB Output is correct
18 Correct 312 ms 852 KB Output is correct
19 Correct 360 ms 828 KB Output is correct
20 Correct 334 ms 808 KB Output is correct
21 Correct 343 ms 772 KB Output is correct
22 Correct 220 ms 800 KB Output is correct
23 Correct 331 ms 812 KB Output is correct
24 Correct 122 ms 732 KB Output is correct
25 Correct 153 ms 656 KB Output is correct
26 Correct 261 ms 13312 KB Output is correct
27 Correct 159 ms 768 KB Output is correct
28 Correct 256 ms 10068 KB Output is correct
29 Correct 141 ms 752 KB Output is correct
30 Correct 150 ms 916 KB Output is correct
31 Correct 147 ms 924 KB Output is correct
32 Correct 229 ms 19424 KB Output is correct
33 Correct 231 ms 19488 KB Output is correct
34 Correct 391 ms 38460 KB Output is correct
35 Correct 326 ms 36060 KB Output is correct
36 Correct 150 ms 836 KB Output is correct
37 Correct 0 ms 704 KB Output is correct
38 Correct 164 ms 748 KB Output is correct
39 Correct 173 ms 728 KB Output is correct
40 Correct 207 ms 720 KB Output is correct
41 Correct 265 ms 10116 KB Output is correct
42 Correct 208 ms 792 KB Output is correct
43 Correct 294 ms 10376 KB Output is correct
44 Correct 186 ms 952 KB Output is correct
45 Correct 172 ms 816 KB Output is correct
46 Correct 326 ms 22620 KB Output is correct
47 Correct 340 ms 22564 KB Output is correct
48 Correct 451 ms 44176 KB Output is correct
49 Correct 425 ms 40528 KB Output is correct
50 Correct 185 ms 880 KB Output is correct
51 Correct 235 ms 772 KB Output is correct
52 Correct 158 ms 752 KB Output is correct
53 Correct 454 ms 24048 KB Output is correct
54 Correct 189 ms 748 KB Output is correct
55 Correct 412 ms 21188 KB Output is correct
56 Correct 235 ms 736 KB Output is correct
57 Correct 252 ms 872 KB Output is correct
58 Correct 222 ms 1016 KB Output is correct
59 Correct 359 ms 25164 KB Output is correct
60 Correct 331 ms 25060 KB Output is correct
61 Correct 569 ms 49376 KB Output is correct
62 Correct 544 ms 46972 KB Output is correct
63 Correct 238 ms 1072 KB Output is correct
64 Correct 335 ms 1024 KB Output is correct
65 Runtime error 300 ms 13248 KB Execution killed with signal 13
66 Halted 0 ms 0 KB -