oj.uz

Submission #828520

# Submission time Handle Problem Language Result Execution time Memory
828520 2023-08-17T10:43:42 Z NoName14159 Two Transportations (JOI19_transportations) C++14
68 / 100
 593 ms 49388 KB 
#include "Azer.h"
#include <stdlib.h>
#include <iostream>
#include <cassert>
#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 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=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{
						int temp=Read(20);
						relax_v=temp>>9;
						relax_w+=temp&((1<<9)-1);
					}
				}
			}
			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 <cassert>
#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 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=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{
						int temp=Read(20);
						relax_v=temp>>9;
						relax_w+=temp&((1<<9)-1);
					}
				}
			}
			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 379 ms 832 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 337 ms 1112 KB Output is correct
4 Correct 441 ms 10164 KB Output is correct
5 Correct 28 ms 932 KB Output is correct
6 Correct 411 ms 2668 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 231 ms 452 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 340 ms 852 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 408 ms 928 KB Output is correct
4 Runtime error 210 ms 556 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 178 ms 988 KB Output is correct
2 Correct 133 ms 720 KB Output is correct
3 Correct 263 ms 13204 KB Output is correct
4 Correct 110 ms 800 KB Output is correct
5 Correct 290 ms 10120 KB Output is correct
6 Correct 132 ms 768 KB Output is correct
7 Correct 176 ms 816 KB Output is correct
8 Correct 130 ms 820 KB Output is correct
9 Correct 279 ms 19516 KB Output is correct
10 Correct 302 ms 19552 KB Output is correct
11 Correct 408 ms 38456 KB Output is correct
12 Correct 355 ms 35988 KB Output is correct
13 Correct 146 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 178 ms 988 KB Output is correct
2 Correct 133 ms 720 KB Output is correct
3 Correct 263 ms 13204 KB Output is correct
4 Correct 110 ms 800 KB Output is correct
5 Correct 290 ms 10120 KB Output is correct
6 Correct 132 ms 768 KB Output is correct
7 Correct 176 ms 816 KB Output is correct
8 Correct 130 ms 820 KB Output is correct
9 Correct 279 ms 19516 KB Output is correct
10 Correct 302 ms 19552 KB Output is correct
11 Correct 408 ms 38456 KB Output is correct
12 Correct 355 ms 35988 KB Output is correct
13 Correct 146 ms 856 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 183 ms 768 KB Output is correct
16 Correct 200 ms 756 KB Output is correct
17 Correct 219 ms 752 KB Output is correct
18 Correct 241 ms 10036 KB Output is correct
19 Correct 243 ms 812 KB Output is correct
20 Correct 229 ms 10296 KB Output is correct
21 Correct 159 ms 852 KB Output is correct
22 Correct 217 ms 852 KB Output is correct
23 Correct 379 ms 22448 KB Output is correct
24 Correct 310 ms 22476 KB Output is correct
25 Correct 533 ms 44204 KB Output is correct
26 Correct 409 ms 40496 KB Output is correct
27 Correct 267 ms 912 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 178 ms 988 KB Output is correct
2 Correct 133 ms 720 KB Output is correct
3 Correct 263 ms 13204 KB Output is correct
4 Correct 110 ms 800 KB Output is correct
5 Correct 290 ms 10120 KB Output is correct
6 Correct 132 ms 768 KB Output is correct
7 Correct 176 ms 816 KB Output is correct
8 Correct 130 ms 820 KB Output is correct
9 Correct 279 ms 19516 KB Output is correct
10 Correct 302 ms 19552 KB Output is correct
11 Correct 408 ms 38456 KB Output is correct
12 Correct 355 ms 35988 KB Output is correct
13 Correct 146 ms 856 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 183 ms 768 KB Output is correct
16 Correct 200 ms 756 KB Output is correct
17 Correct 219 ms 752 KB Output is correct
18 Correct 241 ms 10036 KB Output is correct
19 Correct 243 ms 812 KB Output is correct
20 Correct 229 ms 10296 KB Output is correct
21 Correct 159 ms 852 KB Output is correct
22 Correct 217 ms 852 KB Output is correct
23 Correct 379 ms 22448 KB Output is correct
24 Correct 310 ms 22476 KB Output is correct
25 Correct 533 ms 44204 KB Output is correct
26 Correct 409 ms 40496 KB Output is correct
27 Correct 267 ms 912 KB Output is correct
28 Correct 290 ms 792 KB Output is correct
29 Correct 139 ms 760 KB Output is correct
30 Correct 464 ms 24080 KB Output is correct
31 Correct 264 ms 772 KB Output is correct
32 Correct 389 ms 21028 KB Output is correct
33 Correct 251 ms 844 KB Output is correct
34 Correct 267 ms 904 KB Output is correct
35 Correct 214 ms 912 KB Output is correct
36 Correct 459 ms 25064 KB Output is correct
37 Correct 447 ms 24992 KB Output is correct
38 Correct 593 ms 49388 KB Output is correct
39 Correct 509 ms 47168 KB Output is correct
40 Correct 303 ms 968 KB Output is correct

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 379 ms 832 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 337 ms 1112 KB Output is correct
4 Correct 441 ms 10164 KB Output is correct
5 Correct 28 ms 932 KB Output is correct
6 Correct 411 ms 2668 KB Output is correct
7 Correct 0 ms 656 KB Output is correct
8 Runtime error 231 ms 452 KB Execution killed with signal 13
9 Halted 0 ms 0 KB -