oj.uz

Submission #123542

# Submission time Handle Problem Language Result Execution time Memory
123542 2019-07-01T15:04:01 Z youngyojun Two Transportations (JOI19_transportations) C++14
100 / 100
 2614 ms 84432 KB 
#include "Azer.h"
#include <bits/stdc++.h>
#define eb emplace_back
#define sz(V) ((int)(V).size())
using namespace std;
typedef pair<int, int> pii;

static const int MAXN = 2000;
static const int MAXM = 500000;
static const int MAXC = 500;
static const int MAXLGN = 11;
static const int MAXLGC = 9;

static queue<bool> BTQ;

static priority_queue<pii, vector<pii>, greater<pii>> PQ;
static int D[MAXN];
static vector<int> LV;
static bitset<MAXN> chk;

static vector<int> G[MAXN];
static int A[MAXM], B[MAXM], C[MAXM];

static int N, M, K, mnV;

static void send(bool x) { SendA(x); }
static void sendInt(int x, int l) {
	for(int i = 0; i < l; i++)
		send(x & (1<<i));
}
static int getInt(int l) {
	int r = 0;
	for(int i = 0; i < l; i++) {
		if(BTQ.front()) r |= 1 << i;
		BTQ.pop();
	}
	return r;
}

static void calMin() {
	for(int idx, dst; !PQ.empty();) {
		tie(dst, idx) = PQ.top();
		if(!chk[idx]) break;
		PQ.pop();
		for(int e : G[idx]) {
			int v = A[e]^B[e]^idx;
			int d = D[idx] + C[e];
			if(D[v] <= d) continue;
			D[v] = d;
			PQ.push({d, v});
		}
	}
	mnV = PQ.top().second;
}

static void spread(int idx, int dst) {
	chk[idx] = true; K++;
	LV.eb(idx); D[idx] = dst;
	PQ.push({dst, idx});
	if(K < N) calMin();
}

static void init() {
	if(1 == N) return;
	for(int i = 0; i < M; i++) {
		G[A[i]].eb(i);
		G[B[i]].eb(i);
	}
	fill(D, D+N, MAXC*N);
	for(int i = 0; i < N; i++) PQ.push({D[i], i});
	spread(0, 0);
}

void InitA(int N, int A, std::vector<int> U, std::vector<int> V, std::vector<int> C) {
	::N = N; ::M = A;
	for(int i = 0; i < ::M; i++) {
		::A[i] = U[i];
		::B[i] = V[i];
		::C[i] = C[i];
	}
	init();
}

static int readyDist;
static bool isReady;
void ReceiveA(bool x) {
	if(K == N) return;
	BTQ.push(x);
	if(!isReady) {
		if(sz(BTQ) < MAXLGC) return;
		readyDist = D[LV.back()] + getInt(MAXLGC);
		if(D[mnV] <= readyDist) {
			sendInt(D[mnV] - D[LV.back()], MAXLGC);
			sendInt(mnV, MAXLGN);
			spread(mnV, D[mnV]);
			return;
		}
		sendInt(MAXC+1, MAXLGC);
		isReady = true;
	} else {
		if(sz(BTQ) < MAXLGN) return;
		spread(getInt(MAXLGN), readyDist);
		isReady = false;
	}
}

std::vector<int> Answer() {
	vector<int> V;
	for(int i = 0; i < N; i++) V.eb(D[i]);
	return V;
}
#include "Baijan.h"
#include <bits/stdc++.h>
#define eb emplace_back
#define sz(V) ((int)(V).size())
using namespace std;
typedef pair<int, int> pii;

static const int MAXN = 2000;
static const int MAXM = 500000;
static const int MAXC = 500;
static const int MAXLGN = 11;
static const int MAXLGC = 9;

static queue<bool> BTQ;

static priority_queue<pii, vector<pii>, greater<pii>> PQ;
static int D[MAXN];
static vector<int> LV;
static bitset<MAXN> chk;

static vector<int> G[MAXN];
static int A[MAXM], B[MAXM], C[MAXM];

static int N, M, K, mnV;

static void send(bool x) { SendB(x); }
static void sendInt(int x, int l) {
	for(int i = 0; i < l; i++)
		send(x & (1<<i));
}
static int getInt(int l) {
	int r = 0;
	for(int i = 0; i < l; i++) {
		if(BTQ.front()) r |= 1 << i;
		BTQ.pop();
	}
	return r;
}

static void calMin() {
	for(int idx, dst; !PQ.empty();) {
		tie(dst, idx) = PQ.top();
		if(!chk[idx]) break;
		PQ.pop();
		for(int e : G[idx]) {
			int v = A[e]^B[e]^idx;
			int d = D[idx] + C[e];
			if(D[v] <= d) continue;
			D[v] = d;
			PQ.push({d, v});
		}
	}
	mnV = PQ.top().second;
	sendInt(min(MAXC+1, D[mnV] - D[LV.back()]), MAXLGC);
}

static void spread(int idx, int dst) {
	chk[idx] = true; K++;
	LV.eb(idx); D[idx] = dst;
	PQ.push({dst, idx});
	if(K < N) calMin();
}

static void init() {
	if(1 == N) return;
	for(int i = 0; i < M; i++) {
		G[A[i]].eb(i);
		G[B[i]].eb(i);
	}
	fill(D, D+N, MAXC*N);
	for(int i = 0; i < N; i++) PQ.push({D[i], i});
	spread(0, 0);
}

void InitB(int N, int A, std::vector<int> U, std::vector<int> V, std::vector<int> C) {
	::N = N; ::M = A;
	for(int i = 0; i < ::M; i++) {
		::A[i] = U[i];
		::B[i] = V[i];
		::C[i] = C[i];
	}
	init();
}

static int readyDist;
static bool isReady;
void ReceiveB(bool x) {
	if(K == N) return;
	BTQ.push(x);
	if(!isReady) {
		if(sz(BTQ) < MAXLGC) return;
		readyDist = getInt(MAXLGC);
		if(MAXC < readyDist) {
			sendInt(mnV, MAXLGN);
			spread(mnV, D[mnV]);
			return;
		}
		readyDist += D[LV.back()];
		isReady = true;
	} else {
		if(sz(BTQ) < MAXLGN) return;
		spread(getInt(MAXLGN), readyDist);
		isReady = false;
	}
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 990 ms 1832 KB Output is correct
2 Correct 0 ms 1232 KB Output is correct
3 Correct 890 ms 1624 KB Output is correct
4 Correct 1242 ms 21032 KB Output is correct
5 Correct 50 ms 1920 KB Output is correct
6 Correct 1180 ms 4640 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1248 KB Output is correct
2 Correct 1120 ms 2224 KB Output is correct
3 Correct 1192 ms 2144 KB Output is correct
4 Correct 1560 ms 51888 KB Output is correct
5 Correct 1386 ms 48424 KB Output is correct
6 Correct 180 ms 1712 KB Output is correct
7 Correct 1514 ms 48792 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1038 ms 1864 KB Output is correct
2 Correct 8 ms 1248 KB Output is correct
3 Correct 950 ms 1760 KB Output is correct
4 Correct 808 ms 1856 KB Output is correct
5 Correct 1100 ms 2088 KB Output is correct
6 Correct 808 ms 1832 KB Output is correct
7 Correct 866 ms 1992 KB Output is correct
8 Correct 1156 ms 2016 KB Output is correct
9 Correct 670 ms 1904 KB Output is correct
10 Correct 814 ms 1992 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 454 ms 1568 KB Output is correct
2 Correct 490 ms 1520 KB Output is correct
3 Correct 687 ms 22456 KB Output is correct
4 Correct 308 ms 1656 KB Output is correct
5 Correct 568 ms 17888 KB Output is correct
6 Correct 274 ms 1480 KB Output is correct
7 Correct 254 ms 1568 KB Output is correct
8 Correct 500 ms 1760 KB Output is correct
9 Correct 752 ms 37816 KB Output is correct
10 Correct 894 ms 37648 KB Output is correct
11 Correct 1246 ms 64736 KB Output is correct
12 Correct 1002 ms 52256 KB Output is correct
13 Correct 490 ms 1856 KB Output is correct
14 Correct 4 ms 984 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 454 ms 1568 KB Output is correct
2 Correct 490 ms 1520 KB Output is correct
3 Correct 687 ms 22456 KB Output is correct
4 Correct 308 ms 1656 KB Output is correct
5 Correct 568 ms 17888 KB Output is correct
6 Correct 274 ms 1480 KB Output is correct
7 Correct 254 ms 1568 KB Output is correct
8 Correct 500 ms 1760 KB Output is correct
9 Correct 752 ms 37816 KB Output is correct
10 Correct 894 ms 37648 KB Output is correct
11 Correct 1246 ms 64736 KB Output is correct
12 Correct 1002 ms 52256 KB Output is correct
13 Correct 490 ms 1856 KB Output is correct
14 Correct 4 ms 984 KB Output is correct
15 Correct 458 ms 1760 KB Output is correct
16 Correct 430 ms 1568 KB Output is correct
17 Correct 428 ms 1488 KB Output is correct
18 Correct 798 ms 17880 KB Output is correct
19 Correct 686 ms 1728 KB Output is correct
20 Correct 736 ms 18320 KB Output is correct
21 Correct 524 ms 2008 KB Output is correct
22 Correct 514 ms 1832 KB Output is correct
23 Correct 874 ms 45984 KB Output is correct
24 Correct 1032 ms 46056 KB Output is correct
25 Correct 1672 ms 79248 KB Output is correct
26 Correct 1322 ms 61960 KB Output is correct
27 Correct 644 ms 2344 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 454 ms 1568 KB Output is correct
2 Correct 490 ms 1520 KB Output is correct
3 Correct 687 ms 22456 KB Output is correct
4 Correct 308 ms 1656 KB Output is correct
5 Correct 568 ms 17888 KB Output is correct
6 Correct 274 ms 1480 KB Output is correct
7 Correct 254 ms 1568 KB Output is correct
8 Correct 500 ms 1760 KB Output is correct
9 Correct 752 ms 37816 KB Output is correct
10 Correct 894 ms 37648 KB Output is correct
11 Correct 1246 ms 64736 KB Output is correct
12 Correct 1002 ms 52256 KB Output is correct
13 Correct 490 ms 1856 KB Output is correct
14 Correct 4 ms 984 KB Output is correct
15 Correct 458 ms 1760 KB Output is correct
16 Correct 430 ms 1568 KB Output is correct
17 Correct 428 ms 1488 KB Output is correct
18 Correct 798 ms 17880 KB Output is correct
19 Correct 686 ms 1728 KB Output is correct
20 Correct 736 ms 18320 KB Output is correct
21 Correct 524 ms 2008 KB Output is correct
22 Correct 514 ms 1832 KB Output is correct
23 Correct 874 ms 45984 KB Output is correct
24 Correct 1032 ms 46056 KB Output is correct
25 Correct 1672 ms 79248 KB Output is correct
26 Correct 1322 ms 61960 KB Output is correct
27 Correct 644 ms 2344 KB Output is correct
28 Correct 620 ms 1688 KB Output is correct
29 Correct 776 ms 1576 KB Output is correct
30 Correct 1422 ms 42936 KB Output is correct
31 Correct 776 ms 1816 KB Output is correct
32 Correct 1264 ms 34976 KB Output is correct
33 Correct 832 ms 1840 KB Output is correct
34 Correct 774 ms 2104 KB Output is correct
35 Correct 740 ms 1856 KB Output is correct
36 Correct 1216 ms 49312 KB Output is correct
37 Correct 1180 ms 48936 KB Output is correct
38 Correct 1878 ms 84432 KB Output is correct
39 Correct 1644 ms 72944 KB Output is correct
40 Correct 621 ms 2256 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 990 ms 1832 KB Output is correct
2 Correct 0 ms 1232 KB Output is correct
3 Correct 890 ms 1624 KB Output is correct
4 Correct 1242 ms 21032 KB Output is correct
5 Correct 50 ms 1920 KB Output is correct
6 Correct 1180 ms 4640 KB Output is correct
7 Correct 8 ms 1248 KB Output is correct
8 Correct 1120 ms 2224 KB Output is correct
9 Correct 1192 ms 2144 KB Output is correct
10 Correct 1560 ms 51888 KB Output is correct
11 Correct 1386 ms 48424 KB Output is correct
12 Correct 180 ms 1712 KB Output is correct
13 Correct 1514 ms 48792 KB Output is correct
14 Correct 1038 ms 1864 KB Output is correct
15 Correct 8 ms 1248 KB Output is correct
16 Correct 950 ms 1760 KB Output is correct
17 Correct 808 ms 1856 KB Output is correct
18 Correct 1100 ms 2088 KB Output is correct
19 Correct 808 ms 1832 KB Output is correct
20 Correct 866 ms 1992 KB Output is correct
21 Correct 1156 ms 2016 KB Output is correct
22 Correct 670 ms 1904 KB Output is correct
23 Correct 814 ms 1992 KB Output is correct
24 Correct 454 ms 1568 KB Output is correct
25 Correct 490 ms 1520 KB Output is correct
26 Correct 687 ms 22456 KB Output is correct
27 Correct 308 ms 1656 KB Output is correct
28 Correct 568 ms 17888 KB Output is correct
29 Correct 274 ms 1480 KB Output is correct
30 Correct 254 ms 1568 KB Output is correct
31 Correct 500 ms 1760 KB Output is correct
32 Correct 752 ms 37816 KB Output is correct
33 Correct 894 ms 37648 KB Output is correct
34 Correct 1246 ms 64736 KB Output is correct
35 Correct 1002 ms 52256 KB Output is correct
36 Correct 490 ms 1856 KB Output is correct
37 Correct 4 ms 984 KB Output is correct
38 Correct 458 ms 1760 KB Output is correct
39 Correct 430 ms 1568 KB Output is correct
40 Correct 428 ms 1488 KB Output is correct
41 Correct 798 ms 17880 KB Output is correct
42 Correct 686 ms 1728 KB Output is correct
43 Correct 736 ms 18320 KB Output is correct
44 Correct 524 ms 2008 KB Output is correct
45 Correct 514 ms 1832 KB Output is correct
46 Correct 874 ms 45984 KB Output is correct
47 Correct 1032 ms 46056 KB Output is correct
48 Correct 1672 ms 79248 KB Output is correct
49 Correct 1322 ms 61960 KB Output is correct
50 Correct 644 ms 2344 KB Output is correct
51 Correct 620 ms 1688 KB Output is correct
52 Correct 776 ms 1576 KB Output is correct
53 Correct 1422 ms 42936 KB Output is correct
54 Correct 776 ms 1816 KB Output is correct
55 Correct 1264 ms 34976 KB Output is correct
56 Correct 832 ms 1840 KB Output is correct
57 Correct 774 ms 2104 KB Output is correct
58 Correct 740 ms 1856 KB Output is correct
59 Correct 1216 ms 49312 KB Output is correct
60 Correct 1180 ms 48936 KB Output is correct
61 Correct 1878 ms 84432 KB Output is correct
62 Correct 1644 ms 72944 KB Output is correct
63 Correct 621 ms 2256 KB Output is correct
64 Correct 766 ms 2312 KB Output is correct
65 Correct 1880 ms 45264 KB Output is correct
66 Correct 1880 ms 41208 KB Output is correct
67 Correct 1288 ms 2304 KB Output is correct
68 Correct 1292 ms 2056 KB Output is correct
69 Correct 2614 ms 83448 KB Output is correct
70 Correct 2150 ms 71928 KB Output is correct
71 Correct 1366 ms 9040 KB Output is correct
72 Correct 1374 ms 2496 KB Output is correct