oj.uz

Submission #132791

# Submission time Handle Problem Language Result Execution time Memory
132791 2019-07-19T14:50:23 Z sebinkim Two Transportations (JOI19_transportations) C++14
84 / 100
 1524 ms 85328 KB 
#include <bits/stdc++.h>
 
#include "Azer.h"
 
using namespace std;
 
typedef pair <int, int> pii;
 
const int ID = 11;
const int DIST = 9;
 
namespace{
	priority_queue <pii> Q;
	vector <pii> G[2020];
	vector <int> D;
	bool chk[2020];
	int v, c, t, _d;
	int f = 699810514, b;
	int n, z, m;

	bool turn() { b = (b + 1) % 30; return (f & (1 << b)) != 0; }
 
	void sendint(int x, int l)
	{
		x = min(x, (1 << l) - 1);
		
		for(; l--; ){
			SendA((x & (1 << l))? 1 : 0);
		}
	}
 
	void check()
	{
		int p, d;
		
		for(; !Q.empty(); Q.pop()){
			tie(d, p) = Q.top(); d = -d;
			if(!chk[p] && d == D[p]) break;
		}
		
		if(Q.empty()) return;
		
		tie(d, p) = Q.top(); d = -d;
		
		sendint(d - z, DIST);
	}
 
	void apply(int p, int d)
	{
		chk[p] = 1; D[p] = d; z = d;
		
		for(pii &t: G[p]){
			if(!chk[t.first] && D[t.first] > d + t.second){
				D[t.first] = d + t.second;
				Q.emplace(-d - t.second, t.first);
			}
		}
		
		if(turn()){
			m = 1; check();
		}
		else m = 2;
	}

	void check(int d1)
	{
		int p2, d2;
		
		for(; !Q.empty(); Q.pop()){
			tie(d2, p2) = Q.top(); d2 = -d2;
			if(!chk[p2] && D[p2] == d2) break;
		}
		
		tie(d2, p2) = Q.top(); d2 = -d2;
		
		if(d1 < d2){
			SendA(0);
			_d = d1, t = 1;
		}
		else{
			SendA(1); Q.pop();
			sendint(p2, ID);
			sendint(d2 - z, DIST);
			apply(p2, d2);
		}
	}
}

void InitA(int N, int A, vector <int> U, vector <int> V, vector<int> C)
{
	n = N; D.resize(n, 0);
	
	int i;
	
	for(i=0; i<A; i++){
		G[U[i]].emplace_back(V[i], C[i]);
		G[V[i]].emplace_back(U[i], C[i]);
	}
	
	for(i=1; i<n; i++){
		D[i] = 1e9;
	}
	
	for(i=0; i<n; i++){
		Q.emplace(-D[i], i);
	}
	
	apply(0, 0);
}

void ReceiveA(bool x)
{
	if(m == 1){
		if(t == 0){
			if(!x){
				int d, p;
				tie(d, p) = Q.top();
				d = -d; Q.pop();
				sendint(p, ID);
				apply(p, d);
			}
			else t = 1;
		}
		else{
			v = v << 1 | x; c ++;
		
			if(c == ID + DIST){
				int p = v >> DIST;
				int d = z + (v & ((1 << DIST) - 1));
				v = 0; c = 0; t = 0;
				apply(p, d);
			}
		}
	}
	else{
		if(t == 0){
			v = v << 1 | x; c ++;
		
			if(c == DIST){
				int d = z + v;
				v = 0; c = 0;
				check(d);
			}
		}
		else{
			v = v << 1 | x; c ++;
		
			if(c == ID){
				int p = v, d = _d;
				v = 0; c = 0; t = 0;
				apply(p, d);
			}
		}
	}
}

vector <int> Answer() { return D; }
#include <bits/stdc++.h>
 
#include "Baijan.h"

using namespace std;
 
typedef pair <int, int> pii;
 
const int ID = 11;
const int DIST = 9;
 
namespace{
	priority_queue <pii> Q;
	vector <pii> G[2020];
	vector <int> D;
	bool chk[2020];
	int v, c, t, _d;
	int f = 699810514, b;
	int n, z, m;

	bool turn() { b = (b + 1) % 30; return (f & (1 << b)) != 0; }
 
	void sendint(int x, int l)
	{
		x = min(x, (1 << l) - 1);
		
		for(; l--; ){
			SendB((x & (1 << l))? 1 : 0);
		}
	}
 
	void check()
	{
		int p, d;
		
		for(; !Q.empty(); Q.pop()){
			tie(d, p) = Q.top(); d = -d;
			if(!chk[p] && d == D[p]) break;
		}
		
		if(Q.empty()) return;
		
		tie(d, p) = Q.top(); d = -d;
		
		sendint(d - z, DIST);
	}
 
	void apply(int p, int d)
	{
		chk[p] = 1; D[p] = d; z = d;
		
		for(pii &t: G[p]){
			if(!chk[t.first] && D[t.first] > d + t.second){
				D[t.first] = d + t.second;
				Q.emplace(-d - t.second, t.first);
			}
		}
		
		if(!turn()){
			m = 1; check();
		}
		else m = 2;
	}

	void check(int d1)
	{
		int p2, d2;
		
		for(; !Q.empty(); Q.pop()){
			tie(d2, p2) = Q.top(); d2 = -d2;
			if(!chk[p2] && D[p2] == d2) break;
		}
		
		tie(d2, p2) = Q.top(); d2 = -d2;
		
		if(d1 < d2){
			SendB(0);
			_d = d1, t = 1;
		}
		else{
			SendB(1); Q.pop();
			sendint(p2, ID);
			sendint(d2 - z, DIST);
			apply(p2, d2);
		}
	}
}

void InitB(int N, int B, vector <int> S, vector<int> T, vector<int> C)
{
	n = N; D.resize(n, 0);
	
	int i;
	
	for(i=0; i<B; i++){
		G[S[i]].emplace_back(T[i], C[i]);
		G[T[i]].emplace_back(S[i], C[i]);
	}
	
	for(i=1; i<n; i++){
		D[i] = 1e9;
	}
	
	for(i=0; i<n; i++){
		Q.emplace(-D[i], i);
	}
	
	apply(0, 0);
}

void ReceiveB(bool x)
{
	if(m == 1){
		if(t == 0){
			if(!x){
				int d, p;
				tie(d, p) = Q.top();
				d = -d; Q.pop();
				sendint(p, ID);
				apply(p, d);
			}
			else t = 1;
		}
		else{
			v = v << 1 | x; c ++;
		
			if(c == ID + DIST){
				int p = v >> DIST;
				int d = z + (v & ((1 << DIST) - 1));
				v = 0; c = 0; t = 0;
				apply(p, d);
			}
		}
	}
	else{
		if(t == 0){
			v = v << 1 | x; c ++;
		
			if(c == DIST){
				int d = z + v;
				v = 0; c = 0;
				check(d);
			}
		}
		else{
			v = v << 1 | x; c ++;
		
			if(c == ID){
				int p = v, d = _d;
				v = 0; c = 0; t = 0;
				apply(p, d);
			}
		}
	}
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 848 ms 2016 KB Output is correct
2 Correct 6 ms 1248 KB Output is correct
3 Correct 964 ms 1760 KB Output is correct
4 Correct 988 ms 20344 KB Output is correct
5 Correct 38 ms 2016 KB Output is correct
6 Correct 957 ms 4576 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1336 KB Output is correct
2 Correct 916 ms 2008 KB Output is correct
3 Correct 632 ms 1760 KB Output is correct
4 Correct 1524 ms 55216 KB Output is correct
5 Correct 1270 ms 48320 KB Output is correct
6 Correct 178 ms 1208 KB Output is correct
7 Correct 1460 ms 48536 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 970 ms 1880 KB Output is correct
2 Correct 4 ms 960 KB Output is correct
3 Correct 948 ms 1872 KB Output is correct
4 Correct 808 ms 1680 KB Output is correct
5 Correct 742 ms 1760 KB Output is correct
6 Correct 848 ms 1944 KB Output is correct
7 Correct 1028 ms 1632 KB Output is correct
8 Correct 930 ms 1584 KB Output is correct
9 Correct 862 ms 1576 KB Output is correct
10 Correct 1032 ms 2040 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 478 ms 1632 KB Output is correct
2 Correct 320 ms 1504 KB Output is correct
3 Correct 736 ms 23592 KB Output is correct
4 Correct 474 ms 1728 KB Output is correct
5 Correct 552 ms 17312 KB Output is correct
6 Correct 364 ms 1360 KB Output is correct
7 Correct 350 ms 1600 KB Output is correct
8 Correct 318 ms 1760 KB Output is correct
9 Correct 692 ms 36040 KB Output is correct
10 Correct 590 ms 36080 KB Output is correct
11 Correct 1200 ms 61152 KB Output is correct
12 Correct 952 ms 53912 KB Output is correct
13 Correct 392 ms 1448 KB Output is correct
14 Correct 8 ms 1096 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 478 ms 1632 KB Output is correct
2 Correct 320 ms 1504 KB Output is correct
3 Correct 736 ms 23592 KB Output is correct
4 Correct 474 ms 1728 KB Output is correct
5 Correct 552 ms 17312 KB Output is correct
6 Correct 364 ms 1360 KB Output is correct
7 Correct 350 ms 1600 KB Output is correct
8 Correct 318 ms 1760 KB Output is correct
9 Correct 692 ms 36040 KB Output is correct
10 Correct 590 ms 36080 KB Output is correct
11 Correct 1200 ms 61152 KB Output is correct
12 Correct 952 ms 53912 KB Output is correct
13 Correct 392 ms 1448 KB Output is correct
14 Correct 8 ms 1096 KB Output is correct
15 Correct 432 ms 1472 KB Output is correct
16 Correct 536 ms 1440 KB Output is correct
17 Correct 542 ms 1504 KB Output is correct
18 Correct 596 ms 17568 KB Output is correct
19 Correct 578 ms 1584 KB Output is correct
20 Correct 706 ms 18064 KB Output is correct
21 Correct 418 ms 1928 KB Output is correct
22 Correct 414 ms 1616 KB Output is correct
23 Correct 906 ms 43800 KB Output is correct
24 Correct 854 ms 43976 KB Output is correct
25 Correct 1218 ms 75024 KB Output is correct
26 Correct 915 ms 64536 KB Output is correct
27 Correct 526 ms 2008 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 478 ms 1632 KB Output is correct
2 Correct 320 ms 1504 KB Output is correct
3 Correct 736 ms 23592 KB Output is correct
4 Correct 474 ms 1728 KB Output is correct
5 Correct 552 ms 17312 KB Output is correct
6 Correct 364 ms 1360 KB Output is correct
7 Correct 350 ms 1600 KB Output is correct
8 Correct 318 ms 1760 KB Output is correct
9 Correct 692 ms 36040 KB Output is correct
10 Correct 590 ms 36080 KB Output is correct
11 Correct 1200 ms 61152 KB Output is correct
12 Correct 952 ms 53912 KB Output is correct
13 Correct 392 ms 1448 KB Output is correct
14 Correct 8 ms 1096 KB Output is correct
15 Correct 432 ms 1472 KB Output is correct
16 Correct 536 ms 1440 KB Output is correct
17 Correct 542 ms 1504 KB Output is correct
18 Correct 596 ms 17568 KB Output is correct
19 Correct 578 ms 1584 KB Output is correct
20 Correct 706 ms 18064 KB Output is correct
21 Correct 418 ms 1928 KB Output is correct
22 Correct 414 ms 1616 KB Output is correct
23 Correct 906 ms 43800 KB Output is correct
24 Correct 854 ms 43976 KB Output is correct
25 Correct 1218 ms 75024 KB Output is correct
26 Correct 915 ms 64536 KB Output is correct
27 Correct 526 ms 2008 KB Output is correct
28 Correct 632 ms 1640 KB Output is correct
29 Correct 712 ms 1768 KB Output is correct
30 Correct 1110 ms 42056 KB Output is correct
31 Correct 516 ms 1784 KB Output is correct
32 Correct 934 ms 37568 KB Output is correct
33 Correct 544 ms 1864 KB Output is correct
34 Correct 380 ms 1792 KB Output is correct
35 Correct 418 ms 1744 KB Output is correct
36 Correct 860 ms 49320 KB Output is correct
37 Correct 1078 ms 49176 KB Output is correct
38 Correct 1426 ms 85328 KB Output is correct
39 Correct 1353 ms 78488 KB Output is correct
40 Correct 496 ms 2120 KB Output is correct

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 848 ms 2016 KB Output is correct
2 Correct 6 ms 1248 KB Output is correct
3 Correct 964 ms 1760 KB Output is correct
4 Correct 988 ms 20344 KB Output is correct
5 Correct 38 ms 2016 KB Output is correct
6 Correct 957 ms 4576 KB Output is correct
7 Correct 8 ms 1336 KB Output is correct
8 Correct 916 ms 2008 KB Output is correct
9 Correct 632 ms 1760 KB Output is correct
10 Correct 1524 ms 55216 KB Output is correct
11 Correct 1270 ms 48320 KB Output is correct
12 Correct 178 ms 1208 KB Output is correct
13 Correct 1460 ms 48536 KB Output is correct
14 Correct 970 ms 1880 KB Output is correct
15 Correct 4 ms 960 KB Output is correct
16 Correct 948 ms 1872 KB Output is correct
17 Correct 808 ms 1680 KB Output is correct
18 Correct 742 ms 1760 KB Output is correct
19 Correct 848 ms 1944 KB Output is correct
20 Correct 1028 ms 1632 KB Output is correct
21 Correct 930 ms 1584 KB Output is correct
22 Correct 862 ms 1576 KB Output is correct
23 Correct 1032 ms 2040 KB Output is correct
24 Correct 478 ms 1632 KB Output is correct
25 Correct 320 ms 1504 KB Output is correct
26 Correct 736 ms 23592 KB Output is correct
27 Correct 474 ms 1728 KB Output is correct
28 Correct 552 ms 17312 KB Output is correct
29 Correct 364 ms 1360 KB Output is correct
30 Correct 350 ms 1600 KB Output is correct
31 Correct 318 ms 1760 KB Output is correct
32 Correct 692 ms 36040 KB Output is correct
33 Correct 590 ms 36080 KB Output is correct
34 Correct 1200 ms 61152 KB Output is correct
35 Correct 952 ms 53912 KB Output is correct
36 Correct 392 ms 1448 KB Output is correct
37 Correct 8 ms 1096 KB Output is correct
38 Correct 432 ms 1472 KB Output is correct
39 Correct 536 ms 1440 KB Output is correct
40 Correct 542 ms 1504 KB Output is correct
41 Correct 596 ms 17568 KB Output is correct
42 Correct 578 ms 1584 KB Output is correct
43 Correct 706 ms 18064 KB Output is correct
44 Correct 418 ms 1928 KB Output is correct
45 Correct 414 ms 1616 KB Output is correct
46 Correct 906 ms 43800 KB Output is correct
47 Correct 854 ms 43976 KB Output is correct
48 Correct 1218 ms 75024 KB Output is correct
49 Correct 915 ms 64536 KB Output is correct
50 Correct 526 ms 2008 KB Output is correct
51 Correct 632 ms 1640 KB Output is correct
52 Correct 712 ms 1768 KB Output is correct
53 Correct 1110 ms 42056 KB Output is correct
54 Correct 516 ms 1784 KB Output is correct
55 Correct 934 ms 37568 KB Output is correct
56 Correct 544 ms 1864 KB Output is correct
57 Correct 380 ms 1792 KB Output is correct
58 Correct 418 ms 1744 KB Output is correct
59 Correct 860 ms 49320 KB Output is correct
60 Correct 1078 ms 49176 KB Output is correct
61 Correct 1426 ms 85328 KB Output is correct
62 Correct 1353 ms 78488 KB Output is correct
63 Correct 496 ms 2120 KB Output is correct
64 Correct 744 ms 2280 KB Output is correct
65 Incorrect 736 ms 23592 KB Wrong Answer [2]
66 Halted 0 ms 0 KB -