oj.uz

답안 #831124

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
831124 2023-08-19T19:10:49 Z NoName14159 Two Transportations (JOI19_transportations) C++14
68 / 100
 552 ms 49368 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;
	bool *visited;
	vpii *e;
	pqpii pq;
	pii rec;
	int rec_other;
	int relax_w=0;
	int relax_v;
	bool *buf;
	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;
					}
				}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){
	dis=(int *)malloc(sizeof(int)*MAXN);
	visited=(bool *)malloc(sizeof(bool)*MAXN);
	LOOP(i,MAXN){
		visited[i]=false;
	}
	e=(vpii *)malloc(sizeof(vpii)*MAXN);
	buf=(bool *)malloc(sizeof(bool)*58007);
	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;
	bool *visited;
	vpii *e;
	pqpii pq;
	pii rec;
	int rec_other;
	int relax_w=0;
	int relax_v;
	bool *buf;
	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;
					}
				}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){
	dis=(int *)malloc(sizeof(int)*MAXN);
	visited=(bool *)malloc(sizeof(bool)*MAXN);
	LOOP(i,MAXN){
		visited[i]=false;
	}
	e=(vpii *)malloc(sizeof(vpii)*MAXN);
	buf=(bool *)malloc(sizeof(bool)*58007);
	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=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 282 ms 876 KB Output is correct
2 Correct 0 ms 400 KB Output is correct
3 Correct 326 ms 900 KB Output is correct
4 Correct 396 ms 10036 KB Output is correct
5 Correct 20 ms 756 KB Output is correct
6 Correct 387 ms 2420 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 344 ms 816 KB Output is correct
2 Correct 0 ms 400 KB Output is correct
3 Correct 274 ms 888 KB Output is correct
4 Runtime error 169 ms 440 KB Execution killed with signal 13
5 Halted 0 ms 0 KB -

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 180 ms 684 KB Output is correct
2 Correct 121 ms 652 KB Output is correct
3 Correct 277 ms 13256 KB Output is correct
4 Correct 99 ms 704 KB Output is correct
5 Correct 289 ms 9960 KB Output is correct
6 Correct 131 ms 692 KB Output is correct
7 Correct 166 ms 756 KB Output is correct
8 Correct 138 ms 752 KB Output is correct
9 Correct 261 ms 19436 KB Output is correct
10 Correct 254 ms 19500 KB Output is correct
11 Correct 387 ms 38408 KB Output is correct
12 Correct 389 ms 35912 KB Output is correct
13 Correct 177 ms 804 KB Output is correct
14 Correct 0 ms 400 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 180 ms 684 KB Output is correct
2 Correct 121 ms 652 KB Output is correct
3 Correct 277 ms 13256 KB Output is correct
4 Correct 99 ms 704 KB Output is correct
5 Correct 289 ms 9960 KB Output is correct
6 Correct 131 ms 692 KB Output is correct
7 Correct 166 ms 756 KB Output is correct
8 Correct 138 ms 752 KB Output is correct
9 Correct 261 ms 19436 KB Output is correct
10 Correct 254 ms 19500 KB Output is correct
11 Correct 387 ms 38408 KB Output is correct
12 Correct 389 ms 35912 KB Output is correct
13 Correct 177 ms 804 KB Output is correct
14 Correct 0 ms 400 KB Output is correct
15 Correct 230 ms 720 KB Output is correct
16 Correct 187 ms 692 KB Output is correct
17 Correct 193 ms 664 KB Output is correct
18 Correct 324 ms 10016 KB Output is correct
19 Correct 160 ms 756 KB Output is correct
20 Correct 314 ms 10192 KB Output is correct
21 Correct 168 ms 804 KB Output is correct
22 Correct 172 ms 808 KB Output is correct
23 Correct 361 ms 22316 KB Output is correct
24 Correct 291 ms 22368 KB Output is correct
25 Correct 461 ms 44072 KB Output is correct
26 Correct 454 ms 40444 KB Output is correct
27 Correct 223 ms 860 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 180 ms 684 KB Output is correct
2 Correct 121 ms 652 KB Output is correct
3 Correct 277 ms 13256 KB Output is correct
4 Correct 99 ms 704 KB Output is correct
5 Correct 289 ms 9960 KB Output is correct
6 Correct 131 ms 692 KB Output is correct
7 Correct 166 ms 756 KB Output is correct
8 Correct 138 ms 752 KB Output is correct
9 Correct 261 ms 19436 KB Output is correct
10 Correct 254 ms 19500 KB Output is correct
11 Correct 387 ms 38408 KB Output is correct
12 Correct 389 ms 35912 KB Output is correct
13 Correct 177 ms 804 KB Output is correct
14 Correct 0 ms 400 KB Output is correct
15 Correct 230 ms 720 KB Output is correct
16 Correct 187 ms 692 KB Output is correct
17 Correct 193 ms 664 KB Output is correct
18 Correct 324 ms 10016 KB Output is correct
19 Correct 160 ms 756 KB Output is correct
20 Correct 314 ms 10192 KB Output is correct
21 Correct 168 ms 804 KB Output is correct
22 Correct 172 ms 808 KB Output is correct
23 Correct 361 ms 22316 KB Output is correct
24 Correct 291 ms 22368 KB Output is correct
25 Correct 461 ms 44072 KB Output is correct
26 Correct 454 ms 40444 KB Output is correct
27 Correct 223 ms 860 KB Output is correct
28 Correct 241 ms 752 KB Output is correct
29 Correct 229 ms 672 KB Output is correct
30 Correct 456 ms 24072 KB Output is correct
31 Correct 306 ms 720 KB Output is correct
32 Correct 396 ms 20992 KB Output is correct
33 Correct 156 ms 816 KB Output is correct
34 Correct 144 ms 860 KB Output is correct
35 Correct 170 ms 988 KB Output is correct
36 Correct 334 ms 25056 KB Output is correct
37 Correct 348 ms 25232 KB Output is correct
38 Correct 552 ms 49368 KB Output is correct
39 Correct 482 ms 47044 KB Output is correct
40 Correct 227 ms 956 KB Output is correct

Subtask #7
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 282 ms 876 KB Output is correct
2 Correct 0 ms 400 KB Output is correct
3 Correct 326 ms 900 KB Output is correct
4 Correct 396 ms 10036 KB Output is correct
5 Correct 20 ms 756 KB Output is correct
6 Correct 387 ms 2420 KB Output is correct
7 Correct 0 ms 400 KB Output is correct
8 Runtime error 221 ms 436 KB Execution killed with signal 13
9 Halted 0 ms 0 KB -