oj.uz

답안 #831561

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
831561 2023-08-20T10:25:04 Z NoName14159 Two Transportations (JOI19_transportations) C++17
76 / 100
 669 ms 49352 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=false;//(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(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=false;//(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(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 247 ms 796 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 258 ms 816 KB Output is correct
4 Correct 344 ms 10172 KB Output is correct
5 Correct 12 ms 912 KB Output is correct
6 Correct 297 ms 2420 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 528 KB Output is correct
2 Correct 380 ms 820 KB Output is correct
3 Correct 251 ms 876 KB Output is correct
4 Runtime error 373 ms 46476 KB Execution killed with signal 6
5 Halted 0 ms 0 KB -

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 323 ms 840 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 247 ms 776 KB Output is correct
4 Correct 336 ms 844 KB Output is correct
5 Correct 363 ms 860 KB Output is correct
6 Correct 324 ms 848 KB Output is correct
7 Correct 402 ms 792 KB Output is correct
8 Correct 332 ms 784 KB Output is correct
9 Correct 341 ms 788 KB Output is correct
10 Correct 317 ms 828 KB Output is correct

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 164 ms 724 KB Output is correct
2 Correct 119 ms 672 KB Output is correct
3 Correct 283 ms 13304 KB Output is correct
4 Correct 147 ms 728 KB Output is correct
5 Correct 215 ms 10028 KB Output is correct
6 Correct 126 ms 736 KB Output is correct
7 Correct 139 ms 804 KB Output is correct
8 Correct 154 ms 820 KB Output is correct
9 Correct 258 ms 19520 KB Output is correct
10 Correct 188 ms 19520 KB Output is correct
11 Correct 426 ms 38276 KB Output is correct
12 Correct 388 ms 36012 KB Output is correct
13 Correct 148 ms 828 KB Output is correct
14 Correct 0 ms 656 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 164 ms 724 KB Output is correct
2 Correct 119 ms 672 KB Output is correct
3 Correct 283 ms 13304 KB Output is correct
4 Correct 147 ms 728 KB Output is correct
5 Correct 215 ms 10028 KB Output is correct
6 Correct 126 ms 736 KB Output is correct
7 Correct 139 ms 804 KB Output is correct
8 Correct 154 ms 820 KB Output is correct
9 Correct 258 ms 19520 KB Output is correct
10 Correct 188 ms 19520 KB Output is correct
11 Correct 426 ms 38276 KB Output is correct
12 Correct 388 ms 36012 KB Output is correct
13 Correct 148 ms 828 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 183 ms 740 KB Output is correct
16 Correct 271 ms 780 KB Output is correct
17 Correct 254 ms 732 KB Output is correct
18 Correct 338 ms 10000 KB Output is correct
19 Correct 265 ms 812 KB Output is correct
20 Correct 308 ms 10344 KB Output is correct
21 Correct 276 ms 832 KB Output is correct
22 Correct 256 ms 816 KB Output is correct
23 Correct 310 ms 22444 KB Output is correct
24 Correct 348 ms 22588 KB Output is correct
25 Correct 556 ms 44032 KB Output is correct
26 Correct 472 ms 40500 KB Output is correct
27 Correct 257 ms 948 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 164 ms 724 KB Output is correct
2 Correct 119 ms 672 KB Output is correct
3 Correct 283 ms 13304 KB Output is correct
4 Correct 147 ms 728 KB Output is correct
5 Correct 215 ms 10028 KB Output is correct
6 Correct 126 ms 736 KB Output is correct
7 Correct 139 ms 804 KB Output is correct
8 Correct 154 ms 820 KB Output is correct
9 Correct 258 ms 19520 KB Output is correct
10 Correct 188 ms 19520 KB Output is correct
11 Correct 426 ms 38276 KB Output is correct
12 Correct 388 ms 36012 KB Output is correct
13 Correct 148 ms 828 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 183 ms 740 KB Output is correct
16 Correct 271 ms 780 KB Output is correct
17 Correct 254 ms 732 KB Output is correct
18 Correct 338 ms 10000 KB Output is correct
19 Correct 265 ms 812 KB Output is correct
20 Correct 308 ms 10344 KB Output is correct
21 Correct 276 ms 832 KB Output is correct
22 Correct 256 ms 816 KB Output is correct
23 Correct 310 ms 22444 KB Output is correct
24 Correct 348 ms 22588 KB Output is correct
25 Correct 556 ms 44032 KB Output is correct
26 Correct 472 ms 40500 KB Output is correct
27 Correct 257 ms 948 KB Output is correct
28 Correct 322 ms 772 KB Output is correct
29 Correct 267 ms 740 KB Output is correct
30 Correct 573 ms 24052 KB Output is correct
31 Correct 190 ms 672 KB Output is correct
32 Correct 515 ms 21176 KB Output is correct
33 Correct 192 ms 804 KB Output is correct
34 Correct 279 ms 904 KB Output is correct
35 Correct 316 ms 876 KB Output is correct
36 Correct 495 ms 25120 KB Output is correct
37 Correct 381 ms 25212 KB Output is correct
38 Correct 580 ms 49352 KB Output is correct
39 Correct 669 ms 46996 KB Output is correct
40 Correct 263 ms 964 KB Output is correct

Subtask #7
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 247 ms 796 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 258 ms 816 KB Output is correct
4 Correct 344 ms 10172 KB Output is correct
5 Correct 12 ms 912 KB Output is correct
6 Correct 297 ms 2420 KB Output is correct
7 Correct 0 ms 528 KB Output is correct
8 Correct 380 ms 820 KB Output is correct
9 Correct 251 ms 876 KB Output is correct
10 Runtime error 373 ms 46476 KB Execution killed with signal 6
11 Halted 0 ms 0 KB -