oj.uz

Submission #826598

# Submission time Handle Problem Language Result Execution time Memory
826598 2023-08-15T17:34:37 Z NoName14159 Two Transportations (JOI19_transportations) C++14
68 / 100
 606 ms 49424 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;
	bool ready;
	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;
				}
			}
		}
		ready=true;
	}
}
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});
	}
	ready=false;
	mode=CL;
	leader=true;
	Do();
}
void ReceiveA(bool x){
	buf[buf_size]=x;
	buf_size++;
	if(buf_size-buf_now>=bits){
		Do();
	}
}
vi Answer(){
	while(!ready){
	}
	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 252 ms 840 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 461 ms 856 KB Output is correct
4 Correct 503 ms 10148 KB Output is correct
5 Correct 23 ms 944 KB Output is correct
6 Correct 439 ms 2472 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 656 KB Output is correct
2 Incorrect 104 ms 452 KB Wrong Answer [2]
3 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 332 ms 848 KB Output is correct
2 Correct 2 ms 656 KB Output is correct
3 Correct 397 ms 824 KB Output is correct
4 Runtime error 242 ms 448 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 144 ms 736 KB Output is correct
2 Correct 164 ms 720 KB Output is correct
3 Correct 317 ms 13196 KB Output is correct
4 Correct 197 ms 796 KB Output is correct
5 Correct 309 ms 10056 KB Output is correct
6 Correct 141 ms 768 KB Output is correct
7 Correct 168 ms 824 KB Output is correct
8 Correct 174 ms 828 KB Output is correct
9 Correct 251 ms 19480 KB Output is correct
10 Correct 228 ms 19544 KB Output is correct
11 Correct 402 ms 38456 KB Output is correct
12 Correct 430 ms 35888 KB Output is correct
13 Correct 224 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 144 ms 736 KB Output is correct
2 Correct 164 ms 720 KB Output is correct
3 Correct 317 ms 13196 KB Output is correct
4 Correct 197 ms 796 KB Output is correct
5 Correct 309 ms 10056 KB Output is correct
6 Correct 141 ms 768 KB Output is correct
7 Correct 168 ms 824 KB Output is correct
8 Correct 174 ms 828 KB Output is correct
9 Correct 251 ms 19480 KB Output is correct
10 Correct 228 ms 19544 KB Output is correct
11 Correct 402 ms 38456 KB Output is correct
12 Correct 430 ms 35888 KB Output is correct
13 Correct 224 ms 852 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 313 ms 756 KB Output is correct
16 Correct 165 ms 752 KB Output is correct
17 Correct 120 ms 752 KB Output is correct
18 Correct 266 ms 10112 KB Output is correct
19 Correct 273 ms 820 KB Output is correct
20 Correct 248 ms 10344 KB Output is correct
21 Correct 241 ms 852 KB Output is correct
22 Correct 172 ms 840 KB Output is correct
23 Correct 358 ms 22432 KB Output is correct
24 Correct 320 ms 22456 KB Output is correct
25 Correct 538 ms 44192 KB Output is correct
26 Correct 470 ms 40452 KB Output is correct
27 Correct 207 ms 900 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 736 KB Output is correct
2 Correct 164 ms 720 KB Output is correct
3 Correct 317 ms 13196 KB Output is correct
4 Correct 197 ms 796 KB Output is correct
5 Correct 309 ms 10056 KB Output is correct
6 Correct 141 ms 768 KB Output is correct
7 Correct 168 ms 824 KB Output is correct
8 Correct 174 ms 828 KB Output is correct
9 Correct 251 ms 19480 KB Output is correct
10 Correct 228 ms 19544 KB Output is correct
11 Correct 402 ms 38456 KB Output is correct
12 Correct 430 ms 35888 KB Output is correct
13 Correct 224 ms 852 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 313 ms 756 KB Output is correct
16 Correct 165 ms 752 KB Output is correct
17 Correct 120 ms 752 KB Output is correct
18 Correct 266 ms 10112 KB Output is correct
19 Correct 273 ms 820 KB Output is correct
20 Correct 248 ms 10344 KB Output is correct
21 Correct 241 ms 852 KB Output is correct
22 Correct 172 ms 840 KB Output is correct
23 Correct 358 ms 22432 KB Output is correct
24 Correct 320 ms 22456 KB Output is correct
25 Correct 538 ms 44192 KB Output is correct
26 Correct 470 ms 40452 KB Output is correct
27 Correct 207 ms 900 KB Output is correct
28 Correct 314 ms 788 KB Output is correct
29 Correct 195 ms 780 KB Output is correct
30 Correct 563 ms 24068 KB Output is correct
31 Correct 249 ms 780 KB Output is correct
32 Correct 450 ms 21052 KB Output is correct
33 Correct 252 ms 848 KB Output is correct
34 Correct 303 ms 896 KB Output is correct
35 Correct 248 ms 916 KB Output is correct
36 Correct 333 ms 24952 KB Output is correct
37 Correct 422 ms 25012 KB Output is correct
38 Correct 606 ms 49424 KB Output is correct
39 Correct 595 ms 47208 KB Output is correct
40 Correct 306 ms 1088 KB Output is correct

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 252 ms 840 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 461 ms 856 KB Output is correct
4 Correct 503 ms 10148 KB Output is correct
5 Correct 23 ms 944 KB Output is correct
6 Correct 439 ms 2472 KB Output is correct
7 Correct 1 ms 656 KB Output is correct
8 Incorrect 104 ms 452 KB Wrong Answer [2]
9 Halted 0 ms 0 KB -