oj.uz

Submission #831704

# Submission time Handle Problem Language Result Execution time Memory
831704 2023-08-20T12:31:41 Z NoName14159 Two Transportations (JOI19_transportations) C++17
84 / 100
 617 ms 49248 KB 
#include "Azer.h"
#include <stdlib.h>
#include <cassert>
#include <queue>
#define MAXN 2007
#define MAXM 500007
#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[58007];
	int buf_size=0;
	int buf_now=0;
	int t=0;
	int bits_next;
//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)(std::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_next=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_next=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_next=11;
					}else{
						bits_next=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_next=1;
					return;
				}
			}
		}
	}
}
void InitA(int N,int A,vi U,vi V,vi C){
	std::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_next){
		Do();
	}
}
vi Answer(){
	vi ans;
	LOOP(i,n){
		ans.pub(dis[i]);
	}
	return ans;
}

#include "Baijan.h"
#include <stdlib.h>
#include <cassert>
#include <queue>
#define MAXN 2007
#define MAXM 500007
#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[58007];
	int buf_size=0;
	int buf_now=0;
	int t=0;
	int bits_next;
//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)(std::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_next=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_next=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_next=11;
					}else{
						bits_next=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_next=1;
					return;
				}
			}
		}
	}
}
void InitB(int N,int A,vi U,vi V,vi C){
	std::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=false;
	bits_next=1;
}
void ReceiveB(bool x){
	buf[buf_size]=x;
	buf_size++;
	if(buf_size-buf_now==bits_next){
		Do();
	}
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 392 ms 936 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 353 ms 1064 KB Output is correct
4 Correct 416 ms 10204 KB Output is correct
5 Correct 24 ms 976 KB Output is correct
6 Correct 345 ms 2640 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 656 KB Output is correct
2 Correct 389 ms 844 KB Output is correct
3 Correct 356 ms 1144 KB Output is correct
4 Correct 514 ms 27576 KB Output is correct
5 Correct 492 ms 24444 KB Output is correct
6 Correct 81 ms 708 KB Output is correct
7 Correct 450 ms 24728 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 364 ms 820 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 308 ms 908 KB Output is correct
4 Correct 361 ms 904 KB Output is correct
5 Correct 344 ms 1092 KB Output is correct
6 Correct 455 ms 952 KB Output is correct
7 Correct 436 ms 1028 KB Output is correct
8 Correct 447 ms 940 KB Output is correct
9 Correct 344 ms 892 KB Output is correct
10 Correct 351 ms 1052 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 180 ms 684 KB Output is correct
2 Correct 125 ms 708 KB Output is correct
3 Correct 245 ms 13308 KB Output is correct
4 Correct 187 ms 824 KB Output is correct
5 Correct 268 ms 10112 KB Output is correct
6 Correct 156 ms 744 KB Output is correct
7 Correct 124 ms 812 KB Output is correct
8 Correct 185 ms 792 KB Output is correct
9 Correct 280 ms 19560 KB Output is correct
10 Correct 260 ms 19676 KB Output is correct
11 Correct 368 ms 38392 KB Output is correct
12 Correct 374 ms 36028 KB Output is correct
13 Correct 187 ms 828 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 180 ms 684 KB Output is correct
2 Correct 125 ms 708 KB Output is correct
3 Correct 245 ms 13308 KB Output is correct
4 Correct 187 ms 824 KB Output is correct
5 Correct 268 ms 10112 KB Output is correct
6 Correct 156 ms 744 KB Output is correct
7 Correct 124 ms 812 KB Output is correct
8 Correct 185 ms 792 KB Output is correct
9 Correct 280 ms 19560 KB Output is correct
10 Correct 260 ms 19676 KB Output is correct
11 Correct 368 ms 38392 KB Output is correct
12 Correct 374 ms 36028 KB Output is correct
13 Correct 187 ms 828 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 201 ms 728 KB Output is correct
16 Correct 225 ms 728 KB Output is correct
17 Correct 168 ms 728 KB Output is correct
18 Correct 259 ms 10020 KB Output is correct
19 Correct 239 ms 788 KB Output is correct
20 Correct 314 ms 10316 KB Output is correct
21 Correct 158 ms 828 KB Output is correct
22 Correct 192 ms 828 KB Output is correct
23 Correct 349 ms 22452 KB Output is correct
24 Correct 362 ms 22472 KB Output is correct
25 Correct 469 ms 44168 KB Output is correct
26 Correct 463 ms 40528 KB Output is correct
27 Correct 272 ms 892 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 180 ms 684 KB Output is correct
2 Correct 125 ms 708 KB Output is correct
3 Correct 245 ms 13308 KB Output is correct
4 Correct 187 ms 824 KB Output is correct
5 Correct 268 ms 10112 KB Output is correct
6 Correct 156 ms 744 KB Output is correct
7 Correct 124 ms 812 KB Output is correct
8 Correct 185 ms 792 KB Output is correct
9 Correct 280 ms 19560 KB Output is correct
10 Correct 260 ms 19676 KB Output is correct
11 Correct 368 ms 38392 KB Output is correct
12 Correct 374 ms 36028 KB Output is correct
13 Correct 187 ms 828 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 201 ms 728 KB Output is correct
16 Correct 225 ms 728 KB Output is correct
17 Correct 168 ms 728 KB Output is correct
18 Correct 259 ms 10020 KB Output is correct
19 Correct 239 ms 788 KB Output is correct
20 Correct 314 ms 10316 KB Output is correct
21 Correct 158 ms 828 KB Output is correct
22 Correct 192 ms 828 KB Output is correct
23 Correct 349 ms 22452 KB Output is correct
24 Correct 362 ms 22472 KB Output is correct
25 Correct 469 ms 44168 KB Output is correct
26 Correct 463 ms 40528 KB Output is correct
27 Correct 272 ms 892 KB Output is correct
28 Correct 286 ms 768 KB Output is correct
29 Correct 307 ms 736 KB Output is correct
30 Correct 472 ms 24108 KB Output is correct
31 Correct 295 ms 752 KB Output is correct
32 Correct 443 ms 21032 KB Output is correct
33 Correct 237 ms 824 KB Output is correct
34 Correct 170 ms 884 KB Output is correct
35 Correct 185 ms 908 KB Output is correct
36 Correct 381 ms 25192 KB Output is correct
37 Correct 454 ms 24992 KB Output is correct
38 Correct 617 ms 49248 KB Output is correct
39 Correct 516 ms 47028 KB Output is correct
40 Correct 281 ms 964 KB Output is correct

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 392 ms 936 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 353 ms 1064 KB Output is correct
4 Correct 416 ms 10204 KB Output is correct
5 Correct 24 ms 976 KB Output is correct
6 Correct 345 ms 2640 KB Output is correct
7 Correct 0 ms 656 KB Output is correct
8 Correct 389 ms 844 KB Output is correct
9 Correct 356 ms 1144 KB Output is correct
10 Correct 514 ms 27576 KB Output is correct
11 Correct 492 ms 24444 KB Output is correct
12 Correct 81 ms 708 KB Output is correct
13 Correct 450 ms 24728 KB Output is correct
14 Correct 364 ms 820 KB Output is correct
15 Correct 0 ms 656 KB Output is correct
16 Correct 308 ms 908 KB Output is correct
17 Correct 361 ms 904 KB Output is correct
18 Correct 344 ms 1092 KB Output is correct
19 Correct 455 ms 952 KB Output is correct
20 Correct 436 ms 1028 KB Output is correct
21 Correct 447 ms 940 KB Output is correct
22 Correct 344 ms 892 KB Output is correct
23 Correct 351 ms 1052 KB Output is correct
24 Correct 180 ms 684 KB Output is correct
25 Correct 125 ms 708 KB Output is correct
26 Correct 245 ms 13308 KB Output is correct
27 Correct 187 ms 824 KB Output is correct
28 Correct 268 ms 10112 KB Output is correct
29 Correct 156 ms 744 KB Output is correct
30 Correct 124 ms 812 KB Output is correct
31 Correct 185 ms 792 KB Output is correct
32 Correct 280 ms 19560 KB Output is correct
33 Correct 260 ms 19676 KB Output is correct
34 Correct 368 ms 38392 KB Output is correct
35 Correct 374 ms 36028 KB Output is correct
36 Correct 187 ms 828 KB Output is correct
37 Correct 0 ms 656 KB Output is correct
38 Correct 201 ms 728 KB Output is correct
39 Correct 225 ms 728 KB Output is correct
40 Correct 168 ms 728 KB Output is correct
41 Correct 259 ms 10020 KB Output is correct
42 Correct 239 ms 788 KB Output is correct
43 Correct 314 ms 10316 KB Output is correct
44 Correct 158 ms 828 KB Output is correct
45 Correct 192 ms 828 KB Output is correct
46 Correct 349 ms 22452 KB Output is correct
47 Correct 362 ms 22472 KB Output is correct
48 Correct 469 ms 44168 KB Output is correct
49 Correct 463 ms 40528 KB Output is correct
50 Correct 272 ms 892 KB Output is correct
51 Correct 286 ms 768 KB Output is correct
52 Correct 307 ms 736 KB Output is correct
53 Correct 472 ms 24108 KB Output is correct
54 Correct 295 ms 752 KB Output is correct
55 Correct 443 ms 21032 KB Output is correct
56 Correct 237 ms 824 KB Output is correct
57 Correct 170 ms 884 KB Output is correct
58 Correct 185 ms 908 KB Output is correct
59 Correct 381 ms 25192 KB Output is correct
60 Correct 454 ms 24992 KB Output is correct
61 Correct 617 ms 49248 KB Output is correct
62 Correct 516 ms 47028 KB Output is correct
63 Correct 281 ms 964 KB Output is correct
64 Correct 247 ms 1016 KB Output is correct
65 Runtime error 251 ms 13248 KB Execution killed with signal 13
66 Halted 0 ms 0 KB -