oj.uz

답안 #828512

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
828512 2023-08-17T10:38:21 Z NoName14159 Two Transportations (JOI19_transportations) C++14
68 / 100
 536 ms 49472 KB 
#include "Azer.h"
#include <stdlib.h>
#include <iostream>
#include <cassert>
#include <queue>
#define MAXN 2000
#define MAXM 500000
#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[58000];
	int buf_size=0;
	int buf_now=0;
	int t=0;
	int bits;
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(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=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=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=11;
					}else{
						bits=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{
						int temp=Read(20);
						relax_v=temp>>9;
						relax_w+=temp&((1<<9)-1);
					}
				}
			}
			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=1;
					return;
				}
			}
		}
	}
}
void InitA(int N,int A,vi U,vi V,vi C){
	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){
		Do();
	}
}
vi Answer(){
	vi ans;
	LOOP(i,n){
		ans.pub(dis[i]);
	}
	return ans;
}

#include "Baijan.h"
#include <stdlib.h>
#include <iostream>
#include <cassert>
#include <queue>
#define MAXN 2000
#define MAXM 500000
#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[58000];
	int buf_size=0;
	int buf_now=0;
	int t=0;
	int bits;
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(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=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=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=11;
					}else{
						bits=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{
						int temp=Read(20);
						relax_v=temp>>9;
						relax_w+=temp&((1<<9)-1);
					}
				}
			}
			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=1;
					return;
				}
			}
		}
	}
}
void InitB(int N,int B,vi U,vi V,vi C){
	srand(7749);
	n=N;
	LOOP(i,B){
		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=1;
}
void ReceiveB(bool x){
	buf[buf_size]=x;
	buf_size++;
	if(buf_size-buf_now>=bits){
		Do();
	}
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 373 ms 836 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 265 ms 816 KB Output is correct
4 Correct 418 ms 10252 KB Output is correct
5 Correct 23 ms 952 KB Output is correct
6 Correct 380 ms 2576 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 656 KB Output is correct
2 Runtime error 168 ms 448 KB Execution killed with signal 13
3 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 329 ms 956 KB Output is correct
2 Correct 1 ms 656 KB Output is correct
3 Correct 315 ms 824 KB Output is correct
4 Runtime error 168 ms 440 KB Execution killed with signal 13
5 Halted 0 ms 0 KB -

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 157 ms 744 KB Output is correct
2 Correct 169 ms 740 KB Output is correct
3 Correct 262 ms 13324 KB Output is correct
4 Correct 179 ms 736 KB Output is correct
5 Correct 249 ms 10088 KB Output is correct
6 Correct 122 ms 724 KB Output is correct
7 Correct 150 ms 968 KB Output is correct
8 Correct 185 ms 812 KB Output is correct
9 Correct 270 ms 19636 KB Output is correct
10 Correct 322 ms 19576 KB Output is correct
11 Correct 417 ms 38380 KB Output is correct
12 Correct 348 ms 35900 KB Output is correct
13 Correct 136 ms 836 KB Output is correct
14 Correct 1 ms 656 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 157 ms 744 KB Output is correct
2 Correct 169 ms 740 KB Output is correct
3 Correct 262 ms 13324 KB Output is correct
4 Correct 179 ms 736 KB Output is correct
5 Correct 249 ms 10088 KB Output is correct
6 Correct 122 ms 724 KB Output is correct
7 Correct 150 ms 968 KB Output is correct
8 Correct 185 ms 812 KB Output is correct
9 Correct 270 ms 19636 KB Output is correct
10 Correct 322 ms 19576 KB Output is correct
11 Correct 417 ms 38380 KB Output is correct
12 Correct 348 ms 35900 KB Output is correct
13 Correct 136 ms 836 KB Output is correct
14 Correct 1 ms 656 KB Output is correct
15 Correct 222 ms 764 KB Output is correct
16 Correct 232 ms 748 KB Output is correct
17 Correct 170 ms 748 KB Output is correct
18 Correct 328 ms 10164 KB Output is correct
19 Correct 261 ms 820 KB Output is correct
20 Correct 297 ms 10368 KB Output is correct
21 Correct 147 ms 848 KB Output is correct
22 Correct 218 ms 1100 KB Output is correct
23 Correct 332 ms 22496 KB Output is correct
24 Correct 354 ms 22556 KB Output is correct
25 Correct 487 ms 44224 KB Output is correct
26 Correct 362 ms 40500 KB Output is correct
27 Correct 201 ms 920 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 157 ms 744 KB Output is correct
2 Correct 169 ms 740 KB Output is correct
3 Correct 262 ms 13324 KB Output is correct
4 Correct 179 ms 736 KB Output is correct
5 Correct 249 ms 10088 KB Output is correct
6 Correct 122 ms 724 KB Output is correct
7 Correct 150 ms 968 KB Output is correct
8 Correct 185 ms 812 KB Output is correct
9 Correct 270 ms 19636 KB Output is correct
10 Correct 322 ms 19576 KB Output is correct
11 Correct 417 ms 38380 KB Output is correct
12 Correct 348 ms 35900 KB Output is correct
13 Correct 136 ms 836 KB Output is correct
14 Correct 1 ms 656 KB Output is correct
15 Correct 222 ms 764 KB Output is correct
16 Correct 232 ms 748 KB Output is correct
17 Correct 170 ms 748 KB Output is correct
18 Correct 328 ms 10164 KB Output is correct
19 Correct 261 ms 820 KB Output is correct
20 Correct 297 ms 10368 KB Output is correct
21 Correct 147 ms 848 KB Output is correct
22 Correct 218 ms 1100 KB Output is correct
23 Correct 332 ms 22496 KB Output is correct
24 Correct 354 ms 22556 KB Output is correct
25 Correct 487 ms 44224 KB Output is correct
26 Correct 362 ms 40500 KB Output is correct
27 Correct 201 ms 920 KB Output is correct
28 Correct 277 ms 804 KB Output is correct
29 Correct 243 ms 764 KB Output is correct
30 Correct 439 ms 23964 KB Output is correct
31 Correct 216 ms 776 KB Output is correct
32 Correct 470 ms 21000 KB Output is correct
33 Correct 244 ms 840 KB Output is correct
34 Correct 218 ms 896 KB Output is correct
35 Correct 281 ms 916 KB Output is correct
36 Correct 388 ms 25156 KB Output is correct
37 Correct 325 ms 25028 KB Output is correct
38 Correct 496 ms 49472 KB Output is correct
39 Correct 536 ms 47236 KB Output is correct
40 Correct 250 ms 996 KB Output is correct

Subtask #7
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 373 ms 836 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 265 ms 816 KB Output is correct
4 Correct 418 ms 10252 KB Output is correct
5 Correct 23 ms 952 KB Output is correct
6 Correct 380 ms 2576 KB Output is correct
7 Correct 1 ms 656 KB Output is correct
8 Runtime error 168 ms 448 KB Execution killed with signal 13
9 Halted 0 ms 0 KB -