oj.uz

Submission #831132

# Submission time Handle Problem Language Result Execution time Memory
831132 2023-08-19T19:19:10 Z NoName14159 Two Transportations (JOI19_transportations) C++14
84 / 100
 522 ms 49304 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(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){
	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(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){
	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 321 ms 876 KB Output is correct
2 Correct 0 ms 400 KB Output is correct
3 Correct 345 ms 788 KB Output is correct
4 Correct 459 ms 10116 KB Output is correct
5 Correct 24 ms 848 KB Output is correct
6 Correct 370 ms 2496 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 400 KB Output is correct
2 Correct 327 ms 984 KB Output is correct
3 Correct 381 ms 1144 KB Output is correct
4 Correct 487 ms 27784 KB Output is correct
5 Correct 522 ms 24544 KB Output is correct
6 Correct 74 ms 632 KB Output is correct
7 Correct 445 ms 24704 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 341 ms 820 KB Output is correct
2 Correct 0 ms 400 KB Output is correct
3 Correct 275 ms 756 KB Output is correct
4 Correct 297 ms 868 KB Output is correct
5 Correct 323 ms 852 KB Output is correct
6 Correct 285 ms 956 KB Output is correct
7 Correct 312 ms 1036 KB Output is correct
8 Correct 307 ms 668 KB Output is correct
9 Correct 404 ms 796 KB Output is correct
10 Correct 350 ms 880 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 672 KB Output is correct
2 Correct 147 ms 648 KB Output is correct
3 Correct 258 ms 13308 KB Output is correct
4 Correct 180 ms 728 KB Output is correct
5 Correct 280 ms 9960 KB Output is correct
6 Correct 162 ms 812 KB Output is correct
7 Correct 157 ms 752 KB Output is correct
8 Correct 146 ms 760 KB Output is correct
9 Correct 272 ms 19496 KB Output is correct
10 Correct 249 ms 19456 KB Output is correct
11 Correct 446 ms 38404 KB Output is correct
12 Correct 359 ms 35968 KB Output is correct
13 Correct 186 ms 792 KB Output is correct
14 Correct 0 ms 412 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 672 KB Output is correct
2 Correct 147 ms 648 KB Output is correct
3 Correct 258 ms 13308 KB Output is correct
4 Correct 180 ms 728 KB Output is correct
5 Correct 280 ms 9960 KB Output is correct
6 Correct 162 ms 812 KB Output is correct
7 Correct 157 ms 752 KB Output is correct
8 Correct 146 ms 760 KB Output is correct
9 Correct 272 ms 19496 KB Output is correct
10 Correct 249 ms 19456 KB Output is correct
11 Correct 446 ms 38404 KB Output is correct
12 Correct 359 ms 35968 KB Output is correct
13 Correct 186 ms 792 KB Output is correct
14 Correct 0 ms 412 KB Output is correct
15 Correct 184 ms 716 KB Output is correct
16 Correct 294 ms 700 KB Output is correct
17 Correct 152 ms 784 KB Output is correct
18 Correct 290 ms 9916 KB Output is correct
19 Correct 241 ms 744 KB Output is correct
20 Correct 307 ms 10176 KB Output is correct
21 Correct 119 ms 796 KB Output is correct
22 Correct 190 ms 936 KB Output is correct
23 Correct 229 ms 22280 KB Output is correct
24 Correct 338 ms 22344 KB Output is correct
25 Correct 494 ms 44064 KB Output is correct
26 Correct 396 ms 40644 KB Output is correct
27 Correct 179 ms 832 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 672 KB Output is correct
2 Correct 147 ms 648 KB Output is correct
3 Correct 258 ms 13308 KB Output is correct
4 Correct 180 ms 728 KB Output is correct
5 Correct 280 ms 9960 KB Output is correct
6 Correct 162 ms 812 KB Output is correct
7 Correct 157 ms 752 KB Output is correct
8 Correct 146 ms 760 KB Output is correct
9 Correct 272 ms 19496 KB Output is correct
10 Correct 249 ms 19456 KB Output is correct
11 Correct 446 ms 38404 KB Output is correct
12 Correct 359 ms 35968 KB Output is correct
13 Correct 186 ms 792 KB Output is correct
14 Correct 0 ms 412 KB Output is correct
15 Correct 184 ms 716 KB Output is correct
16 Correct 294 ms 700 KB Output is correct
17 Correct 152 ms 784 KB Output is correct
18 Correct 290 ms 9916 KB Output is correct
19 Correct 241 ms 744 KB Output is correct
20 Correct 307 ms 10176 KB Output is correct
21 Correct 119 ms 796 KB Output is correct
22 Correct 190 ms 936 KB Output is correct
23 Correct 229 ms 22280 KB Output is correct
24 Correct 338 ms 22344 KB Output is correct
25 Correct 494 ms 44064 KB Output is correct
26 Correct 396 ms 40644 KB Output is correct
27 Correct 179 ms 832 KB Output is correct
28 Correct 275 ms 752 KB Output is correct
29 Correct 259 ms 860 KB Output is correct
30 Correct 441 ms 24068 KB Output is correct
31 Correct 189 ms 828 KB Output is correct
32 Correct 455 ms 20924 KB Output is correct
33 Correct 222 ms 800 KB Output is correct
34 Correct 292 ms 976 KB Output is correct
35 Correct 232 ms 984 KB Output is correct
36 Correct 402 ms 25012 KB Output is correct
37 Correct 409 ms 25192 KB Output is correct
38 Correct 486 ms 49304 KB Output is correct
39 Correct 513 ms 46976 KB Output is correct
40 Correct 263 ms 932 KB Output is correct

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 321 ms 876 KB Output is correct
2 Correct 0 ms 400 KB Output is correct
3 Correct 345 ms 788 KB Output is correct
4 Correct 459 ms 10116 KB Output is correct
5 Correct 24 ms 848 KB Output is correct
6 Correct 370 ms 2496 KB Output is correct
7 Correct 0 ms 400 KB Output is correct
8 Correct 327 ms 984 KB Output is correct
9 Correct 381 ms 1144 KB Output is correct
10 Correct 487 ms 27784 KB Output is correct
11 Correct 522 ms 24544 KB Output is correct
12 Correct 74 ms 632 KB Output is correct
13 Correct 445 ms 24704 KB Output is correct
14 Correct 341 ms 820 KB Output is correct
15 Correct 0 ms 400 KB Output is correct
16 Correct 275 ms 756 KB Output is correct
17 Correct 297 ms 868 KB Output is correct
18 Correct 323 ms 852 KB Output is correct
19 Correct 285 ms 956 KB Output is correct
20 Correct 312 ms 1036 KB Output is correct
21 Correct 307 ms 668 KB Output is correct
22 Correct 404 ms 796 KB Output is correct
23 Correct 350 ms 880 KB Output is correct
24 Correct 135 ms 672 KB Output is correct
25 Correct 147 ms 648 KB Output is correct
26 Correct 258 ms 13308 KB Output is correct
27 Correct 180 ms 728 KB Output is correct
28 Correct 280 ms 9960 KB Output is correct
29 Correct 162 ms 812 KB Output is correct
30 Correct 157 ms 752 KB Output is correct
31 Correct 146 ms 760 KB Output is correct
32 Correct 272 ms 19496 KB Output is correct
33 Correct 249 ms 19456 KB Output is correct
34 Correct 446 ms 38404 KB Output is correct
35 Correct 359 ms 35968 KB Output is correct
36 Correct 186 ms 792 KB Output is correct
37 Correct 0 ms 412 KB Output is correct
38 Correct 184 ms 716 KB Output is correct
39 Correct 294 ms 700 KB Output is correct
40 Correct 152 ms 784 KB Output is correct
41 Correct 290 ms 9916 KB Output is correct
42 Correct 241 ms 744 KB Output is correct
43 Correct 307 ms 10176 KB Output is correct
44 Correct 119 ms 796 KB Output is correct
45 Correct 190 ms 936 KB Output is correct
46 Correct 229 ms 22280 KB Output is correct
47 Correct 338 ms 22344 KB Output is correct
48 Correct 494 ms 44064 KB Output is correct
49 Correct 396 ms 40644 KB Output is correct
50 Correct 179 ms 832 KB Output is correct
51 Correct 275 ms 752 KB Output is correct
52 Correct 259 ms 860 KB Output is correct
53 Correct 441 ms 24068 KB Output is correct
54 Correct 189 ms 828 KB Output is correct
55 Correct 455 ms 20924 KB Output is correct
56 Correct 222 ms 800 KB Output is correct
57 Correct 292 ms 976 KB Output is correct
58 Correct 232 ms 984 KB Output is correct
59 Correct 402 ms 25012 KB Output is correct
60 Correct 409 ms 25192 KB Output is correct
61 Correct 486 ms 49304 KB Output is correct
62 Correct 513 ms 46976 KB Output is correct
63 Correct 263 ms 932 KB Output is correct
64 Correct 377 ms 1028 KB Output is correct
65 Runtime error 273 ms 13328 KB Execution killed with signal 13
66 Halted 0 ms 0 KB -