oj.uz

답안 #828580

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
828580 2023-08-17T11:51:54 Z NoName14159 Two Transportations (JOI19_transportations) C++14
68 / 100
 544 ms 49544 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(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=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{
						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=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(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=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{
						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=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 290 ms 948 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 357 ms 960 KB Output is correct
4 Correct 521 ms 10360 KB Output is correct
5 Correct 19 ms 984 KB Output is correct
6 Correct 450 ms 2480 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 656 KB Output is correct
2 Failed 235 ms 448 KB Unexpected end of file - int32 expected (Baijan)
3 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

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

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 824 KB Output is correct
2 Correct 134 ms 748 KB Output is correct
3 Correct 260 ms 13188 KB Output is correct
4 Correct 185 ms 792 KB Output is correct
5 Correct 261 ms 10088 KB Output is correct
6 Correct 122 ms 756 KB Output is correct
7 Correct 194 ms 828 KB Output is correct
8 Correct 169 ms 856 KB Output is correct
9 Correct 245 ms 19420 KB Output is correct
10 Correct 255 ms 19636 KB Output is correct
11 Correct 489 ms 38480 KB Output is correct
12 Correct 376 ms 35904 KB Output is correct
13 Correct 130 ms 844 KB Output is correct
14 Correct 0 ms 656 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 824 KB Output is correct
2 Correct 134 ms 748 KB Output is correct
3 Correct 260 ms 13188 KB Output is correct
4 Correct 185 ms 792 KB Output is correct
5 Correct 261 ms 10088 KB Output is correct
6 Correct 122 ms 756 KB Output is correct
7 Correct 194 ms 828 KB Output is correct
8 Correct 169 ms 856 KB Output is correct
9 Correct 245 ms 19420 KB Output is correct
10 Correct 255 ms 19636 KB Output is correct
11 Correct 489 ms 38480 KB Output is correct
12 Correct 376 ms 35904 KB Output is correct
13 Correct 130 ms 844 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 194 ms 892 KB Output is correct
16 Correct 267 ms 748 KB Output is correct
17 Correct 163 ms 1008 KB Output is correct
18 Correct 329 ms 10152 KB Output is correct
19 Correct 217 ms 808 KB Output is correct
20 Correct 257 ms 10368 KB Output is correct
21 Correct 168 ms 848 KB Output is correct
22 Correct 156 ms 856 KB Output is correct
23 Correct 437 ms 22568 KB Output is correct
24 Correct 287 ms 22496 KB Output is correct
25 Correct 509 ms 44056 KB Output is correct
26 Correct 443 ms 40536 KB Output is correct
27 Correct 226 ms 900 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 824 KB Output is correct
2 Correct 134 ms 748 KB Output is correct
3 Correct 260 ms 13188 KB Output is correct
4 Correct 185 ms 792 KB Output is correct
5 Correct 261 ms 10088 KB Output is correct
6 Correct 122 ms 756 KB Output is correct
7 Correct 194 ms 828 KB Output is correct
8 Correct 169 ms 856 KB Output is correct
9 Correct 245 ms 19420 KB Output is correct
10 Correct 255 ms 19636 KB Output is correct
11 Correct 489 ms 38480 KB Output is correct
12 Correct 376 ms 35904 KB Output is correct
13 Correct 130 ms 844 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 194 ms 892 KB Output is correct
16 Correct 267 ms 748 KB Output is correct
17 Correct 163 ms 1008 KB Output is correct
18 Correct 329 ms 10152 KB Output is correct
19 Correct 217 ms 808 KB Output is correct
20 Correct 257 ms 10368 KB Output is correct
21 Correct 168 ms 848 KB Output is correct
22 Correct 156 ms 856 KB Output is correct
23 Correct 437 ms 22568 KB Output is correct
24 Correct 287 ms 22496 KB Output is correct
25 Correct 509 ms 44056 KB Output is correct
26 Correct 443 ms 40536 KB Output is correct
27 Correct 226 ms 900 KB Output is correct
28 Correct 237 ms 1028 KB Output is correct
29 Correct 298 ms 884 KB Output is correct
30 Correct 523 ms 24080 KB Output is correct
31 Correct 249 ms 744 KB Output is correct
32 Correct 427 ms 21056 KB Output is correct
33 Correct 212 ms 840 KB Output is correct
34 Correct 253 ms 1028 KB Output is correct
35 Correct 170 ms 912 KB Output is correct
36 Correct 362 ms 25056 KB Output is correct
37 Correct 388 ms 25020 KB Output is correct
38 Correct 544 ms 49544 KB Output is correct
39 Correct 521 ms 47104 KB Output is correct
40 Correct 263 ms 992 KB Output is correct

Subtask #7
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 290 ms 948 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 357 ms 960 KB Output is correct
4 Correct 521 ms 10360 KB Output is correct
5 Correct 19 ms 984 KB Output is correct
6 Correct 450 ms 2480 KB Output is correct
7 Correct 0 ms 656 KB Output is correct
8 Failed 235 ms 448 KB Unexpected end of file - int32 expected (Baijan)
9 Halted 0 ms 0 KB -