oj.uz

Submission #831522

# Submission time Handle Problem Language Result Execution time Memory
831522 2023-08-20T10:09:09 Z trs4630 Two Transportations (JOI19_transportations) C++14
84 / 100
 588 ms 49464 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
using namespace std;
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;
	bool *visited;
	vpii *e;
	pqpii pq;
	pii rec;
	int rec_other;
	int relax_w=0;
	int relax_v;
	bool *buf;
	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((x&(1<<(bits-1-i)))? true: false);
		}
	}
	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_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,(int)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,(int)rec.second);
						relax_v=rec.second;
						Send(9,(int)rec.first);
						relax_w+=rec.first;
					}else{
						relax_v=Read(11);
						relax_w+=rec_other;
					}
				}else{
					if(winner){
						Send(11,(int)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){
	dis=(int *)malloc(sizeof(int)*MAXN);
	visited=(bool *)malloc(sizeof(bool)*MAXN);
	LOOP(i,MAXN){
		visited[i]=false;
	}
	e=(vpii *)malloc(sizeof(vpii)*MAXN);
	buf=(bool *)malloc(sizeof(bool)*58007);
	srand(200);
	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
using namespace std;
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;
	bool *visited;
	vpii *e;
	pqpii pq;
	pii rec;
	int rec_other;
	int relax_w=0;
	int relax_v;
	bool *buf;
	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((x&(1<<(bits-1-i)))? true: false);
		}
	}
	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_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,(int)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,(int)rec.second);
						relax_v=rec.second;
						Send(9,(int)rec.first);
						relax_w+=rec.first;
					}else{
						relax_v=Read(11);
						relax_w+=rec_other;
					}
				}else{
					if(winner){
						Send(11,(int)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){
	dis=(int *)malloc(sizeof(int)*MAXN);
	visited=(bool *)malloc(sizeof(bool)*MAXN);
	LOOP(i,MAXN){
		visited[i]=false;
	}
	e=(vpii *)malloc(sizeof(vpii)*MAXN);
	buf=(bool *)malloc(sizeof(bool)*58007);
	srand(200);
	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 438 ms 776 KB Output is correct
2 Correct 0 ms 400 KB Output is correct
3 Correct 350 ms 776 KB Output is correct
4 Correct 500 ms 10020 KB Output is correct
5 Correct 17 ms 784 KB Output is correct
6 Correct 338 ms 2624 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 332 ms 972 KB Output is correct
3 Correct 329 ms 900 KB Output is correct
4 Correct 588 ms 27676 KB Output is correct
5 Correct 440 ms 24572 KB Output is correct
6 Correct 96 ms 552 KB Output is correct
7 Correct 566 ms 24684 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 437 ms 832 KB Output is correct
2 Correct 0 ms 400 KB Output is correct
3 Correct 371 ms 888 KB Output is correct
4 Correct 315 ms 876 KB Output is correct
5 Correct 365 ms 860 KB Output is correct
6 Correct 322 ms 936 KB Output is correct
7 Correct 318 ms 920 KB Output is correct
8 Correct 371 ms 804 KB Output is correct
9 Correct 266 ms 780 KB Output is correct
10 Correct 373 ms 792 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 672 KB Output is correct
2 Correct 175 ms 796 KB Output is correct
3 Correct 298 ms 13320 KB Output is correct
4 Correct 114 ms 720 KB Output is correct
5 Correct 255 ms 9988 KB Output is correct
6 Correct 132 ms 700 KB Output is correct
7 Correct 190 ms 880 KB Output is correct
8 Correct 155 ms 756 KB Output is correct
9 Correct 238 ms 19476 KB Output is correct
10 Correct 229 ms 19588 KB Output is correct
11 Correct 391 ms 38324 KB Output is correct
12 Correct 355 ms 36004 KB Output is correct
13 Correct 175 ms 796 KB Output is correct
14 Correct 0 ms 400 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 672 KB Output is correct
2 Correct 175 ms 796 KB Output is correct
3 Correct 298 ms 13320 KB Output is correct
4 Correct 114 ms 720 KB Output is correct
5 Correct 255 ms 9988 KB Output is correct
6 Correct 132 ms 700 KB Output is correct
7 Correct 190 ms 880 KB Output is correct
8 Correct 155 ms 756 KB Output is correct
9 Correct 238 ms 19476 KB Output is correct
10 Correct 229 ms 19588 KB Output is correct
11 Correct 391 ms 38324 KB Output is correct
12 Correct 355 ms 36004 KB Output is correct
13 Correct 175 ms 796 KB Output is correct
14 Correct 0 ms 400 KB Output is correct
15 Correct 226 ms 716 KB Output is correct
16 Correct 153 ms 748 KB Output is correct
17 Correct 220 ms 668 KB Output is correct
18 Correct 245 ms 9992 KB Output is correct
19 Correct 257 ms 748 KB Output is correct
20 Correct 351 ms 10316 KB Output is correct
21 Correct 149 ms 800 KB Output is correct
22 Correct 231 ms 804 KB Output is correct
23 Correct 314 ms 22220 KB Output is correct
24 Correct 317 ms 22324 KB Output is correct
25 Correct 457 ms 44140 KB Output is correct
26 Correct 513 ms 40548 KB Output is correct
27 Correct 264 ms 856 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 672 KB Output is correct
2 Correct 175 ms 796 KB Output is correct
3 Correct 298 ms 13320 KB Output is correct
4 Correct 114 ms 720 KB Output is correct
5 Correct 255 ms 9988 KB Output is correct
6 Correct 132 ms 700 KB Output is correct
7 Correct 190 ms 880 KB Output is correct
8 Correct 155 ms 756 KB Output is correct
9 Correct 238 ms 19476 KB Output is correct
10 Correct 229 ms 19588 KB Output is correct
11 Correct 391 ms 38324 KB Output is correct
12 Correct 355 ms 36004 KB Output is correct
13 Correct 175 ms 796 KB Output is correct
14 Correct 0 ms 400 KB Output is correct
15 Correct 226 ms 716 KB Output is correct
16 Correct 153 ms 748 KB Output is correct
17 Correct 220 ms 668 KB Output is correct
18 Correct 245 ms 9992 KB Output is correct
19 Correct 257 ms 748 KB Output is correct
20 Correct 351 ms 10316 KB Output is correct
21 Correct 149 ms 800 KB Output is correct
22 Correct 231 ms 804 KB Output is correct
23 Correct 314 ms 22220 KB Output is correct
24 Correct 317 ms 22324 KB Output is correct
25 Correct 457 ms 44140 KB Output is correct
26 Correct 513 ms 40548 KB Output is correct
27 Correct 264 ms 856 KB Output is correct
28 Correct 181 ms 764 KB Output is correct
29 Correct 156 ms 732 KB Output is correct
30 Correct 457 ms 24076 KB Output is correct
31 Correct 225 ms 812 KB Output is correct
32 Correct 513 ms 20900 KB Output is correct
33 Correct 297 ms 840 KB Output is correct
34 Correct 227 ms 872 KB Output is correct
35 Correct 129 ms 860 KB Output is correct
36 Correct 416 ms 24884 KB Output is correct
37 Correct 415 ms 25036 KB Output is correct
38 Correct 534 ms 49464 KB Output is correct
39 Correct 556 ms 47064 KB Output is correct
40 Correct 284 ms 992 KB Output is correct

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 438 ms 776 KB Output is correct
2 Correct 0 ms 400 KB Output is correct
3 Correct 350 ms 776 KB Output is correct
4 Correct 500 ms 10020 KB Output is correct
5 Correct 17 ms 784 KB Output is correct
6 Correct 338 ms 2624 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 332 ms 972 KB Output is correct
9 Correct 329 ms 900 KB Output is correct
10 Correct 588 ms 27676 KB Output is correct
11 Correct 440 ms 24572 KB Output is correct
12 Correct 96 ms 552 KB Output is correct
13 Correct 566 ms 24684 KB Output is correct
14 Correct 437 ms 832 KB Output is correct
15 Correct 0 ms 400 KB Output is correct
16 Correct 371 ms 888 KB Output is correct
17 Correct 315 ms 876 KB Output is correct
18 Correct 365 ms 860 KB Output is correct
19 Correct 322 ms 936 KB Output is correct
20 Correct 318 ms 920 KB Output is correct
21 Correct 371 ms 804 KB Output is correct
22 Correct 266 ms 780 KB Output is correct
23 Correct 373 ms 792 KB Output is correct
24 Correct 131 ms 672 KB Output is correct
25 Correct 175 ms 796 KB Output is correct
26 Correct 298 ms 13320 KB Output is correct
27 Correct 114 ms 720 KB Output is correct
28 Correct 255 ms 9988 KB Output is correct
29 Correct 132 ms 700 KB Output is correct
30 Correct 190 ms 880 KB Output is correct
31 Correct 155 ms 756 KB Output is correct
32 Correct 238 ms 19476 KB Output is correct
33 Correct 229 ms 19588 KB Output is correct
34 Correct 391 ms 38324 KB Output is correct
35 Correct 355 ms 36004 KB Output is correct
36 Correct 175 ms 796 KB Output is correct
37 Correct 0 ms 400 KB Output is correct
38 Correct 226 ms 716 KB Output is correct
39 Correct 153 ms 748 KB Output is correct
40 Correct 220 ms 668 KB Output is correct
41 Correct 245 ms 9992 KB Output is correct
42 Correct 257 ms 748 KB Output is correct
43 Correct 351 ms 10316 KB Output is correct
44 Correct 149 ms 800 KB Output is correct
45 Correct 231 ms 804 KB Output is correct
46 Correct 314 ms 22220 KB Output is correct
47 Correct 317 ms 22324 KB Output is correct
48 Correct 457 ms 44140 KB Output is correct
49 Correct 513 ms 40548 KB Output is correct
50 Correct 264 ms 856 KB Output is correct
51 Correct 181 ms 764 KB Output is correct
52 Correct 156 ms 732 KB Output is correct
53 Correct 457 ms 24076 KB Output is correct
54 Correct 225 ms 812 KB Output is correct
55 Correct 513 ms 20900 KB Output is correct
56 Correct 297 ms 840 KB Output is correct
57 Correct 227 ms 872 KB Output is correct
58 Correct 129 ms 860 KB Output is correct
59 Correct 416 ms 24884 KB Output is correct
60 Correct 415 ms 25036 KB Output is correct
61 Correct 534 ms 49464 KB Output is correct
62 Correct 556 ms 47064 KB Output is correct
63 Correct 284 ms 992 KB Output is correct
64 Correct 384 ms 1020 KB Output is correct
65 Runtime error 306 ms 13196 KB Execution killed with signal 13
66 Halted 0 ms 0 KB -