oj.uz

Submission #831787

# Submission time Handle Problem Language Result Execution time Memory
831787 2023-08-20T14:37:59 Z NoName14159 Two Transportations (JOI19_transportations) C++17
84 / 100
 522 ms 49284 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)(std::rand()%2);
					Send(1,(int)new_leader);
assert((int)new_leader==0||(int)new_leader==1);
					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);
assert(rec.first>=0&&rec.first<=511);
					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);
assert(rec.second>=0&&rec.second<n);
						relax_v=rec.second;
						Send(9,rec.first);
assert(rec.first>=0&&rec.first<=500);
						relax_w+=rec.first;
					}else{
						relax_v=Read(11);
						relax_w+=rec_other;
					}
				}else{
					if(winner){
						Send(11,rec.second);
assert(rec.second>=0&&rec.second<n);
						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(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++;
assert(buf_size>buf_now);
	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)(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 B,vi S,vi T,vi D){
	std::srand(7749);
	n=N;
	LOOP(i,B){
		e[S[i]].pub({T[i],D[i]});
		e[T[i]].pub({S[i],D[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

# Verdict Execution time Memory Grader output
1 Correct 271 ms 792 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 297 ms 824 KB Output is correct
4 Correct 365 ms 10120 KB Output is correct
5 Correct 22 ms 936 KB Output is correct
6 Correct 356 ms 2356 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 712 KB Output is correct
2 Correct 386 ms 968 KB Output is correct
3 Correct 381 ms 1020 KB Output is correct
4 Correct 516 ms 27692 KB Output is correct
5 Correct 415 ms 24472 KB Output is correct
6 Correct 74 ms 708 KB Output is correct
7 Correct 427 ms 24700 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 331 ms 984 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 376 ms 920 KB Output is correct
4 Correct 343 ms 872 KB Output is correct
5 Correct 320 ms 968 KB Output is correct
6 Correct 312 ms 848 KB Output is correct
7 Correct 281 ms 792 KB Output is correct
8 Correct 305 ms 904 KB Output is correct
9 Correct 328 ms 1028 KB Output is correct
10 Correct 290 ms 932 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 724 KB Output is correct
2 Correct 151 ms 836 KB Output is correct
3 Correct 313 ms 13308 KB Output is correct
4 Correct 161 ms 768 KB Output is correct
5 Correct 261 ms 10040 KB Output is correct
6 Correct 148 ms 736 KB Output is correct
7 Correct 143 ms 800 KB Output is correct
8 Correct 117 ms 792 KB Output is correct
9 Correct 261 ms 19520 KB Output is correct
10 Correct 256 ms 19568 KB Output is correct
11 Correct 378 ms 38376 KB Output is correct
12 Correct 278 ms 36032 KB Output is correct
13 Correct 158 ms 744 KB Output is correct
14 Correct 0 ms 656 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 724 KB Output is correct
2 Correct 151 ms 836 KB Output is correct
3 Correct 313 ms 13308 KB Output is correct
4 Correct 161 ms 768 KB Output is correct
5 Correct 261 ms 10040 KB Output is correct
6 Correct 148 ms 736 KB Output is correct
7 Correct 143 ms 800 KB Output is correct
8 Correct 117 ms 792 KB Output is correct
9 Correct 261 ms 19520 KB Output is correct
10 Correct 256 ms 19568 KB Output is correct
11 Correct 378 ms 38376 KB Output is correct
12 Correct 278 ms 36032 KB Output is correct
13 Correct 158 ms 744 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 212 ms 724 KB Output is correct
16 Correct 110 ms 720 KB Output is correct
17 Correct 227 ms 744 KB Output is correct
18 Correct 302 ms 10120 KB Output is correct
19 Correct 206 ms 776 KB Output is correct
20 Correct 326 ms 10268 KB Output is correct
21 Correct 227 ms 956 KB Output is correct
22 Correct 200 ms 820 KB Output is correct
23 Correct 281 ms 22480 KB Output is correct
24 Correct 300 ms 22560 KB Output is correct
25 Correct 497 ms 44036 KB Output is correct
26 Correct 422 ms 40536 KB Output is correct
27 Correct 187 ms 880 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 724 KB Output is correct
2 Correct 151 ms 836 KB Output is correct
3 Correct 313 ms 13308 KB Output is correct
4 Correct 161 ms 768 KB Output is correct
5 Correct 261 ms 10040 KB Output is correct
6 Correct 148 ms 736 KB Output is correct
7 Correct 143 ms 800 KB Output is correct
8 Correct 117 ms 792 KB Output is correct
9 Correct 261 ms 19520 KB Output is correct
10 Correct 256 ms 19568 KB Output is correct
11 Correct 378 ms 38376 KB Output is correct
12 Correct 278 ms 36032 KB Output is correct
13 Correct 158 ms 744 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 212 ms 724 KB Output is correct
16 Correct 110 ms 720 KB Output is correct
17 Correct 227 ms 744 KB Output is correct
18 Correct 302 ms 10120 KB Output is correct
19 Correct 206 ms 776 KB Output is correct
20 Correct 326 ms 10268 KB Output is correct
21 Correct 227 ms 956 KB Output is correct
22 Correct 200 ms 820 KB Output is correct
23 Correct 281 ms 22480 KB Output is correct
24 Correct 300 ms 22560 KB Output is correct
25 Correct 497 ms 44036 KB Output is correct
26 Correct 422 ms 40536 KB Output is correct
27 Correct 187 ms 880 KB Output is correct
28 Correct 262 ms 900 KB Output is correct
29 Correct 175 ms 736 KB Output is correct
30 Correct 509 ms 24076 KB Output is correct
31 Correct 236 ms 736 KB Output is correct
32 Correct 449 ms 20964 KB Output is correct
33 Correct 205 ms 812 KB Output is correct
34 Correct 258 ms 876 KB Output is correct
35 Correct 249 ms 864 KB Output is correct
36 Correct 402 ms 25244 KB Output is correct
37 Correct 409 ms 24988 KB Output is correct
38 Correct 522 ms 49284 KB Output is correct
39 Correct 401 ms 47172 KB Output is correct
40 Correct 202 ms 924 KB Output is correct

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 271 ms 792 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 297 ms 824 KB Output is correct
4 Correct 365 ms 10120 KB Output is correct
5 Correct 22 ms 936 KB Output is correct
6 Correct 356 ms 2356 KB Output is correct
7 Correct 0 ms 712 KB Output is correct
8 Correct 386 ms 968 KB Output is correct
9 Correct 381 ms 1020 KB Output is correct
10 Correct 516 ms 27692 KB Output is correct
11 Correct 415 ms 24472 KB Output is correct
12 Correct 74 ms 708 KB Output is correct
13 Correct 427 ms 24700 KB Output is correct
14 Correct 331 ms 984 KB Output is correct
15 Correct 0 ms 656 KB Output is correct
16 Correct 376 ms 920 KB Output is correct
17 Correct 343 ms 872 KB Output is correct
18 Correct 320 ms 968 KB Output is correct
19 Correct 312 ms 848 KB Output is correct
20 Correct 281 ms 792 KB Output is correct
21 Correct 305 ms 904 KB Output is correct
22 Correct 328 ms 1028 KB Output is correct
23 Correct 290 ms 932 KB Output is correct
24 Correct 195 ms 724 KB Output is correct
25 Correct 151 ms 836 KB Output is correct
26 Correct 313 ms 13308 KB Output is correct
27 Correct 161 ms 768 KB Output is correct
28 Correct 261 ms 10040 KB Output is correct
29 Correct 148 ms 736 KB Output is correct
30 Correct 143 ms 800 KB Output is correct
31 Correct 117 ms 792 KB Output is correct
32 Correct 261 ms 19520 KB Output is correct
33 Correct 256 ms 19568 KB Output is correct
34 Correct 378 ms 38376 KB Output is correct
35 Correct 278 ms 36032 KB Output is correct
36 Correct 158 ms 744 KB Output is correct
37 Correct 0 ms 656 KB Output is correct
38 Correct 212 ms 724 KB Output is correct
39 Correct 110 ms 720 KB Output is correct
40 Correct 227 ms 744 KB Output is correct
41 Correct 302 ms 10120 KB Output is correct
42 Correct 206 ms 776 KB Output is correct
43 Correct 326 ms 10268 KB Output is correct
44 Correct 227 ms 956 KB Output is correct
45 Correct 200 ms 820 KB Output is correct
46 Correct 281 ms 22480 KB Output is correct
47 Correct 300 ms 22560 KB Output is correct
48 Correct 497 ms 44036 KB Output is correct
49 Correct 422 ms 40536 KB Output is correct
50 Correct 187 ms 880 KB Output is correct
51 Correct 262 ms 900 KB Output is correct
52 Correct 175 ms 736 KB Output is correct
53 Correct 509 ms 24076 KB Output is correct
54 Correct 236 ms 736 KB Output is correct
55 Correct 449 ms 20964 KB Output is correct
56 Correct 205 ms 812 KB Output is correct
57 Correct 258 ms 876 KB Output is correct
58 Correct 249 ms 864 KB Output is correct
59 Correct 402 ms 25244 KB Output is correct
60 Correct 409 ms 24988 KB Output is correct
61 Correct 522 ms 49284 KB Output is correct
62 Correct 401 ms 47172 KB Output is correct
63 Correct 202 ms 924 KB Output is correct
64 Correct 316 ms 1012 KB Output is correct
65 Runtime error 272 ms 13252 KB Execution killed with signal 13
66 Halted 0 ms 0 KB -