oj.uz

Submission #826673

# Submission time Handle Problem Language Result Execution time Memory
826673 2023-08-15T19:41:55 Z NoName14159 Two Transportations (JOI19_transportations) C++14
68 / 100
 496 ms 49568 KB 
#include "Azer.h"
#include <stdlib.h>
#include <iostream>
#include <queue>
#define MAXN 2000
#define MAXM 500000
#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;
	int Read(int bits){
		while(buf_size-buf_now<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){
			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=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=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=11;
					}else{
						bits=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=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){
		Do();
	}
}
vi Answer(){
	vi ans;
	LOOP(i,n){
		ans.pub(dis[i]);
	}
	return ans;
}
#include "Baijan.h"
#include <stdlib.h>
#include <iostream>
#include <queue>
#define MAXN 2000
#define MAXM 500000
#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;
	int Read(int bits){
		while(buf_size-buf_now<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){
			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=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=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=11;
					}else{
						bits=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=1;
					return;
				}
			}
		}
	}
}
void InitB(int N,int B,vi U,vi V,vi C){
	srand(7749);
	n=N;
	LOOP(i,B){
		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=1;
}
void ReceiveB(bool x){
	buf[buf_size]=x;
	buf_size++;
	if(buf_size-buf_now>=bits){
		Do();
	}
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 252 ms 972 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 373 ms 980 KB Output is correct
4 Correct 453 ms 10132 KB Output is correct
5 Correct 20 ms 948 KB Output is correct
6 Correct 288 ms 2548 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 217 ms 564 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 321 ms 972 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 338 ms 824 KB Output is correct
4 Runtime error 187 ms 700 KB Execution killed with signal 13
5 Halted 0 ms 0 KB -

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 756 KB Output is correct
2 Correct 165 ms 852 KB Output is correct
3 Correct 299 ms 13200 KB Output is correct
4 Correct 151 ms 796 KB Output is correct
5 Correct 272 ms 10084 KB Output is correct
6 Correct 116 ms 772 KB Output is correct
7 Correct 163 ms 812 KB Output is correct
8 Correct 146 ms 828 KB Output is correct
9 Correct 229 ms 19580 KB Output is correct
10 Correct 248 ms 19648 KB Output is correct
11 Correct 388 ms 38480 KB Output is correct
12 Correct 301 ms 36024 KB Output is correct
13 Correct 115 ms 856 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 155 ms 756 KB Output is correct
2 Correct 165 ms 852 KB Output is correct
3 Correct 299 ms 13200 KB Output is correct
4 Correct 151 ms 796 KB Output is correct
5 Correct 272 ms 10084 KB Output is correct
6 Correct 116 ms 772 KB Output is correct
7 Correct 163 ms 812 KB Output is correct
8 Correct 146 ms 828 KB Output is correct
9 Correct 229 ms 19580 KB Output is correct
10 Correct 248 ms 19648 KB Output is correct
11 Correct 388 ms 38480 KB Output is correct
12 Correct 301 ms 36024 KB Output is correct
13 Correct 115 ms 856 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 205 ms 764 KB Output is correct
16 Correct 250 ms 744 KB Output is correct
17 Correct 149 ms 748 KB Output is correct
18 Correct 333 ms 10112 KB Output is correct
19 Correct 253 ms 928 KB Output is correct
20 Correct 236 ms 10336 KB Output is correct
21 Correct 134 ms 852 KB Output is correct
22 Correct 133 ms 856 KB Output is correct
23 Correct 320 ms 22472 KB Output is correct
24 Correct 359 ms 22572 KB Output is correct
25 Correct 455 ms 44044 KB Output is correct
26 Correct 402 ms 40528 KB Output is correct
27 Correct 202 ms 1048 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 756 KB Output is correct
2 Correct 165 ms 852 KB Output is correct
3 Correct 299 ms 13200 KB Output is correct
4 Correct 151 ms 796 KB Output is correct
5 Correct 272 ms 10084 KB Output is correct
6 Correct 116 ms 772 KB Output is correct
7 Correct 163 ms 812 KB Output is correct
8 Correct 146 ms 828 KB Output is correct
9 Correct 229 ms 19580 KB Output is correct
10 Correct 248 ms 19648 KB Output is correct
11 Correct 388 ms 38480 KB Output is correct
12 Correct 301 ms 36024 KB Output is correct
13 Correct 115 ms 856 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 205 ms 764 KB Output is correct
16 Correct 250 ms 744 KB Output is correct
17 Correct 149 ms 748 KB Output is correct
18 Correct 333 ms 10112 KB Output is correct
19 Correct 253 ms 928 KB Output is correct
20 Correct 236 ms 10336 KB Output is correct
21 Correct 134 ms 852 KB Output is correct
22 Correct 133 ms 856 KB Output is correct
23 Correct 320 ms 22472 KB Output is correct
24 Correct 359 ms 22572 KB Output is correct
25 Correct 455 ms 44044 KB Output is correct
26 Correct 402 ms 40528 KB Output is correct
27 Correct 202 ms 1048 KB Output is correct
28 Correct 190 ms 792 KB Output is correct
29 Correct 261 ms 900 KB Output is correct
30 Correct 446 ms 24080 KB Output is correct
31 Correct 201 ms 768 KB Output is correct
32 Correct 422 ms 20984 KB Output is correct
33 Correct 209 ms 968 KB Output is correct
34 Correct 247 ms 904 KB Output is correct
35 Correct 220 ms 1036 KB Output is correct
36 Correct 363 ms 25132 KB Output is correct
37 Correct 382 ms 25212 KB Output is correct
38 Correct 496 ms 49568 KB Output is correct
39 Correct 440 ms 47148 KB Output is correct
40 Correct 242 ms 1196 KB Output is correct

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 252 ms 972 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 373 ms 980 KB Output is correct
4 Correct 453 ms 10132 KB Output is correct
5 Correct 20 ms 948 KB Output is correct
6 Correct 288 ms 2548 KB Output is correct
7 Correct 0 ms 656 KB Output is correct
8 Runtime error 217 ms 564 KB Execution killed with signal 13
9 Halted 0 ms 0 KB -