oj.uz

Submission #831501

# Submission time Handle Problem Language Result Execution time Memory
831501 2023-08-20T09:55:21 Z NoName14159 Two Transportations (JOI19_transportations) C++17
84 / 100
 580 ms 49412 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;
bool running=false;
	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);
					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){
assert(running==false);
running=true;
	buf[buf_size]=x;
	buf_size++;
	if(buf_size-buf_now==bits_next){
		Do();
	}
running=false;
}
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;
bool running=false;
	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 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){
assert(running==false);
running=true;
	buf[buf_size]=x;
	buf_size++;
	if(buf_size-buf_now==bits_next){
		Do();
	}
running=false;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 325 ms 928 KB Output is correct
2 Correct 0 ms 528 KB Output is correct
3 Correct 391 ms 1072 KB Output is correct
4 Correct 487 ms 10248 KB Output is correct
5 Correct 18 ms 984 KB Output is correct
6 Correct 308 ms 2416 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 656 KB Output is correct
2 Correct 277 ms 852 KB Output is correct
3 Correct 330 ms 944 KB Output is correct
4 Correct 567 ms 27664 KB Output is correct
5 Correct 444 ms 24556 KB Output is correct
6 Correct 74 ms 728 KB Output is correct
7 Correct 539 ms 24620 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 419 ms 812 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 390 ms 896 KB Output is correct
4 Correct 423 ms 1076 KB Output is correct
5 Correct 393 ms 864 KB Output is correct
6 Correct 264 ms 832 KB Output is correct
7 Correct 406 ms 804 KB Output is correct
8 Correct 406 ms 804 KB Output is correct
9 Correct 335 ms 796 KB Output is correct
10 Correct 296 ms 936 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 163 ms 836 KB Output is correct
2 Correct 179 ms 740 KB Output is correct
3 Correct 284 ms 13292 KB Output is correct
4 Correct 195 ms 816 KB Output is correct
5 Correct 239 ms 9972 KB Output is correct
6 Correct 192 ms 744 KB Output is correct
7 Correct 132 ms 924 KB Output is correct
8 Correct 180 ms 800 KB Output is correct
9 Correct 192 ms 19712 KB Output is correct
10 Correct 270 ms 19484 KB Output is correct
11 Correct 379 ms 38240 KB Output is correct
12 Correct 343 ms 36056 KB Output is correct
13 Correct 194 ms 836 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 163 ms 836 KB Output is correct
2 Correct 179 ms 740 KB Output is correct
3 Correct 284 ms 13292 KB Output is correct
4 Correct 195 ms 816 KB Output is correct
5 Correct 239 ms 9972 KB Output is correct
6 Correct 192 ms 744 KB Output is correct
7 Correct 132 ms 924 KB Output is correct
8 Correct 180 ms 800 KB Output is correct
9 Correct 192 ms 19712 KB Output is correct
10 Correct 270 ms 19484 KB Output is correct
11 Correct 379 ms 38240 KB Output is correct
12 Correct 343 ms 36056 KB Output is correct
13 Correct 194 ms 836 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 196 ms 740 KB Output is correct
16 Correct 226 ms 728 KB Output is correct
17 Correct 192 ms 784 KB Output is correct
18 Correct 305 ms 10120 KB Output is correct
19 Correct 146 ms 788 KB Output is correct
20 Correct 261 ms 10364 KB Output is correct
21 Correct 246 ms 832 KB Output is correct
22 Correct 184 ms 824 KB Output is correct
23 Correct 284 ms 22504 KB Output is correct
24 Correct 343 ms 22504 KB Output is correct
25 Correct 565 ms 44148 KB Output is correct
26 Correct 440 ms 40412 KB Output is correct
27 Correct 226 ms 880 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 163 ms 836 KB Output is correct
2 Correct 179 ms 740 KB Output is correct
3 Correct 284 ms 13292 KB Output is correct
4 Correct 195 ms 816 KB Output is correct
5 Correct 239 ms 9972 KB Output is correct
6 Correct 192 ms 744 KB Output is correct
7 Correct 132 ms 924 KB Output is correct
8 Correct 180 ms 800 KB Output is correct
9 Correct 192 ms 19712 KB Output is correct
10 Correct 270 ms 19484 KB Output is correct
11 Correct 379 ms 38240 KB Output is correct
12 Correct 343 ms 36056 KB Output is correct
13 Correct 194 ms 836 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 196 ms 740 KB Output is correct
16 Correct 226 ms 728 KB Output is correct
17 Correct 192 ms 784 KB Output is correct
18 Correct 305 ms 10120 KB Output is correct
19 Correct 146 ms 788 KB Output is correct
20 Correct 261 ms 10364 KB Output is correct
21 Correct 246 ms 832 KB Output is correct
22 Correct 184 ms 824 KB Output is correct
23 Correct 284 ms 22504 KB Output is correct
24 Correct 343 ms 22504 KB Output is correct
25 Correct 565 ms 44148 KB Output is correct
26 Correct 440 ms 40412 KB Output is correct
27 Correct 226 ms 880 KB Output is correct
28 Correct 221 ms 788 KB Output is correct
29 Correct 275 ms 748 KB Output is correct
30 Correct 475 ms 24068 KB Output is correct
31 Correct 268 ms 984 KB Output is correct
32 Correct 358 ms 21068 KB Output is correct
33 Correct 250 ms 812 KB Output is correct
34 Correct 272 ms 876 KB Output is correct
35 Correct 188 ms 880 KB Output is correct
36 Correct 444 ms 25100 KB Output is correct
37 Correct 371 ms 24956 KB Output is correct
38 Correct 577 ms 49412 KB Output is correct
39 Correct 580 ms 46932 KB Output is correct
40 Correct 177 ms 1072 KB Output is correct

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 325 ms 928 KB Output is correct
2 Correct 0 ms 528 KB Output is correct
3 Correct 391 ms 1072 KB Output is correct
4 Correct 487 ms 10248 KB Output is correct
5 Correct 18 ms 984 KB Output is correct
6 Correct 308 ms 2416 KB Output is correct
7 Correct 0 ms 656 KB Output is correct
8 Correct 277 ms 852 KB Output is correct
9 Correct 330 ms 944 KB Output is correct
10 Correct 567 ms 27664 KB Output is correct
11 Correct 444 ms 24556 KB Output is correct
12 Correct 74 ms 728 KB Output is correct
13 Correct 539 ms 24620 KB Output is correct
14 Correct 419 ms 812 KB Output is correct
15 Correct 0 ms 656 KB Output is correct
16 Correct 390 ms 896 KB Output is correct
17 Correct 423 ms 1076 KB Output is correct
18 Correct 393 ms 864 KB Output is correct
19 Correct 264 ms 832 KB Output is correct
20 Correct 406 ms 804 KB Output is correct
21 Correct 406 ms 804 KB Output is correct
22 Correct 335 ms 796 KB Output is correct
23 Correct 296 ms 936 KB Output is correct
24 Correct 163 ms 836 KB Output is correct
25 Correct 179 ms 740 KB Output is correct
26 Correct 284 ms 13292 KB Output is correct
27 Correct 195 ms 816 KB Output is correct
28 Correct 239 ms 9972 KB Output is correct
29 Correct 192 ms 744 KB Output is correct
30 Correct 132 ms 924 KB Output is correct
31 Correct 180 ms 800 KB Output is correct
32 Correct 192 ms 19712 KB Output is correct
33 Correct 270 ms 19484 KB Output is correct
34 Correct 379 ms 38240 KB Output is correct
35 Correct 343 ms 36056 KB Output is correct
36 Correct 194 ms 836 KB Output is correct
37 Correct 0 ms 656 KB Output is correct
38 Correct 196 ms 740 KB Output is correct
39 Correct 226 ms 728 KB Output is correct
40 Correct 192 ms 784 KB Output is correct
41 Correct 305 ms 10120 KB Output is correct
42 Correct 146 ms 788 KB Output is correct
43 Correct 261 ms 10364 KB Output is correct
44 Correct 246 ms 832 KB Output is correct
45 Correct 184 ms 824 KB Output is correct
46 Correct 284 ms 22504 KB Output is correct
47 Correct 343 ms 22504 KB Output is correct
48 Correct 565 ms 44148 KB Output is correct
49 Correct 440 ms 40412 KB Output is correct
50 Correct 226 ms 880 KB Output is correct
51 Correct 221 ms 788 KB Output is correct
52 Correct 275 ms 748 KB Output is correct
53 Correct 475 ms 24068 KB Output is correct
54 Correct 268 ms 984 KB Output is correct
55 Correct 358 ms 21068 KB Output is correct
56 Correct 250 ms 812 KB Output is correct
57 Correct 272 ms 876 KB Output is correct
58 Correct 188 ms 880 KB Output is correct
59 Correct 444 ms 25100 KB Output is correct
60 Correct 371 ms 24956 KB Output is correct
61 Correct 577 ms 49412 KB Output is correct
62 Correct 580 ms 46932 KB Output is correct
63 Correct 177 ms 1072 KB Output is correct
64 Correct 253 ms 1024 KB Output is correct
65 Runtime error 299 ms 13256 KB Execution killed with signal 13
66 Halted 0 ms 0 KB -