oj.uz

Submission #767311

# Submission time Handle Problem Language Result Execution time Memory
767311 2023-06-26T15:27:46 Z minhcool Two Transportations (JOI19_transportations) C++17
100 / 100
 612 ms 62900 KB 
#include "Azer.h"
#define local
#ifndef local
#include ""
#endif
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

//#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;

const int N = 3e5 + 5;

const int oo = 1e9 + 7, mod = 1e9 + 7;

//mt19937 rng(1);

/*
int rnd(int l, int r){
	int temp = rng() % (r - l + 1);
	return abs(temp) + l;
}*/

/*
Algo: 
N times: A gives B the value (x - lst) (lst = last value)
         B gives A the value (y - lst)
if(x < y) -> A give info to B, else B give info to A
Just like that.
*/

int n;
vector<ii> Adj[N];
vector<iii> edges;

priority_queue<ii, vector<ii>, greater<ii>> pq1;

void send1(int x, int bits){
	for(int i = 0; i < bits; i++){
		SendA((x & (1LL << (bits - i - 1))) != 0);
	}
}

int answer[N];
bool done[N];

int phase, rem;
int lst, pls, node;
int a = 0, b = 0;

void InitA(int N, int A, vector<int> U, vector<int> V, vector<int> C) {
	n = N;
	for(int i = 1; i < n; i++) answer[i] = oo;
  	for(int i = 0; i < A; i++){
  		Adj[U[i]].pb({V[i], C[i]});
		Adj[V[i]].pb({U[i], C[i]});	
		//edges.pb({{U[i], V[i]}, C[i]});
	}
	for(auto it : Adj[0]){
		int v = it.fi, w = it.se;
		if(answer[v] > answer[b] + w){
			answer[v] = answer[b] + w;
			pq1.push({answer[v], v});
		}
	}
	phase = 0, rem = 9;
	pls = 511, node = 2047;
	while(!pq1.empty()){
		int u = pq1.top().se, d = pq1.top().fi;
		if(done[u]){
			pq1.pop();
			continue;
		}
		//send1(d - lst, 9);
		pls = d - lst;
		node = u;
		break;
	}
	done[0] = 1;
	send1(pls, 9);
}

void ReceiveA(bool x) {
//	cout << phase << " " << rem << "\n";
	rem--;
	if(!phase) a = a * 2 + x;
	else b = b * 2 + x;
	if(rem) return;
	if(!phase){
	//	cout << "COMPARING " << a << " " << pls << "\n";
		if(pls < a){
			send1(node, 11); 
		}
		else{
			//a = pls;
			phase = 1;
			rem = 11;
			return;
		}
	}
//	cout << "OK\n";
	if(a > pls) b = node;
	a = min(a, pls);
	answer[b] = a + lst;
	lst += a;
	//cout << "DONE " << b << "\n";
	done[b] = 1;
	for(auto it : Adj[b]){
		int v = it.fi, w = it.se;
		if(answer[v] > answer[b] + w){
			answer[v] = answer[b] + w;
			pq1.push({answer[v], v});
		}
	}
	bool ck = 0;
	for(int i = 0; i < n; i++) ck |= (!done[i]);
	if(!ck) return;
//	lst = a;
	a = b = 0;		
	phase = 0, rem = 9;
	pls = 511, node = 2047;
	while(!pq1.empty()){
		int u = pq1.top().se, d = pq1.top().fi;
		if(done[u]){
			pq1.pop();
			continue;
		}
		//send1(d - lst, 9);
		pls = d - lst;
		phase = 0;
		rem = 9;
		node = u;
		break;
	}
//	if(pq1.empty() && pls == 511) return;
//	cout << "CAN A " << lst << " " << node << " " << pls << "\n";
	send1(pls, 9);
}

vector<int> Answer() {
	vector<int> v;
	for(int i = 0; i < n; i++) v.pb(answer[i]);
	return v;
}
#include "Baijan.h"
#define local
#ifndef local
#include ""
#endif
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

//#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;

const int N = 3e5 + 5;

const int oo = 1e9 + 7, mod = 1e9 + 7;

mt19937 rng(1);

int rnd(int l, int r){
	int temp = rng() % (r - l + 1);
	return abs(temp) + l;
}

int n2;
vector<ii> Adj2[N];


priority_queue<ii, vector<ii>, greater<ii>> pq2;

int answer2[N], done2[N];

int aa = 0, bb = 0;
// lst length, phase 0/1, remmaining bits until done, minimum node, minimum dist - lst length
int lstt, phasee, remm, nodee, plss;

void InitB(int N, int B, vector<int> S, vector<int> T, vector<int> D) {
	n2 = N;
	for(int i = 1; i < N; i++) answer2[i] = oo;
	for(int i = 0; i < B; i++){
		Adj2[S[i]].pb({T[i], D[i]});
		Adj2[T[i]].pb({S[i], D[i]});
	}
	for(auto it : Adj2[0]){
		int v = it.fi, w = it.se;
		if(answer2[v] > answer2[0] + w){
			answer2[v] = answer2[0] + w;
			pq2.push({answer2[v], v});
		}
	}
	done2[0] = 1;
	lstt = 0, phasee = 0, remm = 9, nodee = (pq2.empty() ? 2047 : pq2.top().se), plss = (pq2.empty() ? 511 : pq2.top().fi);
}

//bool done2[N];

void send2(int x, int bits){
//	cout << "SEND " << x << "\n";
	for(int i = 0; i < bits; i++){
		SendB((x & (1LL << (bits - i - 1))) != 0);
	}
}

void ReceiveB(bool y) {
	remm--;
	if(!phasee) aa = aa * 2 + y;
	else bb = bb * 2 + y;
	if(remm) return;
	if(!phasee){
	//	cout << "COMPARING " << aa << " " << plss << "\n";
		send2(plss, 9);
		if(plss <= aa){
			send2(nodee, 11);
			phasee = 0, remm = 9;
		}
		else{
			phasee = 1, remm = 11;
			return;
		}
	}
	if(plss <= aa) bb = nodee;
	aa = min(aa, plss);
	lstt += aa;
	answer2[bb] = lstt;
	done2[bb] = 1;
	for(auto it : Adj2[bb]){
		int v = it.fi, w = it.se;
		if(answer2[v] > answer2[bb] + w){
			answer2[v] = answer2[bb] + w;
			pq2.push({answer2[v], v});
		}
	}
//	lstt = 
	aa = bb = 0;
	phasee = 0, remm = 9;
	plss = 511, nodee = 2047;
	while(!pq2.empty()){
		int u = pq2.top().se, d = pq2.top().fi;
	//	pq2.pop();
		if(done2[u]){
			pq2.pop();	
			continue;
		}
		//send1(d - lst, 9);
		plss = d - lstt;
		phasee = 0;
		remm = 9;
		nodee = u;
		break;
	}
//	cout << "CAN B " << lstt << " " << nodee << " " << plss << "\n";
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 413 ms 14708 KB Output is correct
2 Correct 9 ms 14592 KB Output is correct
3 Correct 444 ms 14840 KB Output is correct
4 Correct 436 ms 24176 KB Output is correct
5 Correct 28 ms 14736 KB Output is correct
6 Correct 380 ms 16236 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14600 KB Output is correct
2 Correct 393 ms 14796 KB Output is correct
3 Correct 441 ms 14912 KB Output is correct
4 Correct 441 ms 41596 KB Output is correct
5 Correct 591 ms 38076 KB Output is correct
6 Correct 93 ms 14708 KB Output is correct
7 Correct 521 ms 38432 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 310 ms 14832 KB Output is correct
2 Correct 8 ms 14588 KB Output is correct
3 Correct 451 ms 14708 KB Output is correct
4 Correct 311 ms 14900 KB Output is correct
5 Correct 375 ms 14856 KB Output is correct
6 Correct 397 ms 14788 KB Output is correct
7 Correct 337 ms 14796 KB Output is correct
8 Correct 418 ms 14716 KB Output is correct
9 Correct 458 ms 14808 KB Output is correct
10 Correct 456 ms 14836 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 14736 KB Output is correct
2 Correct 144 ms 14704 KB Output is correct
3 Correct 247 ms 27204 KB Output is correct
4 Correct 213 ms 14780 KB Output is correct
5 Correct 279 ms 24052 KB Output is correct
6 Correct 216 ms 14744 KB Output is correct
7 Correct 215 ms 14736 KB Output is correct
8 Correct 210 ms 14736 KB Output is correct
9 Correct 228 ms 32104 KB Output is correct
10 Correct 283 ms 32264 KB Output is correct
11 Correct 393 ms 49608 KB Output is correct
12 Correct 312 ms 44700 KB Output is correct
13 Correct 229 ms 14712 KB Output is correct
14 Correct 9 ms 14480 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 14736 KB Output is correct
2 Correct 144 ms 14704 KB Output is correct
3 Correct 247 ms 27204 KB Output is correct
4 Correct 213 ms 14780 KB Output is correct
5 Correct 279 ms 24052 KB Output is correct
6 Correct 216 ms 14744 KB Output is correct
7 Correct 215 ms 14736 KB Output is correct
8 Correct 210 ms 14736 KB Output is correct
9 Correct 228 ms 32104 KB Output is correct
10 Correct 283 ms 32264 KB Output is correct
11 Correct 393 ms 49608 KB Output is correct
12 Correct 312 ms 44700 KB Output is correct
13 Correct 229 ms 14712 KB Output is correct
14 Correct 9 ms 14480 KB Output is correct
15 Correct 161 ms 14748 KB Output is correct
16 Correct 224 ms 14752 KB Output is correct
17 Correct 191 ms 14644 KB Output is correct
18 Correct 312 ms 24140 KB Output is correct
19 Correct 293 ms 14816 KB Output is correct
20 Correct 305 ms 24332 KB Output is correct
21 Correct 248 ms 14856 KB Output is correct
22 Correct 270 ms 14724 KB Output is correct
23 Correct 369 ms 36144 KB Output is correct
24 Correct 294 ms 36208 KB Output is correct
25 Correct 476 ms 57564 KB Output is correct
26 Correct 413 ms 50408 KB Output is correct
27 Correct 219 ms 14812 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 14736 KB Output is correct
2 Correct 144 ms 14704 KB Output is correct
3 Correct 247 ms 27204 KB Output is correct
4 Correct 213 ms 14780 KB Output is correct
5 Correct 279 ms 24052 KB Output is correct
6 Correct 216 ms 14744 KB Output is correct
7 Correct 215 ms 14736 KB Output is correct
8 Correct 210 ms 14736 KB Output is correct
9 Correct 228 ms 32104 KB Output is correct
10 Correct 283 ms 32264 KB Output is correct
11 Correct 393 ms 49608 KB Output is correct
12 Correct 312 ms 44700 KB Output is correct
13 Correct 229 ms 14712 KB Output is correct
14 Correct 9 ms 14480 KB Output is correct
15 Correct 161 ms 14748 KB Output is correct
16 Correct 224 ms 14752 KB Output is correct
17 Correct 191 ms 14644 KB Output is correct
18 Correct 312 ms 24140 KB Output is correct
19 Correct 293 ms 14816 KB Output is correct
20 Correct 305 ms 24332 KB Output is correct
21 Correct 248 ms 14856 KB Output is correct
22 Correct 270 ms 14724 KB Output is correct
23 Correct 369 ms 36144 KB Output is correct
24 Correct 294 ms 36208 KB Output is correct
25 Correct 476 ms 57564 KB Output is correct
26 Correct 413 ms 50408 KB Output is correct
27 Correct 219 ms 14812 KB Output is correct
28 Correct 358 ms 14760 KB Output is correct
29 Correct 281 ms 14776 KB Output is correct
30 Correct 423 ms 38068 KB Output is correct
31 Correct 236 ms 14712 KB Output is correct
32 Correct 399 ms 35068 KB Output is correct
33 Correct 230 ms 14784 KB Output is correct
34 Correct 320 ms 14812 KB Output is correct
35 Correct 330 ms 14824 KB Output is correct
36 Correct 432 ms 38664 KB Output is correct
37 Correct 408 ms 38712 KB Output is correct
38 Correct 520 ms 62900 KB Output is correct
39 Correct 488 ms 58264 KB Output is correct
40 Correct 320 ms 14860 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 413 ms 14708 KB Output is correct
2 Correct 9 ms 14592 KB Output is correct
3 Correct 444 ms 14840 KB Output is correct
4 Correct 436 ms 24176 KB Output is correct
5 Correct 28 ms 14736 KB Output is correct
6 Correct 380 ms 16236 KB Output is correct
7 Correct 9 ms 14600 KB Output is correct
8 Correct 393 ms 14796 KB Output is correct
9 Correct 441 ms 14912 KB Output is correct
10 Correct 441 ms 41596 KB Output is correct
11 Correct 591 ms 38076 KB Output is correct
12 Correct 93 ms 14708 KB Output is correct
13 Correct 521 ms 38432 KB Output is correct
14 Correct 310 ms 14832 KB Output is correct
15 Correct 8 ms 14588 KB Output is correct
16 Correct 451 ms 14708 KB Output is correct
17 Correct 311 ms 14900 KB Output is correct
18 Correct 375 ms 14856 KB Output is correct
19 Correct 397 ms 14788 KB Output is correct
20 Correct 337 ms 14796 KB Output is correct
21 Correct 418 ms 14716 KB Output is correct
22 Correct 458 ms 14808 KB Output is correct
23 Correct 456 ms 14836 KB Output is correct
24 Correct 148 ms 14736 KB Output is correct
25 Correct 144 ms 14704 KB Output is correct
26 Correct 247 ms 27204 KB Output is correct
27 Correct 213 ms 14780 KB Output is correct
28 Correct 279 ms 24052 KB Output is correct
29 Correct 216 ms 14744 KB Output is correct
30 Correct 215 ms 14736 KB Output is correct
31 Correct 210 ms 14736 KB Output is correct
32 Correct 228 ms 32104 KB Output is correct
33 Correct 283 ms 32264 KB Output is correct
34 Correct 393 ms 49608 KB Output is correct
35 Correct 312 ms 44700 KB Output is correct
36 Correct 229 ms 14712 KB Output is correct
37 Correct 9 ms 14480 KB Output is correct
38 Correct 161 ms 14748 KB Output is correct
39 Correct 224 ms 14752 KB Output is correct
40 Correct 191 ms 14644 KB Output is correct
41 Correct 312 ms 24140 KB Output is correct
42 Correct 293 ms 14816 KB Output is correct
43 Correct 305 ms 24332 KB Output is correct
44 Correct 248 ms 14856 KB Output is correct
45 Correct 270 ms 14724 KB Output is correct
46 Correct 369 ms 36144 KB Output is correct
47 Correct 294 ms 36208 KB Output is correct
48 Correct 476 ms 57564 KB Output is correct
49 Correct 413 ms 50408 KB Output is correct
50 Correct 219 ms 14812 KB Output is correct
51 Correct 358 ms 14760 KB Output is correct
52 Correct 281 ms 14776 KB Output is correct
53 Correct 423 ms 38068 KB Output is correct
54 Correct 236 ms 14712 KB Output is correct
55 Correct 399 ms 35068 KB Output is correct
56 Correct 230 ms 14784 KB Output is correct
57 Correct 320 ms 14812 KB Output is correct
58 Correct 330 ms 14824 KB Output is correct
59 Correct 432 ms 38664 KB Output is correct
60 Correct 408 ms 38712 KB Output is correct
61 Correct 520 ms 62900 KB Output is correct
62 Correct 488 ms 58264 KB Output is correct
63 Correct 320 ms 14860 KB Output is correct
64 Correct 439 ms 15044 KB Output is correct
65 Correct 509 ms 40496 KB Output is correct
66 Correct 438 ms 37492 KB Output is correct
67 Correct 360 ms 14992 KB Output is correct
68 Correct 408 ms 14992 KB Output is correct
69 Correct 612 ms 61628 KB Output is correct
70 Correct 560 ms 53568 KB Output is correct
71 Correct 319 ms 19084 KB Output is correct
72 Correct 406 ms 15104 KB Output is correct