oj.uz

답안 #831828

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
831828 2023-08-20T15:49:23 Z NoName14159 Two Transportations (JOI19_transportations) C++17
100 / 100
 596 ms 49400 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{
		RE, // recommend edge
		DW, // determine winner
		SR, // send relax
		RX  // relax
	};
	Mode mode;
	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==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;
				}
				Send(9,rec.first);
				bits_next=9;
				return;
			}
			if(mode==DW){
				mode=SR;
				rec_other=Read(9);
				if(rec.first<=rec_other){
					winner=true;
				}else{
					winner=false;
				}
				if(!winner){
					bits_next=11;
					return;
				}
			}
			if(mode==SR){
				mode=RX;
				if(winner){
					Send(11,rec.second);
					relax_v=rec.second;
					relax_w+=rec.first;
				}else{
					relax_v=Read(11);
					relax_w+=rec_other;
				}
			}
			if(mode==RX){
				mode=RE;
				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++;
			}
		}
	}
}
void InitA(int N,int A,vi U,vi V,vi C){
	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=RE;
	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{
		RE, // recommend edge
		DW, // determine winner
		SR, // send relax
		RX  // relax
	};
	Mode mode;
	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==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;
				}
				Send(9,rec.first);
				bits_next=9;
				return;
			}
			if(mode==DW){
				mode=SR;
				rec_other=Read(9);
				if(rec.first<rec_other){
					winner=true;
				}else{
					winner=false;
				}
				if(!winner){
					bits_next=11;
					return;
				}
			}
			if(mode==SR){
				mode=RX;
				if(winner){
					Send(11,rec.second);
					relax_v=rec.second;
					relax_w+=rec.first;
				}else{
					relax_v=Read(11);
					relax_w+=rec_other;
				}
			}
			if(mode==RX){
				mode=RE;
				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++;
			}
		}
	}
}
void InitB(int N,int B,vi S,vi T,vi D){
	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=RE;
	Do();
}
void ReceiveB(bool x){
	buf[buf_size]=x;
	buf_size++;
	if(buf_size-buf_now==bits_next){
		Do();
	}
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 320 ms 800 KB Output is correct
2 Correct 1 ms 656 KB Output is correct
3 Correct 339 ms 828 KB Output is correct
4 Correct 332 ms 10088 KB Output is correct
5 Correct 23 ms 920 KB Output is correct
6 Correct 349 ms 2344 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 656 KB Output is correct
2 Correct 336 ms 860 KB Output is correct
3 Correct 362 ms 900 KB Output is correct
4 Correct 521 ms 27612 KB Output is correct
5 Correct 372 ms 24404 KB Output is correct
6 Correct 68 ms 704 KB Output is correct
7 Correct 424 ms 24544 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 331 ms 832 KB Output is correct
2 Correct 0 ms 656 KB Output is correct
3 Correct 288 ms 788 KB Output is correct
4 Correct 350 ms 988 KB Output is correct
5 Correct 385 ms 1096 KB Output is correct
6 Correct 346 ms 1084 KB Output is correct
7 Correct 345 ms 900 KB Output is correct
8 Correct 348 ms 904 KB Output is correct
9 Correct 390 ms 800 KB Output is correct
10 Correct 390 ms 828 KB Output is correct

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 150 ms 720 KB Output is correct
2 Correct 174 ms 716 KB Output is correct
3 Correct 253 ms 13304 KB Output is correct
4 Correct 116 ms 712 KB Output is correct
5 Correct 227 ms 10096 KB Output is correct
6 Correct 155 ms 732 KB Output is correct
7 Correct 175 ms 856 KB Output is correct
8 Correct 141 ms 792 KB Output is correct
9 Correct 273 ms 19428 KB Output is correct
10 Correct 252 ms 19720 KB Output is correct
11 Correct 351 ms 38396 KB Output is correct
12 Correct 298 ms 36052 KB Output is correct
13 Correct 156 ms 836 KB Output is correct
14 Correct 0 ms 656 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 150 ms 720 KB Output is correct
2 Correct 174 ms 716 KB Output is correct
3 Correct 253 ms 13304 KB Output is correct
4 Correct 116 ms 712 KB Output is correct
5 Correct 227 ms 10096 KB Output is correct
6 Correct 155 ms 732 KB Output is correct
7 Correct 175 ms 856 KB Output is correct
8 Correct 141 ms 792 KB Output is correct
9 Correct 273 ms 19428 KB Output is correct
10 Correct 252 ms 19720 KB Output is correct
11 Correct 351 ms 38396 KB Output is correct
12 Correct 298 ms 36052 KB Output is correct
13 Correct 156 ms 836 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 188 ms 872 KB Output is correct
16 Correct 140 ms 724 KB Output is correct
17 Correct 167 ms 728 KB Output is correct
18 Correct 228 ms 10108 KB Output is correct
19 Correct 192 ms 784 KB Output is correct
20 Correct 263 ms 10300 KB Output is correct
21 Correct 160 ms 868 KB Output is correct
22 Correct 203 ms 836 KB Output is correct
23 Correct 316 ms 22400 KB Output is correct
24 Correct 315 ms 22776 KB Output is correct
25 Correct 465 ms 44044 KB Output is correct
26 Correct 417 ms 40536 KB Output is correct
27 Correct 190 ms 888 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 150 ms 720 KB Output is correct
2 Correct 174 ms 716 KB Output is correct
3 Correct 253 ms 13304 KB Output is correct
4 Correct 116 ms 712 KB Output is correct
5 Correct 227 ms 10096 KB Output is correct
6 Correct 155 ms 732 KB Output is correct
7 Correct 175 ms 856 KB Output is correct
8 Correct 141 ms 792 KB Output is correct
9 Correct 273 ms 19428 KB Output is correct
10 Correct 252 ms 19720 KB Output is correct
11 Correct 351 ms 38396 KB Output is correct
12 Correct 298 ms 36052 KB Output is correct
13 Correct 156 ms 836 KB Output is correct
14 Correct 0 ms 656 KB Output is correct
15 Correct 188 ms 872 KB Output is correct
16 Correct 140 ms 724 KB Output is correct
17 Correct 167 ms 728 KB Output is correct
18 Correct 228 ms 10108 KB Output is correct
19 Correct 192 ms 784 KB Output is correct
20 Correct 263 ms 10300 KB Output is correct
21 Correct 160 ms 868 KB Output is correct
22 Correct 203 ms 836 KB Output is correct
23 Correct 316 ms 22400 KB Output is correct
24 Correct 315 ms 22776 KB Output is correct
25 Correct 465 ms 44044 KB Output is correct
26 Correct 417 ms 40536 KB Output is correct
27 Correct 190 ms 888 KB Output is correct
28 Correct 231 ms 772 KB Output is correct
29 Correct 248 ms 736 KB Output is correct
30 Correct 406 ms 24064 KB Output is correct
31 Correct 246 ms 868 KB Output is correct
32 Correct 373 ms 21012 KB Output is correct
33 Correct 200 ms 828 KB Output is correct
34 Correct 206 ms 872 KB Output is correct
35 Correct 271 ms 880 KB Output is correct
36 Correct 351 ms 25232 KB Output is correct
37 Correct 341 ms 24992 KB Output is correct
38 Correct 451 ms 49400 KB Output is correct
39 Correct 458 ms 46960 KB Output is correct
40 Correct 220 ms 1088 KB Output is correct

Subtask #7
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 320 ms 800 KB Output is correct
2 Correct 1 ms 656 KB Output is correct
3 Correct 339 ms 828 KB Output is correct
4 Correct 332 ms 10088 KB Output is correct
5 Correct 23 ms 920 KB Output is correct
6 Correct 349 ms 2344 KB Output is correct
7 Correct 0 ms 656 KB Output is correct
8 Correct 336 ms 860 KB Output is correct
9 Correct 362 ms 900 KB Output is correct
10 Correct 521 ms 27612 KB Output is correct
11 Correct 372 ms 24404 KB Output is correct
12 Correct 68 ms 704 KB Output is correct
13 Correct 424 ms 24544 KB Output is correct
14 Correct 331 ms 832 KB Output is correct
15 Correct 0 ms 656 KB Output is correct
16 Correct 288 ms 788 KB Output is correct
17 Correct 350 ms 988 KB Output is correct
18 Correct 385 ms 1096 KB Output is correct
19 Correct 346 ms 1084 KB Output is correct
20 Correct 345 ms 900 KB Output is correct
21 Correct 348 ms 904 KB Output is correct
22 Correct 390 ms 800 KB Output is correct
23 Correct 390 ms 828 KB Output is correct
24 Correct 150 ms 720 KB Output is correct
25 Correct 174 ms 716 KB Output is correct
26 Correct 253 ms 13304 KB Output is correct
27 Correct 116 ms 712 KB Output is correct
28 Correct 227 ms 10096 KB Output is correct
29 Correct 155 ms 732 KB Output is correct
30 Correct 175 ms 856 KB Output is correct
31 Correct 141 ms 792 KB Output is correct
32 Correct 273 ms 19428 KB Output is correct
33 Correct 252 ms 19720 KB Output is correct
34 Correct 351 ms 38396 KB Output is correct
35 Correct 298 ms 36052 KB Output is correct
36 Correct 156 ms 836 KB Output is correct
37 Correct 0 ms 656 KB Output is correct
38 Correct 188 ms 872 KB Output is correct
39 Correct 140 ms 724 KB Output is correct
40 Correct 167 ms 728 KB Output is correct
41 Correct 228 ms 10108 KB Output is correct
42 Correct 192 ms 784 KB Output is correct
43 Correct 263 ms 10300 KB Output is correct
44 Correct 160 ms 868 KB Output is correct
45 Correct 203 ms 836 KB Output is correct
46 Correct 316 ms 22400 KB Output is correct
47 Correct 315 ms 22776 KB Output is correct
48 Correct 465 ms 44044 KB Output is correct
49 Correct 417 ms 40536 KB Output is correct
50 Correct 190 ms 888 KB Output is correct
51 Correct 231 ms 772 KB Output is correct
52 Correct 248 ms 736 KB Output is correct
53 Correct 406 ms 24064 KB Output is correct
54 Correct 246 ms 868 KB Output is correct
55 Correct 373 ms 21012 KB Output is correct
56 Correct 200 ms 828 KB Output is correct
57 Correct 206 ms 872 KB Output is correct
58 Correct 271 ms 880 KB Output is correct
59 Correct 351 ms 25232 KB Output is correct
60 Correct 341 ms 24992 KB Output is correct
61 Correct 451 ms 49400 KB Output is correct
62 Correct 458 ms 46960 KB Output is correct
63 Correct 220 ms 1088 KB Output is correct
64 Correct 346 ms 1020 KB Output is correct
65 Correct 544 ms 26508 KB Output is correct
66 Correct 504 ms 23320 KB Output is correct
67 Correct 329 ms 1116 KB Output is correct
68 Correct 294 ms 1104 KB Output is correct
69 Correct 596 ms 48476 KB Output is correct
70 Correct 538 ms 41248 KB Output is correct
71 Correct 409 ms 5508 KB Output is correct
72 Correct 424 ms 1468 KB Output is correct