oj.uz

Submission #828589

# Submission time Handle Problem Language Result Execution time Memory
828589 2023-08-17T12:12:53 Z NoName14159 Two Transportations (JOI19_transportations) C++14
68 / 100
 743 ms 72736 KB 
#include "Azer.h"
#include <stdlib.h>
#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[MAXM];
	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){
		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 <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[MAXM];
	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){
		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 327 ms 24252 KB Output is correct
2 Correct 12 ms 23972 KB Output is correct
3 Correct 373 ms 24344 KB Output is correct
4 Correct 406 ms 33516 KB Output is correct
5 Correct 28 ms 24256 KB Output is correct
6 Correct 365 ms 25864 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23952 KB Output is correct
2 Runtime error 207 ms 12128 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 363 ms 24452 KB Output is correct
2 Correct 12 ms 23952 KB Output is correct
3 Correct 355 ms 24420 KB Output is correct
4 Runtime error 217 ms 12136 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 166 ms 24120 KB Output is correct
2 Correct 209 ms 24112 KB Output is correct
3 Correct 255 ms 36704 KB Output is correct
4 Correct 180 ms 24148 KB Output is correct
5 Correct 261 ms 33492 KB Output is correct
6 Correct 175 ms 24136 KB Output is correct
7 Correct 178 ms 24200 KB Output is correct
8 Correct 124 ms 24208 KB Output is correct
9 Correct 261 ms 42932 KB Output is correct
10 Correct 290 ms 43116 KB Output is correct
11 Correct 397 ms 61724 KB Output is correct
12 Correct 396 ms 59340 KB Output is correct
13 Correct 232 ms 24224 KB Output is correct
14 Correct 16 ms 23952 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 24120 KB Output is correct
2 Correct 209 ms 24112 KB Output is correct
3 Correct 255 ms 36704 KB Output is correct
4 Correct 180 ms 24148 KB Output is correct
5 Correct 261 ms 33492 KB Output is correct
6 Correct 175 ms 24136 KB Output is correct
7 Correct 178 ms 24200 KB Output is correct
8 Correct 124 ms 24208 KB Output is correct
9 Correct 261 ms 42932 KB Output is correct
10 Correct 290 ms 43116 KB Output is correct
11 Correct 397 ms 61724 KB Output is correct
12 Correct 396 ms 59340 KB Output is correct
13 Correct 232 ms 24224 KB Output is correct
14 Correct 16 ms 23952 KB Output is correct
15 Correct 196 ms 24132 KB Output is correct
16 Correct 177 ms 24104 KB Output is correct
17 Correct 168 ms 24104 KB Output is correct
18 Correct 284 ms 33492 KB Output is correct
19 Correct 238 ms 24184 KB Output is correct
20 Correct 312 ms 33660 KB Output is correct
21 Correct 243 ms 24332 KB Output is correct
22 Correct 175 ms 24220 KB Output is correct
23 Correct 359 ms 45760 KB Output is correct
24 Correct 307 ms 46128 KB Output is correct
25 Correct 482 ms 67448 KB Output is correct
26 Correct 448 ms 63988 KB Output is correct
27 Correct 264 ms 24280 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 24120 KB Output is correct
2 Correct 209 ms 24112 KB Output is correct
3 Correct 255 ms 36704 KB Output is correct
4 Correct 180 ms 24148 KB Output is correct
5 Correct 261 ms 33492 KB Output is correct
6 Correct 175 ms 24136 KB Output is correct
7 Correct 178 ms 24200 KB Output is correct
8 Correct 124 ms 24208 KB Output is correct
9 Correct 261 ms 42932 KB Output is correct
10 Correct 290 ms 43116 KB Output is correct
11 Correct 397 ms 61724 KB Output is correct
12 Correct 396 ms 59340 KB Output is correct
13 Correct 232 ms 24224 KB Output is correct
14 Correct 16 ms 23952 KB Output is correct
15 Correct 196 ms 24132 KB Output is correct
16 Correct 177 ms 24104 KB Output is correct
17 Correct 168 ms 24104 KB Output is correct
18 Correct 284 ms 33492 KB Output is correct
19 Correct 238 ms 24184 KB Output is correct
20 Correct 312 ms 33660 KB Output is correct
21 Correct 243 ms 24332 KB Output is correct
22 Correct 175 ms 24220 KB Output is correct
23 Correct 359 ms 45760 KB Output is correct
24 Correct 307 ms 46128 KB Output is correct
25 Correct 482 ms 67448 KB Output is correct
26 Correct 448 ms 63988 KB Output is correct
27 Correct 264 ms 24280 KB Output is correct
28 Correct 321 ms 24296 KB Output is correct
29 Correct 251 ms 24120 KB Output is correct
30 Correct 493 ms 47456 KB Output is correct
31 Correct 213 ms 24136 KB Output is correct
32 Correct 435 ms 44492 KB Output is correct
33 Correct 284 ms 24204 KB Output is correct
34 Correct 199 ms 24264 KB Output is correct
35 Correct 312 ms 24280 KB Output is correct
36 Correct 391 ms 48412 KB Output is correct
37 Correct 422 ms 48460 KB Output is correct
38 Correct 743 ms 72736 KB Output is correct
39 Correct 634 ms 70404 KB Output is correct
40 Correct 264 ms 24360 KB Output is correct

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 327 ms 24252 KB Output is correct
2 Correct 12 ms 23972 KB Output is correct
3 Correct 373 ms 24344 KB Output is correct
4 Correct 406 ms 33516 KB Output is correct
5 Correct 28 ms 24256 KB Output is correct
6 Correct 365 ms 25864 KB Output is correct
7 Correct 12 ms 23952 KB Output is correct
8 Runtime error 207 ms 12128 KB Execution killed with signal 13
9 Halted 0 ms 0 KB -