oj.uz

Submission #826672

# Submission time Handle Problem Language Result Execution time Memory
826672 2023-08-15T19:40:52 Z NoName14159 Two Transportations (JOI19_transportations) C++14
68 / 100
 609 ms 49536 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(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){
		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(49);
	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 402 ms 952 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 361 ms 984 KB Output is correct
4 Correct 411 ms 10176 KB Output is correct
5 Correct 21 ms 960 KB Output is correct
6 Correct 334 ms 2620 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 207 ms 436 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 375 ms 964 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 309 ms 824 KB Output is correct
4 Runtime error 181 ms 560 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 142 ms 752 KB Output is correct
2 Correct 118 ms 740 KB Output is correct
3 Correct 257 ms 13192 KB Output is correct
4 Correct 185 ms 800 KB Output is correct
5 Correct 252 ms 10104 KB Output is correct
6 Correct 91 ms 760 KB Output is correct
7 Correct 199 ms 836 KB Output is correct
8 Correct 176 ms 824 KB Output is correct
9 Correct 238 ms 19416 KB Output is correct
10 Correct 249 ms 19624 KB Output is correct
11 Correct 389 ms 38420 KB Output is correct
12 Correct 330 ms 35996 KB Output is correct
13 Correct 126 ms 852 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 142 ms 752 KB Output is correct
2 Correct 118 ms 740 KB Output is correct
3 Correct 257 ms 13192 KB Output is correct
4 Correct 185 ms 800 KB Output is correct
5 Correct 252 ms 10104 KB Output is correct
6 Correct 91 ms 760 KB Output is correct
7 Correct 199 ms 836 KB Output is correct
8 Correct 176 ms 824 KB Output is correct
9 Correct 238 ms 19416 KB Output is correct
10 Correct 249 ms 19624 KB Output is correct
11 Correct 389 ms 38420 KB Output is correct
12 Correct 330 ms 35996 KB Output is correct
13 Correct 126 ms 852 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 198 ms 768 KB Output is correct
16 Correct 163 ms 764 KB Output is correct
17 Correct 200 ms 748 KB Output is correct
18 Correct 307 ms 10020 KB Output is correct
19 Correct 223 ms 812 KB Output is correct
20 Correct 271 ms 10348 KB Output is correct
21 Correct 202 ms 976 KB Output is correct
22 Correct 242 ms 848 KB Output is correct
23 Correct 294 ms 22416 KB Output is correct
24 Correct 336 ms 22576 KB Output is correct
25 Correct 461 ms 44148 KB Output is correct
26 Correct 408 ms 40648 KB Output is correct
27 Correct 186 ms 916 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 142 ms 752 KB Output is correct
2 Correct 118 ms 740 KB Output is correct
3 Correct 257 ms 13192 KB Output is correct
4 Correct 185 ms 800 KB Output is correct
5 Correct 252 ms 10104 KB Output is correct
6 Correct 91 ms 760 KB Output is correct
7 Correct 199 ms 836 KB Output is correct
8 Correct 176 ms 824 KB Output is correct
9 Correct 238 ms 19416 KB Output is correct
10 Correct 249 ms 19624 KB Output is correct
11 Correct 389 ms 38420 KB Output is correct
12 Correct 330 ms 35996 KB Output is correct
13 Correct 126 ms 852 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 198 ms 768 KB Output is correct
16 Correct 163 ms 764 KB Output is correct
17 Correct 200 ms 748 KB Output is correct
18 Correct 307 ms 10020 KB Output is correct
19 Correct 223 ms 812 KB Output is correct
20 Correct 271 ms 10348 KB Output is correct
21 Correct 202 ms 976 KB Output is correct
22 Correct 242 ms 848 KB Output is correct
23 Correct 294 ms 22416 KB Output is correct
24 Correct 336 ms 22576 KB Output is correct
25 Correct 461 ms 44148 KB Output is correct
26 Correct 408 ms 40648 KB Output is correct
27 Correct 186 ms 916 KB Output is correct
28 Correct 250 ms 796 KB Output is correct
29 Correct 243 ms 900 KB Output is correct
30 Correct 420 ms 23948 KB Output is correct
31 Correct 266 ms 688 KB Output is correct
32 Correct 423 ms 21004 KB Output is correct
33 Correct 229 ms 840 KB Output is correct
34 Correct 292 ms 1148 KB Output is correct
35 Correct 231 ms 896 KB Output is correct
36 Correct 383 ms 24968 KB Output is correct
37 Correct 434 ms 25072 KB Output is correct
38 Correct 534 ms 49536 KB Output is correct
39 Correct 609 ms 47100 KB Output is correct
40 Correct 255 ms 1108 KB Output is correct

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 402 ms 952 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 361 ms 984 KB Output is correct
4 Correct 411 ms 10176 KB Output is correct
5 Correct 21 ms 960 KB Output is correct
6 Correct 334 ms 2620 KB Output is correct
7 Correct 0 ms 656 KB Output is correct
8 Runtime error 207 ms 436 KB Execution killed with signal 13
9 Halted 0 ms 0 KB -