oj.uz

답안 #831173

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
831173 2023-08-19T20:54:49 Z NoName14159 Two Transportations (JOI19_transportations) C++17
84 / 100
 569 ms 49404 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)(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){
	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_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)(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){
	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=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

# 결과 실행 시간 메모리 Grader output
1 Correct 331 ms 788 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 361 ms 928 KB Output is correct
4 Correct 478 ms 10236 KB Output is correct
5 Correct 23 ms 944 KB Output is correct
6 Correct 346 ms 2584 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 656 KB Output is correct
2 Correct 302 ms 1100 KB Output is correct
3 Correct 403 ms 892 KB Output is correct
4 Correct 569 ms 27592 KB Output is correct
5 Correct 518 ms 24492 KB Output is correct
6 Correct 69 ms 716 KB Output is correct
7 Correct 484 ms 24568 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 283 ms 924 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 406 ms 796 KB Output is correct
4 Correct 352 ms 1112 KB Output is correct
5 Correct 363 ms 972 KB Output is correct
6 Correct 346 ms 748 KB Output is correct
7 Correct 376 ms 800 KB Output is correct
8 Correct 419 ms 760 KB Output is correct
9 Correct 294 ms 800 KB Output is correct
10 Correct 291 ms 960 KB Output is correct

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 174 ms 720 KB Output is correct
2 Correct 98 ms 708 KB Output is correct
3 Correct 282 ms 13292 KB Output is correct
4 Correct 194 ms 768 KB Output is correct
5 Correct 268 ms 10120 KB Output is correct
6 Correct 167 ms 736 KB Output is correct
7 Correct 177 ms 804 KB Output is correct
8 Correct 148 ms 808 KB Output is correct
9 Correct 272 ms 19432 KB Output is correct
10 Correct 282 ms 19936 KB Output is correct
11 Correct 411 ms 38320 KB Output is correct
12 Correct 306 ms 35872 KB Output is correct
13 Correct 199 ms 832 KB Output is correct
14 Correct 0 ms 656 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 174 ms 720 KB Output is correct
2 Correct 98 ms 708 KB Output is correct
3 Correct 282 ms 13292 KB Output is correct
4 Correct 194 ms 768 KB Output is correct
5 Correct 268 ms 10120 KB Output is correct
6 Correct 167 ms 736 KB Output is correct
7 Correct 177 ms 804 KB Output is correct
8 Correct 148 ms 808 KB Output is correct
9 Correct 272 ms 19432 KB Output is correct
10 Correct 282 ms 19936 KB Output is correct
11 Correct 411 ms 38320 KB Output is correct
12 Correct 306 ms 35872 KB Output is correct
13 Correct 199 ms 832 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 169 ms 724 KB Output is correct
16 Correct 164 ms 720 KB Output is correct
17 Correct 182 ms 732 KB Output is correct
18 Correct 313 ms 10112 KB Output is correct
19 Correct 211 ms 732 KB Output is correct
20 Correct 250 ms 10356 KB Output is correct
21 Correct 224 ms 940 KB Output is correct
22 Correct 207 ms 836 KB Output is correct
23 Correct 336 ms 22420 KB Output is correct
24 Correct 271 ms 22520 KB Output is correct
25 Correct 463 ms 44120 KB Output is correct
26 Correct 392 ms 40524 KB Output is correct
27 Correct 206 ms 980 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 174 ms 720 KB Output is correct
2 Correct 98 ms 708 KB Output is correct
3 Correct 282 ms 13292 KB Output is correct
4 Correct 194 ms 768 KB Output is correct
5 Correct 268 ms 10120 KB Output is correct
6 Correct 167 ms 736 KB Output is correct
7 Correct 177 ms 804 KB Output is correct
8 Correct 148 ms 808 KB Output is correct
9 Correct 272 ms 19432 KB Output is correct
10 Correct 282 ms 19936 KB Output is correct
11 Correct 411 ms 38320 KB Output is correct
12 Correct 306 ms 35872 KB Output is correct
13 Correct 199 ms 832 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 169 ms 724 KB Output is correct
16 Correct 164 ms 720 KB Output is correct
17 Correct 182 ms 732 KB Output is correct
18 Correct 313 ms 10112 KB Output is correct
19 Correct 211 ms 732 KB Output is correct
20 Correct 250 ms 10356 KB Output is correct
21 Correct 224 ms 940 KB Output is correct
22 Correct 207 ms 836 KB Output is correct
23 Correct 336 ms 22420 KB Output is correct
24 Correct 271 ms 22520 KB Output is correct
25 Correct 463 ms 44120 KB Output is correct
26 Correct 392 ms 40524 KB Output is correct
27 Correct 206 ms 980 KB Output is correct
28 Correct 260 ms 776 KB Output is correct
29 Correct 239 ms 756 KB Output is correct
30 Correct 486 ms 24080 KB Output is correct
31 Correct 234 ms 744 KB Output is correct
32 Correct 395 ms 21048 KB Output is correct
33 Correct 264 ms 944 KB Output is correct
34 Correct 243 ms 876 KB Output is correct
35 Correct 293 ms 856 KB Output is correct
36 Correct 366 ms 25104 KB Output is correct
37 Correct 406 ms 25044 KB Output is correct
38 Correct 547 ms 49404 KB Output is correct
39 Correct 473 ms 46908 KB Output is correct
40 Correct 285 ms 1068 KB Output is correct

Subtask #7
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 331 ms 788 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 361 ms 928 KB Output is correct
4 Correct 478 ms 10236 KB Output is correct
5 Correct 23 ms 944 KB Output is correct
6 Correct 346 ms 2584 KB Output is correct
7 Correct 0 ms 656 KB Output is correct
8 Correct 302 ms 1100 KB Output is correct
9 Correct 403 ms 892 KB Output is correct
10 Correct 569 ms 27592 KB Output is correct
11 Correct 518 ms 24492 KB Output is correct
12 Correct 69 ms 716 KB Output is correct
13 Correct 484 ms 24568 KB Output is correct
14 Correct 283 ms 924 KB Output is correct
15 Correct 0 ms 656 KB Output is correct
16 Correct 406 ms 796 KB Output is correct
17 Correct 352 ms 1112 KB Output is correct
18 Correct 363 ms 972 KB Output is correct
19 Correct 346 ms 748 KB Output is correct
20 Correct 376 ms 800 KB Output is correct
21 Correct 419 ms 760 KB Output is correct
22 Correct 294 ms 800 KB Output is correct
23 Correct 291 ms 960 KB Output is correct
24 Correct 174 ms 720 KB Output is correct
25 Correct 98 ms 708 KB Output is correct
26 Correct 282 ms 13292 KB Output is correct
27 Correct 194 ms 768 KB Output is correct
28 Correct 268 ms 10120 KB Output is correct
29 Correct 167 ms 736 KB Output is correct
30 Correct 177 ms 804 KB Output is correct
31 Correct 148 ms 808 KB Output is correct
32 Correct 272 ms 19432 KB Output is correct
33 Correct 282 ms 19936 KB Output is correct
34 Correct 411 ms 38320 KB Output is correct
35 Correct 306 ms 35872 KB Output is correct
36 Correct 199 ms 832 KB Output is correct
37 Correct 0 ms 656 KB Output is correct
38 Correct 169 ms 724 KB Output is correct
39 Correct 164 ms 720 KB Output is correct
40 Correct 182 ms 732 KB Output is correct
41 Correct 313 ms 10112 KB Output is correct
42 Correct 211 ms 732 KB Output is correct
43 Correct 250 ms 10356 KB Output is correct
44 Correct 224 ms 940 KB Output is correct
45 Correct 207 ms 836 KB Output is correct
46 Correct 336 ms 22420 KB Output is correct
47 Correct 271 ms 22520 KB Output is correct
48 Correct 463 ms 44120 KB Output is correct
49 Correct 392 ms 40524 KB Output is correct
50 Correct 206 ms 980 KB Output is correct
51 Correct 260 ms 776 KB Output is correct
52 Correct 239 ms 756 KB Output is correct
53 Correct 486 ms 24080 KB Output is correct
54 Correct 234 ms 744 KB Output is correct
55 Correct 395 ms 21048 KB Output is correct
56 Correct 264 ms 944 KB Output is correct
57 Correct 243 ms 876 KB Output is correct
58 Correct 293 ms 856 KB Output is correct
59 Correct 366 ms 25104 KB Output is correct
60 Correct 406 ms 25044 KB Output is correct
61 Correct 547 ms 49404 KB Output is correct
62 Correct 473 ms 46908 KB Output is correct
63 Correct 285 ms 1068 KB Output is correct
64 Correct 429 ms 1020 KB Output is correct
65 Runtime error 251 ms 13248 KB Execution killed with signal 13
66 Halted 0 ms 0 KB -