oj.uz

Submission #530036

# Submission time Handle Problem Language Result Execution time Memory
530036 2022-02-24T12:33:30 Z fhvirus Two Transportations (JOI19_transportations) C++17
100 / 100
 824 ms 48804 KB 
#include "Azer.h"
#include <bits/stdc++.h>
using namespace std;

namespace {

const int kN = 2000;
const int kLW = 9;
const int kLN = 11;
const int INF = INT_MAX;

enum State{
	sendW = 0,
	waitW = 1,
	sendV = 2,
	waitV = 3
};

int N;
vector<pair<int, int>> adj[kN];
int dis[kN], vis[kN];
int lastDis, bestVA, bestWA, bestVB, bestWB;
int relaxCount;
State currentState;

void relax(int u) {
	vis[u] = true;
	for (const auto& [v, c]: adj[u])
		dis[v] = min(dis[u] + c, dis[v]);
	bestVA = -1; bestWA = INF;
	for (int i = 0; i < N; ++i)
		if (!vis[i] and dis[i] < bestWA) {
			bestVA = i;
			bestWA = dis[i];
		}
	++relaxCount;
}

void tellW() {
	int w = (bestWA == INF ? (1 << kLW) - 1 : bestWA - lastDis);
	for (int l = kLW - 1; l >= 0; --l)
		SendA(w >> l & 1);
}
void tellV() {
	for (int l = kLN - 1; l >= 0; --l)
		SendA(bestVA >> l & 1);
}

int receiveCount, receiveValue;

}  // namespace

void InitA(int N, int A, vector<int> U, vector<int> V, vector<int> C) {
  ::N = N;
	if (N == 1) return;
	for (int i = 0; i < A; ++i) {
		adj[U[i]].emplace_back(V[i], C[i]);
		adj[V[i]].emplace_back(U[i], C[i]);
	}
	fill(dis, dis + N, INF);
	fill(vis, vis + N, false);
	bestVA = -1; bestWA = INF;
	bestVB = -1; bestWB = INF;
	dis[0] = 0;
	lastDis = 0; relaxCount = 0;
	relax(0);

	receiveCount = 0;
	receiveValue = 0;
	currentState = sendW;
	tellW();
	currentState = waitW;
}

void ReceiveA(bool x) {
	receiveValue <<= 1;
	receiveValue |= x;
	++receiveCount;

	if (currentState == waitW and receiveCount == kLW) {
		if (receiveValue == (1 << kLW) - 1)
			bestWB = INF;
		else
			bestWB = receiveValue + lastDis;
		receiveCount = 0;
		receiveValue = 0;

		if (bestWA <= bestWB) {
			currentState = sendV;
			tellV();
			bestVB = -1; bestWB = INF;
			lastDis = dis[bestVA];

			if (relaxCount == N - 1)
				return;
			relax(bestVA);

			currentState = sendW;
			tellW();
			currentState = waitW;
		} else {
			currentState = waitV;
		}
	} else if (currentState == waitV and receiveCount == kLN) {
		bestVB = receiveValue;
		receiveCount = 0;
		receiveValue = 0;

		dis[bestVB] = bestWB;
		lastDis = dis[bestVB];

		if (relaxCount == N - 1)
			return;
		relax(bestVB);

		bestVB = -1; bestWB = INF;
		currentState = sendW;
		tellW();
		currentState = waitW;
	}
}

vector<int> Answer() {
  vector<int> ans(dis, dis + N);
  return ans;
}

#include "Baijan.h"
#include <bits/stdc++.h>
using namespace std;

namespace {

const int kN = 2000;
const int kLW = 9;
const int kLN = 11;
const int INF = INT_MAX;

enum State{
	sendW = 0,
	waitW = 1,
	sendV = 2,
	waitV = 3
};

int N;
vector<pair<int, int>> adj[kN];
int dis[kN], vis[kN];
int lastDis, bestVA, bestWA, bestVB, bestWB;
State currentState;

void relax(int u) {
	vis[u] = true;
	for (const auto& [v, c]: adj[u])
		dis[v] = min(dis[u] + c, dis[v]);
	bestVB = -1; bestWB = INF;
	for (int i = 0; i < N; ++i)
		if (!vis[i] and dis[i] < bestWB) {
			bestVB = i;
			bestWB = dis[i];
		}
}

void tellW() {
	int w = (bestWB == INF ? (1 << kLW) - 1 : bestWB - lastDis);
	for (int l = kLW - 1; l >= 0; --l)
		SendB(w >> l & 1);
}
void tellV() {
	for (int l = kLN - 1; l >= 0; --l)
		SendB(bestVB >> l & 1);
}

int receiveCount, receiveValue;

}  // namespace

void InitB(int N, int B, vector<int> S, vector<int> T, vector<int> D) {
  ::N = N;
	for (int i = 0; i < B; ++i) {
		adj[S[i]].emplace_back(T[i], D[i]);
		adj[T[i]].emplace_back(S[i], D[i]);
	}
	fill(dis, dis + N, INF);
	fill(vis, vis + N, false);
	bestVA = -1; bestWA = INF;
	bestVB = -1; bestWB = INF;
	dis[0] = 0;
	lastDis = 0;
	relax(0);

	receiveCount = 0;
	receiveValue = 0;
	currentState = waitW;
}

void ReceiveB(bool y) {
	receiveValue <<= 1;
	receiveValue |= y;
	++receiveCount;

	if (currentState == waitW and receiveCount == kLW) {
		if (receiveValue == (1 << kLW) - 1)
			bestWA = INF;
		else
			bestWA = receiveValue + lastDis;
		receiveCount = 0;
		receiveValue = 0;

		currentState = sendW;
		tellW();

		if (bestWA <= bestWB) {
			currentState = waitV;
		} else {
			currentState = sendV;
			tellV();
			bestVA = -1; bestWA = INF;
			lastDis = dis[bestVB];
			relax(bestVB);
			currentState = waitW;
		}
	} else if (currentState == waitV and receiveCount == kLN) {
		bestVA = receiveValue;
		receiveCount = 0;
		receiveValue = 0;

		dis[bestVA] = bestWA;
		lastDis = dis[bestVA];
		relax(bestVA);
		bestVA = -1; bestWA = INF;
		currentState = waitW;
	}
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 540 ms 788 KB Output is correct
2 Correct 0 ms 648 KB Output is correct
3 Correct 597 ms 816 KB Output is correct
4 Correct 624 ms 10176 KB Output is correct
5 Correct 25 ms 904 KB Output is correct
6 Correct 614 ms 2204 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 648 KB Output is correct
2 Correct 496 ms 744 KB Output is correct
3 Correct 427 ms 808 KB Output is correct
4 Correct 631 ms 27504 KB Output is correct
5 Correct 716 ms 24060 KB Output is correct
6 Correct 115 ms 648 KB Output is correct
7 Correct 533 ms 24316 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 458 ms 724 KB Output is correct
2 Correct 2 ms 648 KB Output is correct
3 Correct 598 ms 788 KB Output is correct
4 Correct 565 ms 748 KB Output is correct
5 Correct 563 ms 740 KB Output is correct
6 Correct 597 ms 732 KB Output is correct
7 Correct 529 ms 740 KB Output is correct
8 Correct 392 ms 796 KB Output is correct
9 Correct 589 ms 788 KB Output is correct
10 Correct 446 ms 784 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 648 KB Output is correct
2 Correct 194 ms 660 KB Output is correct
3 Correct 252 ms 13308 KB Output is correct
4 Correct 151 ms 648 KB Output is correct
5 Correct 324 ms 10104 KB Output is correct
6 Correct 212 ms 708 KB Output is correct
7 Correct 249 ms 648 KB Output is correct
8 Correct 138 ms 720 KB Output is correct
9 Correct 363 ms 18056 KB Output is correct
10 Correct 384 ms 18196 KB Output is correct
11 Correct 470 ms 35720 KB Output is correct
12 Correct 434 ms 30604 KB Output is correct
13 Correct 259 ms 648 KB Output is correct
14 Correct 1 ms 648 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 648 KB Output is correct
2 Correct 194 ms 660 KB Output is correct
3 Correct 252 ms 13308 KB Output is correct
4 Correct 151 ms 648 KB Output is correct
5 Correct 324 ms 10104 KB Output is correct
6 Correct 212 ms 708 KB Output is correct
7 Correct 249 ms 648 KB Output is correct
8 Correct 138 ms 720 KB Output is correct
9 Correct 363 ms 18056 KB Output is correct
10 Correct 384 ms 18196 KB Output is correct
11 Correct 470 ms 35720 KB Output is correct
12 Correct 434 ms 30604 KB Output is correct
13 Correct 259 ms 648 KB Output is correct
14 Correct 1 ms 648 KB Output is correct
15 Correct 313 ms 648 KB Output is correct
16 Correct 319 ms 720 KB Output is correct
17 Correct 296 ms 648 KB Output is correct
18 Correct 352 ms 10104 KB Output is correct
19 Correct 259 ms 712 KB Output is correct
20 Correct 337 ms 10312 KB Output is correct
21 Correct 247 ms 740 KB Output is correct
22 Correct 326 ms 648 KB Output is correct
23 Correct 474 ms 22176 KB Output is correct
24 Correct 425 ms 22152 KB Output is correct
25 Correct 534 ms 43520 KB Output is correct
26 Correct 454 ms 36468 KB Output is correct
27 Correct 295 ms 760 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 648 KB Output is correct
2 Correct 194 ms 660 KB Output is correct
3 Correct 252 ms 13308 KB Output is correct
4 Correct 151 ms 648 KB Output is correct
5 Correct 324 ms 10104 KB Output is correct
6 Correct 212 ms 708 KB Output is correct
7 Correct 249 ms 648 KB Output is correct
8 Correct 138 ms 720 KB Output is correct
9 Correct 363 ms 18056 KB Output is correct
10 Correct 384 ms 18196 KB Output is correct
11 Correct 470 ms 35720 KB Output is correct
12 Correct 434 ms 30604 KB Output is correct
13 Correct 259 ms 648 KB Output is correct
14 Correct 1 ms 648 KB Output is correct
15 Correct 313 ms 648 KB Output is correct
16 Correct 319 ms 720 KB Output is correct
17 Correct 296 ms 648 KB Output is correct
18 Correct 352 ms 10104 KB Output is correct
19 Correct 259 ms 712 KB Output is correct
20 Correct 337 ms 10312 KB Output is correct
21 Correct 247 ms 740 KB Output is correct
22 Correct 326 ms 648 KB Output is correct
23 Correct 474 ms 22176 KB Output is correct
24 Correct 425 ms 22152 KB Output is correct
25 Correct 534 ms 43520 KB Output is correct
26 Correct 454 ms 36468 KB Output is correct
27 Correct 295 ms 760 KB Output is correct
28 Correct 312 ms 704 KB Output is correct
29 Correct 346 ms 768 KB Output is correct
30 Correct 407 ms 24056 KB Output is correct
31 Correct 377 ms 768 KB Output is correct
32 Correct 299 ms 21100 KB Output is correct
33 Correct 291 ms 736 KB Output is correct
34 Correct 323 ms 904 KB Output is correct
35 Correct 377 ms 904 KB Output is correct
36 Correct 460 ms 24704 KB Output is correct
37 Correct 455 ms 24728 KB Output is correct
38 Correct 621 ms 48804 KB Output is correct
39 Correct 570 ms 44264 KB Output is correct
40 Correct 366 ms 1016 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 540 ms 788 KB Output is correct
2 Correct 0 ms 648 KB Output is correct
3 Correct 597 ms 816 KB Output is correct
4 Correct 624 ms 10176 KB Output is correct
5 Correct 25 ms 904 KB Output is correct
6 Correct 614 ms 2204 KB Output is correct
7 Correct 0 ms 648 KB Output is correct
8 Correct 496 ms 744 KB Output is correct
9 Correct 427 ms 808 KB Output is correct
10 Correct 631 ms 27504 KB Output is correct
11 Correct 716 ms 24060 KB Output is correct
12 Correct 115 ms 648 KB Output is correct
13 Correct 533 ms 24316 KB Output is correct
14 Correct 458 ms 724 KB Output is correct
15 Correct 2 ms 648 KB Output is correct
16 Correct 598 ms 788 KB Output is correct
17 Correct 565 ms 748 KB Output is correct
18 Correct 563 ms 740 KB Output is correct
19 Correct 597 ms 732 KB Output is correct
20 Correct 529 ms 740 KB Output is correct
21 Correct 392 ms 796 KB Output is correct
22 Correct 589 ms 788 KB Output is correct
23 Correct 446 ms 784 KB Output is correct
24 Correct 239 ms 648 KB Output is correct
25 Correct 194 ms 660 KB Output is correct
26 Correct 252 ms 13308 KB Output is correct
27 Correct 151 ms 648 KB Output is correct
28 Correct 324 ms 10104 KB Output is correct
29 Correct 212 ms 708 KB Output is correct
30 Correct 249 ms 648 KB Output is correct
31 Correct 138 ms 720 KB Output is correct
32 Correct 363 ms 18056 KB Output is correct
33 Correct 384 ms 18196 KB Output is correct
34 Correct 470 ms 35720 KB Output is correct
35 Correct 434 ms 30604 KB Output is correct
36 Correct 259 ms 648 KB Output is correct
37 Correct 1 ms 648 KB Output is correct
38 Correct 313 ms 648 KB Output is correct
39 Correct 319 ms 720 KB Output is correct
40 Correct 296 ms 648 KB Output is correct
41 Correct 352 ms 10104 KB Output is correct
42 Correct 259 ms 712 KB Output is correct
43 Correct 337 ms 10312 KB Output is correct
44 Correct 247 ms 740 KB Output is correct
45 Correct 326 ms 648 KB Output is correct
46 Correct 474 ms 22176 KB Output is correct
47 Correct 425 ms 22152 KB Output is correct
48 Correct 534 ms 43520 KB Output is correct
49 Correct 454 ms 36468 KB Output is correct
50 Correct 295 ms 760 KB Output is correct
51 Correct 312 ms 704 KB Output is correct
52 Correct 346 ms 768 KB Output is correct
53 Correct 407 ms 24056 KB Output is correct
54 Correct 377 ms 768 KB Output is correct
55 Correct 299 ms 21100 KB Output is correct
56 Correct 291 ms 736 KB Output is correct
57 Correct 323 ms 904 KB Output is correct
58 Correct 377 ms 904 KB Output is correct
59 Correct 460 ms 24704 KB Output is correct
60 Correct 455 ms 24728 KB Output is correct
61 Correct 621 ms 48804 KB Output is correct
62 Correct 570 ms 44264 KB Output is correct
63 Correct 366 ms 1016 KB Output is correct
64 Correct 531 ms 952 KB Output is correct
65 Correct 752 ms 26516 KB Output is correct
66 Correct 711 ms 23344 KB Output is correct
67 Correct 558 ms 944 KB Output is correct
68 Correct 431 ms 932 KB Output is correct
69 Correct 800 ms 47608 KB Output is correct
70 Correct 824 ms 39512 KB Output is correct
71 Correct 585 ms 5012 KB Output is correct
72 Correct 537 ms 1180 KB Output is correct