oj.uz

Submission #132797

# Submission time Handle Problem Language Result Execution time Memory
132797 2019-07-19T15:02:15 Z sebinkim Two Transportations (JOI19_transportations) C++14
70 / 100
 1538 ms 85600 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 n, z, m;

	bool turn() { return 1; }
 
	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 n, z, m;

	bool turn() { return 1; }
 
	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
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 438 ms 812 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1248 KB Output is correct
2 Correct 892 ms 2000 KB Output is correct
3 Correct 896 ms 1824 KB Output is correct
4 Correct 886 ms 55224 KB Output is correct
5 Correct 1236 ms 48272 KB Output is correct
6 Correct 166 ms 1224 KB Output is correct
7 Correct 1082 ms 48464 KB Output is correct

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 862 ms 1928 KB Output is correct
2 Correct 8 ms 1248 KB Output is correct
3 Incorrect 539 ms 864 KB Wrong Answer [2]
4 Halted 0 ms 0 KB -

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 463 ms 1384 KB Output is correct
2 Correct 544 ms 1392 KB Output is correct
3 Correct 672 ms 23680 KB Output is correct
4 Correct 432 ms 1304 KB Output is correct
5 Correct 660 ms 17296 KB Output is correct
6 Correct 366 ms 1456 KB Output is correct
7 Correct 414 ms 1760 KB Output is correct
8 Correct 396 ms 1712 KB Output is correct
9 Correct 714 ms 36088 KB Output is correct
10 Correct 734 ms 36312 KB Output is correct
11 Correct 1256 ms 60976 KB Output is correct
12 Correct 958 ms 53536 KB Output is correct
13 Correct 400 ms 1424 KB Output is correct
14 Correct 6 ms 1248 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 463 ms 1384 KB Output is correct
2 Correct 544 ms 1392 KB Output is correct
3 Correct 672 ms 23680 KB Output is correct
4 Correct 432 ms 1304 KB Output is correct
5 Correct 660 ms 17296 KB Output is correct
6 Correct 366 ms 1456 KB Output is correct
7 Correct 414 ms 1760 KB Output is correct
8 Correct 396 ms 1712 KB Output is correct
9 Correct 714 ms 36088 KB Output is correct
10 Correct 734 ms 36312 KB Output is correct
11 Correct 1256 ms 60976 KB Output is correct
12 Correct 958 ms 53536 KB Output is correct
13 Correct 400 ms 1424 KB Output is correct
14 Correct 6 ms 1248 KB Output is correct
15 Correct 430 ms 1512 KB Output is correct
16 Correct 466 ms 1440 KB Output is correct
17 Correct 460 ms 1760 KB Output is correct
18 Correct 638 ms 17776 KB Output is correct
19 Correct 580 ms 1584 KB Output is correct
20 Correct 722 ms 18184 KB Output is correct
21 Correct 498 ms 1848 KB Output is correct
22 Correct 425 ms 1488 KB Output is correct
23 Correct 968 ms 43648 KB Output is correct
24 Correct 1092 ms 44056 KB Output is correct
25 Correct 1460 ms 74992 KB Output is correct
26 Correct 1108 ms 64360 KB Output is correct
27 Correct 550 ms 1976 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 463 ms 1384 KB Output is correct
2 Correct 544 ms 1392 KB Output is correct
3 Correct 672 ms 23680 KB Output is correct
4 Correct 432 ms 1304 KB Output is correct
5 Correct 660 ms 17296 KB Output is correct
6 Correct 366 ms 1456 KB Output is correct
7 Correct 414 ms 1760 KB Output is correct
8 Correct 396 ms 1712 KB Output is correct
9 Correct 714 ms 36088 KB Output is correct
10 Correct 734 ms 36312 KB Output is correct
11 Correct 1256 ms 60976 KB Output is correct
12 Correct 958 ms 53536 KB Output is correct
13 Correct 400 ms 1424 KB Output is correct
14 Correct 6 ms 1248 KB Output is correct
15 Correct 430 ms 1512 KB Output is correct
16 Correct 466 ms 1440 KB Output is correct
17 Correct 460 ms 1760 KB Output is correct
18 Correct 638 ms 17776 KB Output is correct
19 Correct 580 ms 1584 KB Output is correct
20 Correct 722 ms 18184 KB Output is correct
21 Correct 498 ms 1848 KB Output is correct
22 Correct 425 ms 1488 KB Output is correct
23 Correct 968 ms 43648 KB Output is correct
24 Correct 1092 ms 44056 KB Output is correct
25 Correct 1460 ms 74992 KB Output is correct
26 Correct 1108 ms 64360 KB Output is correct
27 Correct 550 ms 1976 KB Output is correct
28 Correct 680 ms 1552 KB Output is correct
29 Correct 836 ms 1760 KB Output is correct
30 Correct 1230 ms 42016 KB Output is correct
31 Correct 692 ms 1792 KB Output is correct
32 Correct 1020 ms 37648 KB Output is correct
33 Correct 570 ms 1760 KB Output is correct
34 Correct 552 ms 1832 KB Output is correct
35 Correct 626 ms 2048 KB Output is correct
36 Correct 912 ms 49216 KB Output is correct
37 Correct 984 ms 49120 KB Output is correct
38 Correct 1538 ms 85600 KB Output is correct
39 Correct 1258 ms 78456 KB Output is correct
40 Correct 566 ms 2024 KB Output is correct

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 438 ms 812 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -