oj.uz

Submission #831129

# Submission time Handle Problem Language Result Execution time Memory
831129 2023-08-19T19:16:38 Z NoName14159 Two Transportations (JOI19_transportations) C++14
84 / 100
 614 ms 49648 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

# Verdict Execution time Memory Grader output
1 Correct 281 ms 876 KB Output is correct
2 Correct 0 ms 400 KB Output is correct
3 Correct 339 ms 892 KB Output is correct
4 Correct 424 ms 10088 KB Output is correct
5 Correct 18 ms 856 KB Output is correct
6 Correct 331 ms 2584 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 300 ms 992 KB Output is correct
3 Correct 351 ms 1148 KB Output is correct
4 Correct 614 ms 27700 KB Output is correct
5 Correct 436 ms 24508 KB Output is correct
6 Correct 85 ms 644 KB Output is correct
7 Correct 562 ms 24660 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 315 ms 832 KB Output is correct
2 Correct 0 ms 400 KB Output is correct
3 Correct 263 ms 876 KB Output is correct
4 Correct 406 ms 988 KB Output is correct
5 Correct 315 ms 972 KB Output is correct
6 Correct 446 ms 972 KB Output is correct
7 Correct 304 ms 784 KB Output is correct
8 Correct 394 ms 892 KB Output is correct
9 Correct 416 ms 772 KB Output is correct
10 Correct 396 ms 792 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 162 ms 680 KB Output is correct
2 Correct 187 ms 680 KB Output is correct
3 Correct 301 ms 13256 KB Output is correct
4 Correct 144 ms 808 KB Output is correct
5 Correct 292 ms 9884 KB Output is correct
6 Correct 160 ms 688 KB Output is correct
7 Correct 152 ms 760 KB Output is correct
8 Correct 172 ms 884 KB Output is correct
9 Correct 243 ms 19496 KB Output is correct
10 Correct 318 ms 19448 KB Output is correct
11 Correct 422 ms 38228 KB Output is correct
12 Correct 380 ms 35832 KB Output is correct
13 Correct 123 ms 792 KB Output is correct
14 Correct 0 ms 400 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 162 ms 680 KB Output is correct
2 Correct 187 ms 680 KB Output is correct
3 Correct 301 ms 13256 KB Output is correct
4 Correct 144 ms 808 KB Output is correct
5 Correct 292 ms 9884 KB Output is correct
6 Correct 160 ms 688 KB Output is correct
7 Correct 152 ms 760 KB Output is correct
8 Correct 172 ms 884 KB Output is correct
9 Correct 243 ms 19496 KB Output is correct
10 Correct 318 ms 19448 KB Output is correct
11 Correct 422 ms 38228 KB Output is correct
12 Correct 380 ms 35832 KB Output is correct
13 Correct 123 ms 792 KB Output is correct
14 Correct 0 ms 400 KB Output is correct
15 Correct 188 ms 676 KB Output is correct
16 Correct 252 ms 684 KB Output is correct
17 Correct 157 ms 784 KB Output is correct
18 Correct 247 ms 10000 KB Output is correct
19 Correct 248 ms 860 KB Output is correct
20 Correct 307 ms 10200 KB Output is correct
21 Correct 239 ms 788 KB Output is correct
22 Correct 230 ms 804 KB Output is correct
23 Correct 248 ms 22380 KB Output is correct
24 Correct 326 ms 22368 KB Output is correct
25 Correct 494 ms 44148 KB Output is correct
26 Correct 446 ms 40636 KB Output is correct
27 Correct 185 ms 996 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 162 ms 680 KB Output is correct
2 Correct 187 ms 680 KB Output is correct
3 Correct 301 ms 13256 KB Output is correct
4 Correct 144 ms 808 KB Output is correct
5 Correct 292 ms 9884 KB Output is correct
6 Correct 160 ms 688 KB Output is correct
7 Correct 152 ms 760 KB Output is correct
8 Correct 172 ms 884 KB Output is correct
9 Correct 243 ms 19496 KB Output is correct
10 Correct 318 ms 19448 KB Output is correct
11 Correct 422 ms 38228 KB Output is correct
12 Correct 380 ms 35832 KB Output is correct
13 Correct 123 ms 792 KB Output is correct
14 Correct 0 ms 400 KB Output is correct
15 Correct 188 ms 676 KB Output is correct
16 Correct 252 ms 684 KB Output is correct
17 Correct 157 ms 784 KB Output is correct
18 Correct 247 ms 10000 KB Output is correct
19 Correct 248 ms 860 KB Output is correct
20 Correct 307 ms 10200 KB Output is correct
21 Correct 239 ms 788 KB Output is correct
22 Correct 230 ms 804 KB Output is correct
23 Correct 248 ms 22380 KB Output is correct
24 Correct 326 ms 22368 KB Output is correct
25 Correct 494 ms 44148 KB Output is correct
26 Correct 446 ms 40636 KB Output is correct
27 Correct 185 ms 996 KB Output is correct
28 Correct 306 ms 748 KB Output is correct
29 Correct 216 ms 616 KB Output is correct
30 Correct 441 ms 24100 KB Output is correct
31 Correct 259 ms 968 KB Output is correct
32 Correct 370 ms 20924 KB Output is correct
33 Correct 156 ms 808 KB Output is correct
34 Correct 262 ms 788 KB Output is correct
35 Correct 260 ms 1100 KB Output is correct
36 Correct 341 ms 24780 KB Output is correct
37 Correct 352 ms 25120 KB Output is correct
38 Correct 547 ms 49648 KB Output is correct
39 Correct 462 ms 47048 KB Output is correct
40 Correct 311 ms 1040 KB Output is correct

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 281 ms 876 KB Output is correct
2 Correct 0 ms 400 KB Output is correct
3 Correct 339 ms 892 KB Output is correct
4 Correct 424 ms 10088 KB Output is correct
5 Correct 18 ms 856 KB Output is correct
6 Correct 331 ms 2584 KB Output is correct
7 Correct 0 ms 400 KB Output is correct
8 Correct 300 ms 992 KB Output is correct
9 Correct 351 ms 1148 KB Output is correct
10 Correct 614 ms 27700 KB Output is correct
11 Correct 436 ms 24508 KB Output is correct
12 Correct 85 ms 644 KB Output is correct
13 Correct 562 ms 24660 KB Output is correct
14 Correct 315 ms 832 KB Output is correct
15 Correct 0 ms 400 KB Output is correct
16 Correct 263 ms 876 KB Output is correct
17 Correct 406 ms 988 KB Output is correct
18 Correct 315 ms 972 KB Output is correct
19 Correct 446 ms 972 KB Output is correct
20 Correct 304 ms 784 KB Output is correct
21 Correct 394 ms 892 KB Output is correct
22 Correct 416 ms 772 KB Output is correct
23 Correct 396 ms 792 KB Output is correct
24 Correct 162 ms 680 KB Output is correct
25 Correct 187 ms 680 KB Output is correct
26 Correct 301 ms 13256 KB Output is correct
27 Correct 144 ms 808 KB Output is correct
28 Correct 292 ms 9884 KB Output is correct
29 Correct 160 ms 688 KB Output is correct
30 Correct 152 ms 760 KB Output is correct
31 Correct 172 ms 884 KB Output is correct
32 Correct 243 ms 19496 KB Output is correct
33 Correct 318 ms 19448 KB Output is correct
34 Correct 422 ms 38228 KB Output is correct
35 Correct 380 ms 35832 KB Output is correct
36 Correct 123 ms 792 KB Output is correct
37 Correct 0 ms 400 KB Output is correct
38 Correct 188 ms 676 KB Output is correct
39 Correct 252 ms 684 KB Output is correct
40 Correct 157 ms 784 KB Output is correct
41 Correct 247 ms 10000 KB Output is correct
42 Correct 248 ms 860 KB Output is correct
43 Correct 307 ms 10200 KB Output is correct
44 Correct 239 ms 788 KB Output is correct
45 Correct 230 ms 804 KB Output is correct
46 Correct 248 ms 22380 KB Output is correct
47 Correct 326 ms 22368 KB Output is correct
48 Correct 494 ms 44148 KB Output is correct
49 Correct 446 ms 40636 KB Output is correct
50 Correct 185 ms 996 KB Output is correct
51 Correct 306 ms 748 KB Output is correct
52 Correct 216 ms 616 KB Output is correct
53 Correct 441 ms 24100 KB Output is correct
54 Correct 259 ms 968 KB Output is correct
55 Correct 370 ms 20924 KB Output is correct
56 Correct 156 ms 808 KB Output is correct
57 Correct 262 ms 788 KB Output is correct
58 Correct 260 ms 1100 KB Output is correct
59 Correct 341 ms 24780 KB Output is correct
60 Correct 352 ms 25120 KB Output is correct
61 Correct 547 ms 49648 KB Output is correct
62 Correct 462 ms 47048 KB Output is correct
63 Correct 311 ms 1040 KB Output is correct
64 Correct 288 ms 1036 KB Output is correct
65 Runtime error 332 ms 21456 KB Execution killed with signal 6
66 Halted 0 ms 0 KB -