oj.uz

Submission #831431

# Submission time Handle Problem Language Result Execution time Memory
831431 2023-08-20T08:53:30 Z NoName14159 Two Transportations (JOI19_transportations) C++17
84 / 100
 604 ms 49320 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)(std::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){
	std::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)(std::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){
	std::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 312 ms 908 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 349 ms 940 KB Output is correct
4 Correct 419 ms 10124 KB Output is correct
5 Correct 21 ms 980 KB Output is correct
6 Correct 358 ms 2408 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 325 ms 848 KB Output is correct
3 Correct 318 ms 884 KB Output is correct
4 Correct 472 ms 27692 KB Output is correct
5 Correct 527 ms 24420 KB Output is correct
6 Correct 82 ms 708 KB Output is correct
7 Correct 522 ms 24628 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 392 ms 796 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 279 ms 768 KB Output is correct
4 Correct 324 ms 976 KB Output is correct
5 Correct 365 ms 864 KB Output is correct
6 Correct 308 ms 824 KB Output is correct
7 Correct 390 ms 784 KB Output is correct
8 Correct 442 ms 916 KB Output is correct
9 Correct 306 ms 896 KB Output is correct
10 Correct 243 ms 916 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 724 KB Output is correct
2 Correct 119 ms 824 KB Output is correct
3 Correct 255 ms 13300 KB Output is correct
4 Correct 147 ms 784 KB Output is correct
5 Correct 229 ms 10116 KB Output is correct
6 Correct 182 ms 728 KB Output is correct
7 Correct 158 ms 920 KB Output is correct
8 Correct 175 ms 792 KB Output is correct
9 Correct 293 ms 19468 KB Output is correct
10 Correct 230 ms 19596 KB Output is correct
11 Correct 389 ms 38380 KB Output is correct
12 Correct 330 ms 36044 KB Output is correct
13 Correct 166 ms 832 KB Output is correct
14 Correct 0 ms 656 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 724 KB Output is correct
2 Correct 119 ms 824 KB Output is correct
3 Correct 255 ms 13300 KB Output is correct
4 Correct 147 ms 784 KB Output is correct
5 Correct 229 ms 10116 KB Output is correct
6 Correct 182 ms 728 KB Output is correct
7 Correct 158 ms 920 KB Output is correct
8 Correct 175 ms 792 KB Output is correct
9 Correct 293 ms 19468 KB Output is correct
10 Correct 230 ms 19596 KB Output is correct
11 Correct 389 ms 38380 KB Output is correct
12 Correct 330 ms 36044 KB Output is correct
13 Correct 166 ms 832 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 141 ms 740 KB Output is correct
16 Correct 217 ms 716 KB Output is correct
17 Correct 167 ms 736 KB Output is correct
18 Correct 241 ms 10132 KB Output is correct
19 Correct 257 ms 788 KB Output is correct
20 Correct 287 ms 10264 KB Output is correct
21 Correct 187 ms 828 KB Output is correct
22 Correct 157 ms 808 KB Output is correct
23 Correct 280 ms 22528 KB Output is correct
24 Correct 325 ms 22456 KB Output is correct
25 Correct 536 ms 44172 KB Output is correct
26 Correct 493 ms 40496 KB Output is correct
27 Correct 183 ms 848 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 724 KB Output is correct
2 Correct 119 ms 824 KB Output is correct
3 Correct 255 ms 13300 KB Output is correct
4 Correct 147 ms 784 KB Output is correct
5 Correct 229 ms 10116 KB Output is correct
6 Correct 182 ms 728 KB Output is correct
7 Correct 158 ms 920 KB Output is correct
8 Correct 175 ms 792 KB Output is correct
9 Correct 293 ms 19468 KB Output is correct
10 Correct 230 ms 19596 KB Output is correct
11 Correct 389 ms 38380 KB Output is correct
12 Correct 330 ms 36044 KB Output is correct
13 Correct 166 ms 832 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 141 ms 740 KB Output is correct
16 Correct 217 ms 716 KB Output is correct
17 Correct 167 ms 736 KB Output is correct
18 Correct 241 ms 10132 KB Output is correct
19 Correct 257 ms 788 KB Output is correct
20 Correct 287 ms 10264 KB Output is correct
21 Correct 187 ms 828 KB Output is correct
22 Correct 157 ms 808 KB Output is correct
23 Correct 280 ms 22528 KB Output is correct
24 Correct 325 ms 22456 KB Output is correct
25 Correct 536 ms 44172 KB Output is correct
26 Correct 493 ms 40496 KB Output is correct
27 Correct 183 ms 848 KB Output is correct
28 Correct 265 ms 888 KB Output is correct
29 Correct 212 ms 736 KB Output is correct
30 Correct 423 ms 24084 KB Output is correct
31 Correct 270 ms 748 KB Output is correct
32 Correct 428 ms 21092 KB Output is correct
33 Correct 222 ms 812 KB Output is correct
34 Correct 290 ms 876 KB Output is correct
35 Correct 304 ms 892 KB Output is correct
36 Correct 413 ms 25104 KB Output is correct
37 Correct 337 ms 25012 KB Output is correct
38 Correct 604 ms 49320 KB Output is correct
39 Correct 540 ms 46892 KB Output is correct
40 Correct 267 ms 936 KB Output is correct

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 312 ms 908 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 349 ms 940 KB Output is correct
4 Correct 419 ms 10124 KB Output is correct
5 Correct 21 ms 980 KB Output is correct
6 Correct 358 ms 2408 KB Output is correct
7 Correct 0 ms 656 KB Output is correct
8 Correct 325 ms 848 KB Output is correct
9 Correct 318 ms 884 KB Output is correct
10 Correct 472 ms 27692 KB Output is correct
11 Correct 527 ms 24420 KB Output is correct
12 Correct 82 ms 708 KB Output is correct
13 Correct 522 ms 24628 KB Output is correct
14 Correct 392 ms 796 KB Output is correct
15 Correct 0 ms 656 KB Output is correct
16 Correct 279 ms 768 KB Output is correct
17 Correct 324 ms 976 KB Output is correct
18 Correct 365 ms 864 KB Output is correct
19 Correct 308 ms 824 KB Output is correct
20 Correct 390 ms 784 KB Output is correct
21 Correct 442 ms 916 KB Output is correct
22 Correct 306 ms 896 KB Output is correct
23 Correct 243 ms 916 KB Output is correct
24 Correct 166 ms 724 KB Output is correct
25 Correct 119 ms 824 KB Output is correct
26 Correct 255 ms 13300 KB Output is correct
27 Correct 147 ms 784 KB Output is correct
28 Correct 229 ms 10116 KB Output is correct
29 Correct 182 ms 728 KB Output is correct
30 Correct 158 ms 920 KB Output is correct
31 Correct 175 ms 792 KB Output is correct
32 Correct 293 ms 19468 KB Output is correct
33 Correct 230 ms 19596 KB Output is correct
34 Correct 389 ms 38380 KB Output is correct
35 Correct 330 ms 36044 KB Output is correct
36 Correct 166 ms 832 KB Output is correct
37 Correct 0 ms 656 KB Output is correct
38 Correct 141 ms 740 KB Output is correct
39 Correct 217 ms 716 KB Output is correct
40 Correct 167 ms 736 KB Output is correct
41 Correct 241 ms 10132 KB Output is correct
42 Correct 257 ms 788 KB Output is correct
43 Correct 287 ms 10264 KB Output is correct
44 Correct 187 ms 828 KB Output is correct
45 Correct 157 ms 808 KB Output is correct
46 Correct 280 ms 22528 KB Output is correct
47 Correct 325 ms 22456 KB Output is correct
48 Correct 536 ms 44172 KB Output is correct
49 Correct 493 ms 40496 KB Output is correct
50 Correct 183 ms 848 KB Output is correct
51 Correct 265 ms 888 KB Output is correct
52 Correct 212 ms 736 KB Output is correct
53 Correct 423 ms 24084 KB Output is correct
54 Correct 270 ms 748 KB Output is correct
55 Correct 428 ms 21092 KB Output is correct
56 Correct 222 ms 812 KB Output is correct
57 Correct 290 ms 876 KB Output is correct
58 Correct 304 ms 892 KB Output is correct
59 Correct 413 ms 25104 KB Output is correct
60 Correct 337 ms 25012 KB Output is correct
61 Correct 604 ms 49320 KB Output is correct
62 Correct 540 ms 46892 KB Output is correct
63 Correct 267 ms 936 KB Output is correct
64 Correct 335 ms 1016 KB Output is correct
65 Runtime error 324 ms 13248 KB Execution killed with signal 13
66 Halted 0 ms 0 KB -