oj.uz

Submission #926651

# Submission time Handle Problem Language Result Execution time Memory
926651 2024-02-13T13:13:33 Z daoquanglinh2007 Two Transportations (JOI19_transportations) C++17
100 / 100
 637 ms 61072 KB 
#include "Azer.h"
#include <bits/stdc++.h>
using namespace std;

#define pii pair <int, int>
#define fi first
#define se second
#define mp make_pair

const int NM = 2000, inf = 1e9+7;

namespace Azer{
	int N;
	vector <pii> adj[NM+5];
	int d[NM+5];
	bool fix[NM+5];
	priority_queue <pii, vector <pii>, greater <pii> > Q;
	int p = 0, cur = 0, pre;
	int log_od = 0, log_op = 0, od = 0, op = 0;
	
	void Update(int u, int val){
		d[u] = val;
		fix[u] = 1;
		for (pii _ : adj[u]){
			int v = _.fi, w = _.se;
			if (fix[v]) continue;
			if (d[u]+w < d[v]){
				d[v] = d[u]+w;
				Q.push(mp(d[v], v));
			}
		}
		pre = val;
	}
	void Getcur(){
		cur = +inf;
		while (!Q.empty() && fix[Q.top().se]) Q.pop();
		if (!Q.empty()){
			p = Q.top().se;
			cur = d[p];
		}
	}
	void SendInt(int LOG, int x){
		for (int i = 0; i < LOG; i++)
			SendA((x>>i)&1);
	}
	void Init(int _N, int M, vector <int> U, vector <int> V, vector <int> C){
		N = _N;
		for (int i = 0; i < M; i++){
			adj[U[i]].push_back(mp(V[i], C[i]));
			adj[V[i]].push_back(mp(U[i], C[i]));
		}
		for (int i = 0; i < N; i++) d[i] = +inf;
		Update(0, 0);
		Getcur();
		if (cur == +inf) SendInt(9, (1<<9)-1); else SendInt(9, cur-pre);
	}
	void Receive(bool x){
		if (log_od < 9){
			if (x) od += (1<<log_od);
			log_od++;
		}
		if (log_od < 9) return;
		if (od == (1<<9)-1 && cur == +inf) return;
		if (cur-pre <= od){
			SendInt(11, p);
			Update(p, cur);
			Getcur();
			log_od = log_op = od = op = 0;
			if (cur == +inf) SendInt(9, (1<<9)-1); else SendInt(9, cur-pre);
			return;
		}
		log_od++;
		if (log_od == 10) return;
		if (x) op += (1<<log_op);
		log_op++;
		if (log_op == 11){
			Update(op, pre+od);
			Getcur();
			log_od = log_op = od = op = 0;
			if (cur == +inf) SendInt(9, (1<<9)-1); else SendInt(9, cur-pre);
		}
	}
	vector <int> Get(){
		vector <int> ans(N);
		for (int i = 0; i < N; i++) ans[i] = d[i];
		return ans;
	}
}

void InitA(int N, int A, vector <int> U, vector <int> V, vector <int> C){
	Azer::Init(N, A, U, V, C);
}

void ReceiveA(bool x){
	Azer::Receive(x);
}

vector <int> Answer(){
	return Azer::Get();
}
#include "Baijan.h"
#include <bits/stdc++.h>
using namespace std;

#define pii pair <int, int>
#define fi first
#define se second
#define mp make_pair

const int NM = 2000, inf = 1e9+7;

namespace Baijan{
	int N;
	vector <pii> adj[NM+5];
	int d[NM+5];
	bool fix[NM+5];
	priority_queue <pii, vector <pii>, greater <pii> > Q;
	int p = 0, cur = 0, pre;
	int log_od = 0, log_op = 0, od = 0, op = 0;
	
	void Update(int u, int val){
		d[u] = val;
		fix[u] = 1;
		for (pii _ : adj[u]){
			int v = _.fi, w = _.se;
			if (fix[v]) continue;
			if (d[u]+w < d[v]){
				d[v] = d[u]+w;
				Q.push(mp(d[v], v));
			}
		}
		pre = val;
	}
	void Getcur(){
		cur = +inf;
		while (!Q.empty() && fix[Q.top().se]) Q.pop();
		if (!Q.empty()){
			p = Q.top().se;
			cur = d[p];
		}
	}
	void SendInt(int LOG, int x){
		for (int i = 0; i < LOG; i++)
			SendB((x>>i)&1);
	}
	void Init(int _N, int M, vector <int> U, vector <int> V, vector <int> C){
		N = _N;
		for (int i = 0; i < M; i++){
			adj[U[i]].push_back(mp(V[i], C[i]));
			adj[V[i]].push_back(mp(U[i], C[i]));
		}
		for (int i = 0; i < N; i++) d[i] = +inf;
		Update(0, 0);
		Getcur();
		if (cur == +inf) SendInt(9, (1<<9)-1); else SendInt(9, cur-pre);
	}
	void Receive(bool x){
		if (log_od < 9){
			if (x) od += (1<<log_od);
			log_od++;
		}
		if (log_od < 9) return;
		if (od == (1<<9)-1 && cur == +inf) return;
		if (cur-pre < od){
			SendInt(11, p);
			Update(p, cur);
			Getcur();
			log_od = log_op = od = op = 0;
			if (cur == +inf) SendInt(9, (1<<9)-1); else SendInt(9, cur-pre);
			return;
		}
		log_od++;
		if (log_od == 10) return;
		if (x) op += (1<<log_op);
		log_op++;
		if (log_op == 11){
			Update(op, pre+od);
			Getcur();
			log_od = log_op = od = op = 0;
			if (cur == +inf) SendInt(9, (1<<9)-1); else SendInt(9, cur-pre);
		}
	}
}

void InitB(int N, int B, vector <int> S, vector <int> T, vector <int> D){
	Baijan::Init(N, B, S, T, D);
}

void ReceiveB(bool y){
	Baijan::Receive(y);
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 303 ms 1048 KB Output is correct
2 Correct 0 ms 664 KB Output is correct
3 Correct 297 ms 1044 KB Output is correct
4 Correct 353 ms 12924 KB Output is correct
5 Correct 15 ms 920 KB Output is correct
6 Correct 311 ms 2792 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 664 KB Output is correct
2 Correct 304 ms 888 KB Output is correct
3 Correct 317 ms 964 KB Output is correct
4 Correct 422 ms 33796 KB Output is correct
5 Correct 445 ms 30236 KB Output is correct
6 Correct 56 ms 664 KB Output is correct
7 Correct 459 ms 30472 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 309 ms 872 KB Output is correct
2 Correct 0 ms 664 KB Output is correct
3 Correct 271 ms 1200 KB Output is correct
4 Correct 276 ms 900 KB Output is correct
5 Correct 309 ms 884 KB Output is correct
6 Correct 299 ms 872 KB Output is correct
7 Correct 299 ms 892 KB Output is correct
8 Correct 292 ms 1060 KB Output is correct
9 Correct 286 ms 1052 KB Output is correct
10 Correct 341 ms 1048 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 664 KB Output is correct
2 Correct 133 ms 800 KB Output is correct
3 Correct 183 ms 16016 KB Output is correct
4 Correct 125 ms 664 KB Output is correct
5 Correct 177 ms 12756 KB Output is correct
6 Correct 126 ms 664 KB Output is correct
7 Correct 131 ms 664 KB Output is correct
8 Correct 131 ms 664 KB Output is correct
9 Correct 236 ms 23028 KB Output is correct
10 Correct 243 ms 23084 KB Output is correct
11 Correct 325 ms 45268 KB Output is correct
12 Correct 266 ms 37680 KB Output is correct
13 Correct 141 ms 664 KB Output is correct
14 Correct 1 ms 664 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 664 KB Output is correct
2 Correct 133 ms 800 KB Output is correct
3 Correct 183 ms 16016 KB Output is correct
4 Correct 125 ms 664 KB Output is correct
5 Correct 177 ms 12756 KB Output is correct
6 Correct 126 ms 664 KB Output is correct
7 Correct 131 ms 664 KB Output is correct
8 Correct 131 ms 664 KB Output is correct
9 Correct 236 ms 23028 KB Output is correct
10 Correct 243 ms 23084 KB Output is correct
11 Correct 325 ms 45268 KB Output is correct
12 Correct 266 ms 37680 KB Output is correct
13 Correct 141 ms 664 KB Output is correct
14 Correct 1 ms 664 KB Output is correct
15 Correct 157 ms 836 KB Output is correct
16 Correct 160 ms 664 KB Output is correct
17 Correct 228 ms 664 KB Output is correct
18 Correct 213 ms 12600 KB Output is correct
19 Correct 205 ms 664 KB Output is correct
20 Correct 228 ms 12984 KB Output is correct
21 Correct 177 ms 664 KB Output is correct
22 Correct 220 ms 888 KB Output is correct
23 Correct 332 ms 28428 KB Output is correct
24 Correct 339 ms 28304 KB Output is correct
25 Correct 504 ms 55688 KB Output is correct
26 Correct 433 ms 44744 KB Output is correct
27 Correct 233 ms 1176 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 664 KB Output is correct
2 Correct 133 ms 800 KB Output is correct
3 Correct 183 ms 16016 KB Output is correct
4 Correct 125 ms 664 KB Output is correct
5 Correct 177 ms 12756 KB Output is correct
6 Correct 126 ms 664 KB Output is correct
7 Correct 131 ms 664 KB Output is correct
8 Correct 131 ms 664 KB Output is correct
9 Correct 236 ms 23028 KB Output is correct
10 Correct 243 ms 23084 KB Output is correct
11 Correct 325 ms 45268 KB Output is correct
12 Correct 266 ms 37680 KB Output is correct
13 Correct 141 ms 664 KB Output is correct
14 Correct 1 ms 664 KB Output is correct
15 Correct 157 ms 836 KB Output is correct
16 Correct 160 ms 664 KB Output is correct
17 Correct 228 ms 664 KB Output is correct
18 Correct 213 ms 12600 KB Output is correct
19 Correct 205 ms 664 KB Output is correct
20 Correct 228 ms 12984 KB Output is correct
21 Correct 177 ms 664 KB Output is correct
22 Correct 220 ms 888 KB Output is correct
23 Correct 332 ms 28428 KB Output is correct
24 Correct 339 ms 28304 KB Output is correct
25 Correct 504 ms 55688 KB Output is correct
26 Correct 433 ms 44744 KB Output is correct
27 Correct 233 ms 1176 KB Output is correct
28 Correct 221 ms 664 KB Output is correct
29 Correct 278 ms 792 KB Output is correct
30 Correct 339 ms 29864 KB Output is correct
31 Correct 218 ms 788 KB Output is correct
32 Correct 323 ms 25988 KB Output is correct
33 Correct 205 ms 884 KB Output is correct
34 Correct 273 ms 1432 KB Output is correct
35 Correct 253 ms 1176 KB Output is correct
36 Correct 343 ms 31268 KB Output is correct
37 Correct 349 ms 30872 KB Output is correct
38 Correct 513 ms 61072 KB Output is correct
39 Correct 515 ms 53848 KB Output is correct
40 Correct 237 ms 1176 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 303 ms 1048 KB Output is correct
2 Correct 0 ms 664 KB Output is correct
3 Correct 297 ms 1044 KB Output is correct
4 Correct 353 ms 12924 KB Output is correct
5 Correct 15 ms 920 KB Output is correct
6 Correct 311 ms 2792 KB Output is correct
7 Correct 0 ms 664 KB Output is correct
8 Correct 304 ms 888 KB Output is correct
9 Correct 317 ms 964 KB Output is correct
10 Correct 422 ms 33796 KB Output is correct
11 Correct 445 ms 30236 KB Output is correct
12 Correct 56 ms 664 KB Output is correct
13 Correct 459 ms 30472 KB Output is correct
14 Correct 309 ms 872 KB Output is correct
15 Correct 0 ms 664 KB Output is correct
16 Correct 271 ms 1200 KB Output is correct
17 Correct 276 ms 900 KB Output is correct
18 Correct 309 ms 884 KB Output is correct
19 Correct 299 ms 872 KB Output is correct
20 Correct 299 ms 892 KB Output is correct
21 Correct 292 ms 1060 KB Output is correct
22 Correct 286 ms 1052 KB Output is correct
23 Correct 341 ms 1048 KB Output is correct
24 Correct 133 ms 664 KB Output is correct
25 Correct 133 ms 800 KB Output is correct
26 Correct 183 ms 16016 KB Output is correct
27 Correct 125 ms 664 KB Output is correct
28 Correct 177 ms 12756 KB Output is correct
29 Correct 126 ms 664 KB Output is correct
30 Correct 131 ms 664 KB Output is correct
31 Correct 131 ms 664 KB Output is correct
32 Correct 236 ms 23028 KB Output is correct
33 Correct 243 ms 23084 KB Output is correct
34 Correct 325 ms 45268 KB Output is correct
35 Correct 266 ms 37680 KB Output is correct
36 Correct 141 ms 664 KB Output is correct
37 Correct 1 ms 664 KB Output is correct
38 Correct 157 ms 836 KB Output is correct
39 Correct 160 ms 664 KB Output is correct
40 Correct 228 ms 664 KB Output is correct
41 Correct 213 ms 12600 KB Output is correct
42 Correct 205 ms 664 KB Output is correct
43 Correct 228 ms 12984 KB Output is correct
44 Correct 177 ms 664 KB Output is correct
45 Correct 220 ms 888 KB Output is correct
46 Correct 332 ms 28428 KB Output is correct
47 Correct 339 ms 28304 KB Output is correct
48 Correct 504 ms 55688 KB Output is correct
49 Correct 433 ms 44744 KB Output is correct
50 Correct 233 ms 1176 KB Output is correct
51 Correct 221 ms 664 KB Output is correct
52 Correct 278 ms 792 KB Output is correct
53 Correct 339 ms 29864 KB Output is correct
54 Correct 218 ms 788 KB Output is correct
55 Correct 323 ms 25988 KB Output is correct
56 Correct 205 ms 884 KB Output is correct
57 Correct 273 ms 1432 KB Output is correct
58 Correct 253 ms 1176 KB Output is correct
59 Correct 343 ms 31268 KB Output is correct
60 Correct 349 ms 30872 KB Output is correct
61 Correct 513 ms 61072 KB Output is correct
62 Correct 515 ms 53848 KB Output is correct
63 Correct 237 ms 1176 KB Output is correct
64 Correct 325 ms 1244 KB Output is correct
65 Correct 475 ms 32412 KB Output is correct
66 Correct 528 ms 29132 KB Output is correct
67 Correct 368 ms 1228 KB Output is correct
68 Correct 438 ms 1224 KB Output is correct
69 Correct 622 ms 59308 KB Output is correct
70 Correct 637 ms 49952 KB Output is correct
71 Correct 400 ms 6204 KB Output is correct
72 Correct 346 ms 1428 KB Output is correct