oj.uz

Submission #132788

# Submission time Handle Problem Language Result Execution time Memory
132788 2019-07-19T14:47:00 Z sebinkim Two Transportations (JOI19_transportations) C++14
84 / 100
 1436 ms 85632 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 = 1234567890, 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 = 1234567890, 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 964 ms 1640 KB Output is correct
2 Correct 4 ms 1056 KB Output is correct
3 Correct 656 ms 1744 KB Output is correct
4 Correct 1254 ms 20144 KB Output is correct
5 Correct 40 ms 1760 KB Output is correct
6 Correct 909 ms 4360 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1392 KB Output is correct
2 Correct 824 ms 1768 KB Output is correct
3 Correct 1224 ms 1872 KB Output is correct
4 Correct 1404 ms 54968 KB Output is correct
5 Correct 1240 ms 48048 KB Output is correct
6 Correct 114 ms 1272 KB Output is correct
7 Correct 1240 ms 48560 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 760 ms 2008 KB Output is correct
2 Correct 8 ms 1248 KB Output is correct
3 Correct 688 ms 1768 KB Output is correct
4 Correct 798 ms 2016 KB Output is correct
5 Correct 722 ms 1704 KB Output is correct
6 Correct 1002 ms 1688 KB Output is correct
7 Correct 972 ms 1576 KB Output is correct
8 Correct 930 ms 1600 KB Output is correct
9 Correct 676 ms 1760 KB Output is correct
10 Correct 934 ms 1816 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 288 ms 1504 KB Output is correct
2 Correct 294 ms 1392 KB Output is correct
3 Correct 596 ms 23760 KB Output is correct
4 Correct 304 ms 1512 KB Output is correct
5 Correct 616 ms 17288 KB Output is correct
6 Correct 438 ms 1760 KB Output is correct
7 Correct 460 ms 1824 KB Output is correct
8 Correct 624 ms 1600 KB Output is correct
9 Correct 709 ms 36040 KB Output is correct
10 Correct 838 ms 35896 KB Output is correct
11 Correct 1040 ms 61288 KB Output is correct
12 Correct 884 ms 53616 KB Output is correct
13 Correct 456 ms 1600 KB Output is correct
14 Correct 4 ms 1224 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 288 ms 1504 KB Output is correct
2 Correct 294 ms 1392 KB Output is correct
3 Correct 596 ms 23760 KB Output is correct
4 Correct 304 ms 1512 KB Output is correct
5 Correct 616 ms 17288 KB Output is correct
6 Correct 438 ms 1760 KB Output is correct
7 Correct 460 ms 1824 KB Output is correct
8 Correct 624 ms 1600 KB Output is correct
9 Correct 709 ms 36040 KB Output is correct
10 Correct 838 ms 35896 KB Output is correct
11 Correct 1040 ms 61288 KB Output is correct
12 Correct 884 ms 53616 KB Output is correct
13 Correct 456 ms 1600 KB Output is correct
14 Correct 4 ms 1224 KB Output is correct
15 Correct 594 ms 1576 KB Output is correct
16 Correct 616 ms 1760 KB Output is correct
17 Correct 454 ms 1512 KB Output is correct
18 Correct 870 ms 17656 KB Output is correct
19 Correct 576 ms 1600 KB Output is correct
20 Correct 646 ms 18144 KB Output is correct
21 Correct 476 ms 1760 KB Output is correct
22 Correct 528 ms 1696 KB Output is correct
23 Correct 874 ms 43960 KB Output is correct
24 Correct 902 ms 43976 KB Output is correct
25 Correct 1322 ms 75000 KB Output is correct
26 Correct 1080 ms 64320 KB Output is correct
27 Correct 504 ms 1664 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 288 ms 1504 KB Output is correct
2 Correct 294 ms 1392 KB Output is correct
3 Correct 596 ms 23760 KB Output is correct
4 Correct 304 ms 1512 KB Output is correct
5 Correct 616 ms 17288 KB Output is correct
6 Correct 438 ms 1760 KB Output is correct
7 Correct 460 ms 1824 KB Output is correct
8 Correct 624 ms 1600 KB Output is correct
9 Correct 709 ms 36040 KB Output is correct
10 Correct 838 ms 35896 KB Output is correct
11 Correct 1040 ms 61288 KB Output is correct
12 Correct 884 ms 53616 KB Output is correct
13 Correct 456 ms 1600 KB Output is correct
14 Correct 4 ms 1224 KB Output is correct
15 Correct 594 ms 1576 KB Output is correct
16 Correct 616 ms 1760 KB Output is correct
17 Correct 454 ms 1512 KB Output is correct
18 Correct 870 ms 17656 KB Output is correct
19 Correct 576 ms 1600 KB Output is correct
20 Correct 646 ms 18144 KB Output is correct
21 Correct 476 ms 1760 KB Output is correct
22 Correct 528 ms 1696 KB Output is correct
23 Correct 874 ms 43960 KB Output is correct
24 Correct 902 ms 43976 KB Output is correct
25 Correct 1322 ms 75000 KB Output is correct
26 Correct 1080 ms 64320 KB Output is correct
27 Correct 504 ms 1664 KB Output is correct
28 Correct 688 ms 1824 KB Output is correct
29 Correct 598 ms 1728 KB Output is correct
30 Correct 1100 ms 42360 KB Output is correct
31 Correct 618 ms 1736 KB Output is correct
32 Correct 1116 ms 37568 KB Output is correct
33 Correct 646 ms 1688 KB Output is correct
34 Correct 710 ms 1856 KB Output is correct
35 Correct 550 ms 1792 KB Output is correct
36 Correct 1092 ms 49024 KB Output is correct
37 Correct 1022 ms 49416 KB Output is correct
38 Correct 1436 ms 85632 KB Output is correct
39 Correct 1312 ms 78752 KB Output is correct
40 Correct 663 ms 2016 KB Output is correct

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 964 ms 1640 KB Output is correct
2 Correct 4 ms 1056 KB Output is correct
3 Correct 656 ms 1744 KB Output is correct
4 Correct 1254 ms 20144 KB Output is correct
5 Correct 40 ms 1760 KB Output is correct
6 Correct 909 ms 4360 KB Output is correct
7 Correct 4 ms 1392 KB Output is correct
8 Correct 824 ms 1768 KB Output is correct
9 Correct 1224 ms 1872 KB Output is correct
10 Correct 1404 ms 54968 KB Output is correct
11 Correct 1240 ms 48048 KB Output is correct
12 Correct 114 ms 1272 KB Output is correct
13 Correct 1240 ms 48560 KB Output is correct
14 Correct 760 ms 2008 KB Output is correct
15 Correct 8 ms 1248 KB Output is correct
16 Correct 688 ms 1768 KB Output is correct
17 Correct 798 ms 2016 KB Output is correct
18 Correct 722 ms 1704 KB Output is correct
19 Correct 1002 ms 1688 KB Output is correct
20 Correct 972 ms 1576 KB Output is correct
21 Correct 930 ms 1600 KB Output is correct
22 Correct 676 ms 1760 KB Output is correct
23 Correct 934 ms 1816 KB Output is correct
24 Correct 288 ms 1504 KB Output is correct
25 Correct 294 ms 1392 KB Output is correct
26 Correct 596 ms 23760 KB Output is correct
27 Correct 304 ms 1512 KB Output is correct
28 Correct 616 ms 17288 KB Output is correct
29 Correct 438 ms 1760 KB Output is correct
30 Correct 460 ms 1824 KB Output is correct
31 Correct 624 ms 1600 KB Output is correct
32 Correct 709 ms 36040 KB Output is correct
33 Correct 838 ms 35896 KB Output is correct
34 Correct 1040 ms 61288 KB Output is correct
35 Correct 884 ms 53616 KB Output is correct
36 Correct 456 ms 1600 KB Output is correct
37 Correct 4 ms 1224 KB Output is correct
38 Correct 594 ms 1576 KB Output is correct
39 Correct 616 ms 1760 KB Output is correct
40 Correct 454 ms 1512 KB Output is correct
41 Correct 870 ms 17656 KB Output is correct
42 Correct 576 ms 1600 KB Output is correct
43 Correct 646 ms 18144 KB Output is correct
44 Correct 476 ms 1760 KB Output is correct
45 Correct 528 ms 1696 KB Output is correct
46 Correct 874 ms 43960 KB Output is correct
47 Correct 902 ms 43976 KB Output is correct
48 Correct 1322 ms 75000 KB Output is correct
49 Correct 1080 ms 64320 KB Output is correct
50 Correct 504 ms 1664 KB Output is correct
51 Correct 688 ms 1824 KB Output is correct
52 Correct 598 ms 1728 KB Output is correct
53 Correct 1100 ms 42360 KB Output is correct
54 Correct 618 ms 1736 KB Output is correct
55 Correct 1116 ms 37568 KB Output is correct
56 Correct 646 ms 1688 KB Output is correct
57 Correct 710 ms 1856 KB Output is correct
58 Correct 550 ms 1792 KB Output is correct
59 Correct 1092 ms 49024 KB Output is correct
60 Correct 1022 ms 49416 KB Output is correct
61 Correct 1436 ms 85632 KB Output is correct
62 Correct 1312 ms 78752 KB Output is correct
63 Correct 663 ms 2016 KB Output is correct
64 Correct 812 ms 2144 KB Output is correct
65 Correct 1190 ms 47232 KB Output is correct
66 Incorrect 677 ms 20588 KB Wrong Answer [2]
67 Halted 0 ms 0 KB -