oj.uz

Submission #830337

# Submission time Handle Problem Language Result Execution time Memory
830337 2023-08-19T03:59:06 Z NoName14159 Two Transportations (JOI19_transportations) C++14
68 / 100
 524 ms 49280 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[58000];
	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(7749);
	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[58000];
	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(7749);
	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 329 ms 804 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 226 ms 820 KB Output is correct
4 Correct 403 ms 10128 KB Output is correct
5 Correct 17 ms 972 KB Output is correct
6 Correct 347 ms 2436 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 656 KB Output is correct
2 Runtime error 153 ms 460 KB Execution killed with signal 13
3 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 388 ms 816 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 316 ms 752 KB Output is correct
4 Failed 129 ms 424 KB Unexpected end of file - int32 expected (Baijan)
5 Halted 0 ms 0 KB -

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 732 KB Output is correct
2 Correct 187 ms 696 KB Output is correct
3 Correct 229 ms 13388 KB Output is correct
4 Correct 104 ms 888 KB Output is correct
5 Correct 258 ms 10088 KB Output is correct
6 Correct 85 ms 740 KB Output is correct
7 Correct 130 ms 800 KB Output is correct
8 Correct 184 ms 792 KB Output is correct
9 Correct 231 ms 19436 KB Output is correct
10 Correct 295 ms 19652 KB Output is correct
11 Correct 433 ms 38276 KB Output is correct
12 Correct 300 ms 36032 KB Output is correct
13 Correct 137 ms 964 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 123 ms 732 KB Output is correct
2 Correct 187 ms 696 KB Output is correct
3 Correct 229 ms 13388 KB Output is correct
4 Correct 104 ms 888 KB Output is correct
5 Correct 258 ms 10088 KB Output is correct
6 Correct 85 ms 740 KB Output is correct
7 Correct 130 ms 800 KB Output is correct
8 Correct 184 ms 792 KB Output is correct
9 Correct 231 ms 19436 KB Output is correct
10 Correct 295 ms 19652 KB Output is correct
11 Correct 433 ms 38276 KB Output is correct
12 Correct 300 ms 36032 KB Output is correct
13 Correct 137 ms 964 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 203 ms 732 KB Output is correct
16 Correct 209 ms 732 KB Output is correct
17 Correct 175 ms 736 KB Output is correct
18 Correct 310 ms 10120 KB Output is correct
19 Correct 187 ms 796 KB Output is correct
20 Correct 299 ms 10304 KB Output is correct
21 Correct 144 ms 828 KB Output is correct
22 Correct 184 ms 944 KB Output is correct
23 Correct 295 ms 22420 KB Output is correct
24 Correct 325 ms 22616 KB Output is correct
25 Correct 489 ms 44084 KB Output is correct
26 Correct 443 ms 40456 KB Output is correct
27 Correct 175 ms 900 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 732 KB Output is correct
2 Correct 187 ms 696 KB Output is correct
3 Correct 229 ms 13388 KB Output is correct
4 Correct 104 ms 888 KB Output is correct
5 Correct 258 ms 10088 KB Output is correct
6 Correct 85 ms 740 KB Output is correct
7 Correct 130 ms 800 KB Output is correct
8 Correct 184 ms 792 KB Output is correct
9 Correct 231 ms 19436 KB Output is correct
10 Correct 295 ms 19652 KB Output is correct
11 Correct 433 ms 38276 KB Output is correct
12 Correct 300 ms 36032 KB Output is correct
13 Correct 137 ms 964 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 203 ms 732 KB Output is correct
16 Correct 209 ms 732 KB Output is correct
17 Correct 175 ms 736 KB Output is correct
18 Correct 310 ms 10120 KB Output is correct
19 Correct 187 ms 796 KB Output is correct
20 Correct 299 ms 10304 KB Output is correct
21 Correct 144 ms 828 KB Output is correct
22 Correct 184 ms 944 KB Output is correct
23 Correct 295 ms 22420 KB Output is correct
24 Correct 325 ms 22616 KB Output is correct
25 Correct 489 ms 44084 KB Output is correct
26 Correct 443 ms 40456 KB Output is correct
27 Correct 175 ms 900 KB Output is correct
28 Correct 285 ms 764 KB Output is correct
29 Correct 201 ms 748 KB Output is correct
30 Correct 445 ms 24024 KB Output is correct
31 Correct 241 ms 748 KB Output is correct
32 Correct 393 ms 21104 KB Output is correct
33 Correct 197 ms 820 KB Output is correct
34 Correct 232 ms 884 KB Output is correct
35 Correct 275 ms 880 KB Output is correct
36 Correct 318 ms 25080 KB Output is correct
37 Correct 402 ms 25080 KB Output is correct
38 Correct 476 ms 49280 KB Output is correct
39 Correct 524 ms 47048 KB Output is correct
40 Correct 199 ms 944 KB Output is correct

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 329 ms 804 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 226 ms 820 KB Output is correct
4 Correct 403 ms 10128 KB Output is correct
5 Correct 17 ms 972 KB Output is correct
6 Correct 347 ms 2436 KB Output is correct
7 Correct 0 ms 656 KB Output is correct
8 Runtime error 153 ms 460 KB Execution killed with signal 13
9 Halted 0 ms 0 KB -