oj.uz

답안 #831772

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
831772 2023-08-20T14:16:19 Z NoName14159 Two Transportations (JOI19_transportations) C++17
84 / 100
 583 ms 49316 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=true;//(bool)(std::rand()%2);
					Send(1,(int)new_leader);
assert((int)new_leader==0||(int)new_leader==1);
					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);
assert(rec.first>=0&&rec.first<=511);
					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);
assert(rec.second>=0&&rec.second<n);
						relax_v=rec.second;
						Send(9,rec.first);
assert(rec.first>=0&&rec.first<=500);
						relax_w+=rec.first;
					}else{
						relax_v=Read(11);
						relax_w+=rec_other;
					}
				}else{
					if(winner){
						Send(11,rec.second);
assert(rec.second>=0&&rec.second<n);
						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 B,vi S,vi T,vi D){
	std::srand(7749);
	n=N;
	LOOP(i,B){
		e[S[i]].pub({T[i],D[i]});
		e[T[i]].pub({S[i],D[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 340 ms 928 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 335 ms 948 KB Output is correct
4 Correct 405 ms 10144 KB Output is correct
5 Correct 20 ms 972 KB Output is correct
6 Correct 251 ms 2540 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 656 KB Output is correct
2 Correct 351 ms 960 KB Output is correct
3 Correct 326 ms 1028 KB Output is correct
4 Correct 576 ms 27708 KB Output is correct
5 Correct 420 ms 24412 KB Output is correct
6 Correct 53 ms 720 KB Output is correct
7 Correct 423 ms 24572 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 414 ms 824 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 387 ms 1024 KB Output is correct
4 Correct 345 ms 848 KB Output is correct
5 Correct 322 ms 980 KB Output is correct
6 Correct 350 ms 948 KB Output is correct
7 Correct 415 ms 776 KB Output is correct
8 Correct 347 ms 792 KB Output is correct
9 Correct 338 ms 804 KB Output is correct
10 Correct 320 ms 824 KB Output is correct

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 152 ms 728 KB Output is correct
2 Correct 198 ms 716 KB Output is correct
3 Correct 256 ms 13308 KB Output is correct
4 Correct 148 ms 724 KB Output is correct
5 Correct 255 ms 10120 KB Output is correct
6 Correct 141 ms 892 KB Output is correct
7 Correct 157 ms 804 KB Output is correct
8 Correct 140 ms 792 KB Output is correct
9 Correct 267 ms 19484 KB Output is correct
10 Correct 285 ms 19644 KB Output is correct
11 Correct 395 ms 38308 KB Output is correct
12 Correct 331 ms 36044 KB Output is correct
13 Correct 154 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 152 ms 728 KB Output is correct
2 Correct 198 ms 716 KB Output is correct
3 Correct 256 ms 13308 KB Output is correct
4 Correct 148 ms 724 KB Output is correct
5 Correct 255 ms 10120 KB Output is correct
6 Correct 141 ms 892 KB Output is correct
7 Correct 157 ms 804 KB Output is correct
8 Correct 140 ms 792 KB Output is correct
9 Correct 267 ms 19484 KB Output is correct
10 Correct 285 ms 19644 KB Output is correct
11 Correct 395 ms 38308 KB Output is correct
12 Correct 331 ms 36044 KB Output is correct
13 Correct 154 ms 832 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 211 ms 744 KB Output is correct
16 Correct 198 ms 848 KB Output is correct
17 Correct 170 ms 716 KB Output is correct
18 Correct 292 ms 10008 KB Output is correct
19 Correct 203 ms 788 KB Output is correct
20 Correct 283 ms 10296 KB Output is correct
21 Correct 189 ms 952 KB Output is correct
22 Correct 214 ms 824 KB Output is correct
23 Correct 325 ms 22416 KB Output is correct
24 Correct 411 ms 22504 KB Output is correct
25 Correct 469 ms 44120 KB Output is correct
26 Correct 394 ms 40544 KB Output is correct
27 Correct 179 ms 896 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 152 ms 728 KB Output is correct
2 Correct 198 ms 716 KB Output is correct
3 Correct 256 ms 13308 KB Output is correct
4 Correct 148 ms 724 KB Output is correct
5 Correct 255 ms 10120 KB Output is correct
6 Correct 141 ms 892 KB Output is correct
7 Correct 157 ms 804 KB Output is correct
8 Correct 140 ms 792 KB Output is correct
9 Correct 267 ms 19484 KB Output is correct
10 Correct 285 ms 19644 KB Output is correct
11 Correct 395 ms 38308 KB Output is correct
12 Correct 331 ms 36044 KB Output is correct
13 Correct 154 ms 832 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 211 ms 744 KB Output is correct
16 Correct 198 ms 848 KB Output is correct
17 Correct 170 ms 716 KB Output is correct
18 Correct 292 ms 10008 KB Output is correct
19 Correct 203 ms 788 KB Output is correct
20 Correct 283 ms 10296 KB Output is correct
21 Correct 189 ms 952 KB Output is correct
22 Correct 214 ms 824 KB Output is correct
23 Correct 325 ms 22416 KB Output is correct
24 Correct 411 ms 22504 KB Output is correct
25 Correct 469 ms 44120 KB Output is correct
26 Correct 394 ms 40544 KB Output is correct
27 Correct 179 ms 896 KB Output is correct
28 Correct 249 ms 896 KB Output is correct
29 Correct 216 ms 736 KB Output is correct
30 Correct 412 ms 24112 KB Output is correct
31 Correct 251 ms 724 KB Output is correct
32 Correct 368 ms 21116 KB Output is correct
33 Correct 301 ms 824 KB Output is correct
34 Correct 248 ms 880 KB Output is correct
35 Correct 254 ms 888 KB Output is correct
36 Correct 436 ms 25032 KB Output is correct
37 Correct 476 ms 24984 KB Output is correct
38 Correct 583 ms 49316 KB Output is correct
39 Correct 576 ms 47048 KB Output is correct
40 Correct 311 ms 940 KB Output is correct

Subtask #7
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 340 ms 928 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 335 ms 948 KB Output is correct
4 Correct 405 ms 10144 KB Output is correct
5 Correct 20 ms 972 KB Output is correct
6 Correct 251 ms 2540 KB Output is correct
7 Correct 0 ms 656 KB Output is correct
8 Correct 351 ms 960 KB Output is correct
9 Correct 326 ms 1028 KB Output is correct
10 Correct 576 ms 27708 KB Output is correct
11 Correct 420 ms 24412 KB Output is correct
12 Correct 53 ms 720 KB Output is correct
13 Correct 423 ms 24572 KB Output is correct
14 Correct 414 ms 824 KB Output is correct
15 Correct 0 ms 656 KB Output is correct
16 Correct 387 ms 1024 KB Output is correct
17 Correct 345 ms 848 KB Output is correct
18 Correct 322 ms 980 KB Output is correct
19 Correct 350 ms 948 KB Output is correct
20 Correct 415 ms 776 KB Output is correct
21 Correct 347 ms 792 KB Output is correct
22 Correct 338 ms 804 KB Output is correct
23 Correct 320 ms 824 KB Output is correct
24 Correct 152 ms 728 KB Output is correct
25 Correct 198 ms 716 KB Output is correct
26 Correct 256 ms 13308 KB Output is correct
27 Correct 148 ms 724 KB Output is correct
28 Correct 255 ms 10120 KB Output is correct
29 Correct 141 ms 892 KB Output is correct
30 Correct 157 ms 804 KB Output is correct
31 Correct 140 ms 792 KB Output is correct
32 Correct 267 ms 19484 KB Output is correct
33 Correct 285 ms 19644 KB Output is correct
34 Correct 395 ms 38308 KB Output is correct
35 Correct 331 ms 36044 KB Output is correct
36 Correct 154 ms 832 KB Output is correct
37 Correct 0 ms 656 KB Output is correct
38 Correct 211 ms 744 KB Output is correct
39 Correct 198 ms 848 KB Output is correct
40 Correct 170 ms 716 KB Output is correct
41 Correct 292 ms 10008 KB Output is correct
42 Correct 203 ms 788 KB Output is correct
43 Correct 283 ms 10296 KB Output is correct
44 Correct 189 ms 952 KB Output is correct
45 Correct 214 ms 824 KB Output is correct
46 Correct 325 ms 22416 KB Output is correct
47 Correct 411 ms 22504 KB Output is correct
48 Correct 469 ms 44120 KB Output is correct
49 Correct 394 ms 40544 KB Output is correct
50 Correct 179 ms 896 KB Output is correct
51 Correct 249 ms 896 KB Output is correct
52 Correct 216 ms 736 KB Output is correct
53 Correct 412 ms 24112 KB Output is correct
54 Correct 251 ms 724 KB Output is correct
55 Correct 368 ms 21116 KB Output is correct
56 Correct 301 ms 824 KB Output is correct
57 Correct 248 ms 880 KB Output is correct
58 Correct 254 ms 888 KB Output is correct
59 Correct 436 ms 25032 KB Output is correct
60 Correct 476 ms 24984 KB Output is correct
61 Correct 583 ms 49316 KB Output is correct
62 Correct 576 ms 47048 KB Output is correct
63 Correct 311 ms 940 KB Output is correct
64 Correct 353 ms 996 KB Output is correct
65 Runtime error 301 ms 13188 KB Execution killed with signal 13
66 Halted 0 ms 0 KB -