oj.uz

답안 #831363

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
831363 2023-08-20T07:03:10 Z NoName14159 Two Transportations (JOI19_transportations) C++17
84 / 100
 566 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
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;
					}
if(winner){
	assert(rec.first!=-511);
}else{
	assert(rec_other!=-511);
}
				}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;
					}
if(winner){
	assert(rec.first!=-511);
}else{
	assert(rec_other!=-511);
}
				}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 391 ms 844 KB Output is correct
2 Correct 1 ms 656 KB Output is correct
3 Correct 383 ms 824 KB Output is correct
4 Correct 473 ms 10140 KB Output is correct
5 Correct 16 ms 936 KB Output is correct
6 Correct 367 ms 2580 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 656 KB Output is correct
2 Correct 336 ms 856 KB Output is correct
3 Correct 383 ms 880 KB Output is correct
4 Correct 542 ms 27616 KB Output is correct
5 Correct 507 ms 24528 KB Output is correct
6 Correct 40 ms 668 KB Output is correct
7 Correct 411 ms 24796 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 305 ms 820 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 318 ms 788 KB Output is correct
4 Correct 347 ms 864 KB Output is correct
5 Correct 334 ms 960 KB Output is correct
6 Correct 339 ms 824 KB Output is correct
7 Correct 351 ms 800 KB Output is correct
8 Correct 397 ms 924 KB Output is correct
9 Correct 362 ms 800 KB Output is correct
10 Correct 373 ms 832 KB Output is correct

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 186 ms 724 KB Output is correct
2 Correct 160 ms 820 KB Output is correct
3 Correct 240 ms 13392 KB Output is correct
4 Correct 176 ms 952 KB Output is correct
5 Correct 259 ms 10068 KB Output is correct
6 Correct 180 ms 752 KB Output is correct
7 Correct 181 ms 804 KB Output is correct
8 Correct 184 ms 804 KB Output is correct
9 Correct 213 ms 19644 KB Output is correct
10 Correct 241 ms 19592 KB Output is correct
11 Correct 366 ms 38476 KB Output is correct
12 Correct 334 ms 36028 KB Output is correct
13 Correct 150 ms 840 KB Output is correct
14 Correct 0 ms 656 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 186 ms 724 KB Output is correct
2 Correct 160 ms 820 KB Output is correct
3 Correct 240 ms 13392 KB Output is correct
4 Correct 176 ms 952 KB Output is correct
5 Correct 259 ms 10068 KB Output is correct
6 Correct 180 ms 752 KB Output is correct
7 Correct 181 ms 804 KB Output is correct
8 Correct 184 ms 804 KB Output is correct
9 Correct 213 ms 19644 KB Output is correct
10 Correct 241 ms 19592 KB Output is correct
11 Correct 366 ms 38476 KB Output is correct
12 Correct 334 ms 36028 KB Output is correct
13 Correct 150 ms 840 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 191 ms 740 KB Output is correct
16 Correct 187 ms 852 KB Output is correct
17 Correct 199 ms 716 KB Output is correct
18 Correct 266 ms 10020 KB Output is correct
19 Correct 222 ms 792 KB Output is correct
20 Correct 271 ms 10356 KB Output is correct
21 Correct 189 ms 816 KB Output is correct
22 Correct 158 ms 768 KB Output is correct
23 Correct 374 ms 22524 KB Output is correct
24 Correct 316 ms 22412 KB Output is correct
25 Correct 513 ms 44212 KB Output is correct
26 Correct 384 ms 40728 KB Output is correct
27 Correct 143 ms 864 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 186 ms 724 KB Output is correct
2 Correct 160 ms 820 KB Output is correct
3 Correct 240 ms 13392 KB Output is correct
4 Correct 176 ms 952 KB Output is correct
5 Correct 259 ms 10068 KB Output is correct
6 Correct 180 ms 752 KB Output is correct
7 Correct 181 ms 804 KB Output is correct
8 Correct 184 ms 804 KB Output is correct
9 Correct 213 ms 19644 KB Output is correct
10 Correct 241 ms 19592 KB Output is correct
11 Correct 366 ms 38476 KB Output is correct
12 Correct 334 ms 36028 KB Output is correct
13 Correct 150 ms 840 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 191 ms 740 KB Output is correct
16 Correct 187 ms 852 KB Output is correct
17 Correct 199 ms 716 KB Output is correct
18 Correct 266 ms 10020 KB Output is correct
19 Correct 222 ms 792 KB Output is correct
20 Correct 271 ms 10356 KB Output is correct
21 Correct 189 ms 816 KB Output is correct
22 Correct 158 ms 768 KB Output is correct
23 Correct 374 ms 22524 KB Output is correct
24 Correct 316 ms 22412 KB Output is correct
25 Correct 513 ms 44212 KB Output is correct
26 Correct 384 ms 40728 KB Output is correct
27 Correct 143 ms 864 KB Output is correct
28 Correct 258 ms 760 KB Output is correct
29 Correct 236 ms 980 KB Output is correct
30 Correct 460 ms 24068 KB Output is correct
31 Correct 258 ms 756 KB Output is correct
32 Correct 432 ms 21172 KB Output is correct
33 Correct 236 ms 948 KB Output is correct
34 Correct 256 ms 996 KB Output is correct
35 Correct 217 ms 1008 KB Output is correct
36 Correct 420 ms 25036 KB Output is correct
37 Correct 419 ms 25172 KB Output is correct
38 Correct 550 ms 49464 KB Output is correct
39 Correct 566 ms 46928 KB Output is correct
40 Correct 246 ms 1092 KB Output is correct

Subtask #7
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 391 ms 844 KB Output is correct
2 Correct 1 ms 656 KB Output is correct
3 Correct 383 ms 824 KB Output is correct
4 Correct 473 ms 10140 KB Output is correct
5 Correct 16 ms 936 KB Output is correct
6 Correct 367 ms 2580 KB Output is correct
7 Correct 1 ms 656 KB Output is correct
8 Correct 336 ms 856 KB Output is correct
9 Correct 383 ms 880 KB Output is correct
10 Correct 542 ms 27616 KB Output is correct
11 Correct 507 ms 24528 KB Output is correct
12 Correct 40 ms 668 KB Output is correct
13 Correct 411 ms 24796 KB Output is correct
14 Correct 305 ms 820 KB Output is correct
15 Correct 0 ms 656 KB Output is correct
16 Correct 318 ms 788 KB Output is correct
17 Correct 347 ms 864 KB Output is correct
18 Correct 334 ms 960 KB Output is correct
19 Correct 339 ms 824 KB Output is correct
20 Correct 351 ms 800 KB Output is correct
21 Correct 397 ms 924 KB Output is correct
22 Correct 362 ms 800 KB Output is correct
23 Correct 373 ms 832 KB Output is correct
24 Correct 186 ms 724 KB Output is correct
25 Correct 160 ms 820 KB Output is correct
26 Correct 240 ms 13392 KB Output is correct
27 Correct 176 ms 952 KB Output is correct
28 Correct 259 ms 10068 KB Output is correct
29 Correct 180 ms 752 KB Output is correct
30 Correct 181 ms 804 KB Output is correct
31 Correct 184 ms 804 KB Output is correct
32 Correct 213 ms 19644 KB Output is correct
33 Correct 241 ms 19592 KB Output is correct
34 Correct 366 ms 38476 KB Output is correct
35 Correct 334 ms 36028 KB Output is correct
36 Correct 150 ms 840 KB Output is correct
37 Correct 0 ms 656 KB Output is correct
38 Correct 191 ms 740 KB Output is correct
39 Correct 187 ms 852 KB Output is correct
40 Correct 199 ms 716 KB Output is correct
41 Correct 266 ms 10020 KB Output is correct
42 Correct 222 ms 792 KB Output is correct
43 Correct 271 ms 10356 KB Output is correct
44 Correct 189 ms 816 KB Output is correct
45 Correct 158 ms 768 KB Output is correct
46 Correct 374 ms 22524 KB Output is correct
47 Correct 316 ms 22412 KB Output is correct
48 Correct 513 ms 44212 KB Output is correct
49 Correct 384 ms 40728 KB Output is correct
50 Correct 143 ms 864 KB Output is correct
51 Correct 258 ms 760 KB Output is correct
52 Correct 236 ms 980 KB Output is correct
53 Correct 460 ms 24068 KB Output is correct
54 Correct 258 ms 756 KB Output is correct
55 Correct 432 ms 21172 KB Output is correct
56 Correct 236 ms 948 KB Output is correct
57 Correct 256 ms 996 KB Output is correct
58 Correct 217 ms 1008 KB Output is correct
59 Correct 420 ms 25036 KB Output is correct
60 Correct 419 ms 25172 KB Output is correct
61 Correct 550 ms 49464 KB Output is correct
62 Correct 566 ms 46928 KB Output is correct
63 Correct 246 ms 1092 KB Output is correct
64 Correct 310 ms 1000 KB Output is correct
65 Runtime error 287 ms 13252 KB Execution killed with signal 13
66 Halted 0 ms 0 KB -