oj.uz

Submission #826702

# Submission time Handle Problem Language Result Execution time Memory
826702 2023-08-15T21:26:58 Z NoName14159 Two Transportations (JOI19_transportations) C++14
68 / 100
 632 ms 49452 KB 
#include "Azer.h"
#include <stdlib.h>
#include <iostream>
#include <cassert>
#include <queue>
#define MAXN 2000
#define MAXM 500000
#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[58000];
	int buf_size=0;
	int buf_now=0;
	int t=0;
	int bits;
	int Read(int bits){
		while(buf_size-buf_now<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){
			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=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=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=11;
					}else{
						bits=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{
						int temp=Read(20);
						relax_v=temp>>9;
						relax_w+=temp&((1<<9)-1);
					}
				}
			}
			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=1;
					return;
				}
			}
		}
	}
}
void InitA(int N,int A,vi U,vi V,vi C){
	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<58000);
	if(buf_size-buf_now>=bits){
		Do();
	}
}
vi Answer(){
	vi ans;
	LOOP(i,n){
		ans.pub(dis[i]);
	}
	return ans;
}
#include "Baijan.h"
#include <stdlib.h>
#include <iostream>
#include <cassert>
#include <queue>
#define MAXN 2000
#define MAXM 500000
#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[58000];
	int buf_size=0;
	int buf_now=0;
	int t=0;
	int bits;
	int Read(int bits){
		while(buf_size-buf_now<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){
			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=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=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=11;
					}else{
						bits=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{
						int temp=Read(20);
						relax_v=temp>>9;
						relax_w+=temp&((1<<9)-1);
					}
				}
			}
			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=1;
					return;
				}
			}
		}
	}
}
void InitB(int N,int B,vi U,vi V,vi C){
	srand(7749);
	n=N;
	LOOP(i,B){
		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=1;
}
void ReceiveB(bool x){
	buf[buf_size]=x;
	buf_size++;
	assert(buf_size<58000);
	if(buf_size-buf_now>=bits){
		Do();
	}
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 405 ms 952 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 325 ms 956 KB Output is correct
4 Correct 432 ms 10180 KB Output is correct
5 Correct 26 ms 956 KB Output is correct
6 Correct 391 ms 2520 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 656 KB Output is correct
2 Runtime error 210 ms 456 KB Execution killed with signal 13
3 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 392 ms 856 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 361 ms 1048 KB Output is correct
4 Runtime error 183 ms 452 KB Execution killed with signal 13
5 Halted 0 ms 0 KB -

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 180 ms 756 KB Output is correct
2 Correct 183 ms 736 KB Output is correct
3 Correct 294 ms 13200 KB Output is correct
4 Correct 92 ms 852 KB Output is correct
5 Correct 321 ms 10124 KB Output is correct
6 Correct 162 ms 752 KB Output is correct
7 Correct 188 ms 812 KB Output is correct
8 Correct 162 ms 824 KB Output is correct
9 Correct 203 ms 19448 KB Output is correct
10 Correct 280 ms 19964 KB Output is correct
11 Correct 457 ms 38568 KB Output is correct
12 Correct 399 ms 35800 KB Output is correct
13 Correct 185 ms 1100 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 180 ms 756 KB Output is correct
2 Correct 183 ms 736 KB Output is correct
3 Correct 294 ms 13200 KB Output is correct
4 Correct 92 ms 852 KB Output is correct
5 Correct 321 ms 10124 KB Output is correct
6 Correct 162 ms 752 KB Output is correct
7 Correct 188 ms 812 KB Output is correct
8 Correct 162 ms 824 KB Output is correct
9 Correct 203 ms 19448 KB Output is correct
10 Correct 280 ms 19964 KB Output is correct
11 Correct 457 ms 38568 KB Output is correct
12 Correct 399 ms 35800 KB Output is correct
13 Correct 185 ms 1100 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 205 ms 756 KB Output is correct
16 Correct 181 ms 732 KB Output is correct
17 Correct 211 ms 752 KB Output is correct
18 Correct 339 ms 10020 KB Output is correct
19 Correct 282 ms 808 KB Output is correct
20 Correct 285 ms 10372 KB Output is correct
21 Correct 178 ms 848 KB Output is correct
22 Correct 151 ms 840 KB Output is correct
23 Correct 303 ms 22444 KB Output is correct
24 Correct 350 ms 22472 KB Output is correct
25 Correct 541 ms 44176 KB Output is correct
26 Correct 454 ms 40508 KB Output is correct
27 Correct 240 ms 900 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 180 ms 756 KB Output is correct
2 Correct 183 ms 736 KB Output is correct
3 Correct 294 ms 13200 KB Output is correct
4 Correct 92 ms 852 KB Output is correct
5 Correct 321 ms 10124 KB Output is correct
6 Correct 162 ms 752 KB Output is correct
7 Correct 188 ms 812 KB Output is correct
8 Correct 162 ms 824 KB Output is correct
9 Correct 203 ms 19448 KB Output is correct
10 Correct 280 ms 19964 KB Output is correct
11 Correct 457 ms 38568 KB Output is correct
12 Correct 399 ms 35800 KB Output is correct
13 Correct 185 ms 1100 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 205 ms 756 KB Output is correct
16 Correct 181 ms 732 KB Output is correct
17 Correct 211 ms 752 KB Output is correct
18 Correct 339 ms 10020 KB Output is correct
19 Correct 282 ms 808 KB Output is correct
20 Correct 285 ms 10372 KB Output is correct
21 Correct 178 ms 848 KB Output is correct
22 Correct 151 ms 840 KB Output is correct
23 Correct 303 ms 22444 KB Output is correct
24 Correct 350 ms 22472 KB Output is correct
25 Correct 541 ms 44176 KB Output is correct
26 Correct 454 ms 40508 KB Output is correct
27 Correct 240 ms 900 KB Output is correct
28 Correct 267 ms 920 KB Output is correct
29 Correct 202 ms 664 KB Output is correct
30 Correct 452 ms 23916 KB Output is correct
31 Correct 236 ms 772 KB Output is correct
32 Correct 424 ms 21060 KB Output is correct
33 Correct 188 ms 848 KB Output is correct
34 Correct 186 ms 1024 KB Output is correct
35 Correct 236 ms 1044 KB Output is correct
36 Correct 329 ms 25144 KB Output is correct
37 Correct 403 ms 25148 KB Output is correct
38 Correct 632 ms 49452 KB Output is correct
39 Correct 487 ms 47236 KB Output is correct
40 Correct 324 ms 1216 KB Output is correct

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 405 ms 952 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 325 ms 956 KB Output is correct
4 Correct 432 ms 10180 KB Output is correct
5 Correct 26 ms 956 KB Output is correct
6 Correct 391 ms 2520 KB Output is correct
7 Correct 0 ms 656 KB Output is correct
8 Runtime error 210 ms 456 KB Execution killed with signal 13
9 Halted 0 ms 0 KB -