oj.uz

답안 #123272

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
123272 2019-07-01T03:36:40 Z 구재현(#3026) Two Transportations (JOI19_transportations) C++14
100 / 100
 1848 ms 85648 KB 
#include "Azer.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2005;
using pi = pair<int, int>;

namespace {
	vector<pi> gph[MAXN];
	int dist[MAXN];
	bool vis[MAXN];
	bool firstSkip = 1;
	int n, recValue1, recValue2, curMode;	
	void sendValue(int x, int b){
		for(int i=b-1; i>=0; i--){
			SendA((x >> i) & 1);
		}
	}
	void relax(int v){	
//		printf("A relaxed %d = %d\n", v, dist[v]);
		vis[v] = 1;
		for(auto &i : gph[v]){
			dist[i.second] = min(dist[i.second], i.first + dist[v]);
		}
	}
	int getMax(){
		int ret = 0;
		for(int i=0; i<n; i++){
			if(vis[i]) ret = max(ret, dist[i]);
		}
		return ret;
	}
}  // namespace


void InitA(int N, int A, std::vector<int> U, std::vector<int> V,
		std::vector<int> C) {
	n = N;
	for(int i=0; i<A; i++){
		gph[U[i]].emplace_back(C[i], V[i]);
		gph[V[i]].emplace_back(C[i], U[i]);
	}
	memset(dist, 0x3f, sizeof(dist));
	dist[0] = 0;
}

void ReceiveA(bool x) {
	if(curMode == 0){
		curMode = 69;
		if(count(vis, vis + n, 1) == n) return;
		int cur = 1048575, pos = -1;
		for(int i=0; i<n; i++){
			if(!vis[i] && dist[i] < cur){
				cur = dist[i];
				pos = i;
			}
		}
		cur -= getMax();
		cur = min(cur, 511);
		sendValue(cur, 9 - firstSkip);
		firstSkip = 0;
		return;
	}
	if(curMode >= 69){
		if(curMode < 80){
			recValue1 = recValue1 * 2 + x;
		}
		else{
			recValue2 = recValue2 * 2 + x;
		}
		curMode++;
		if(curMode == 77 && recValue1 == 255){
			int cur = 1048575, pos = -1;
			for(int i=0; i<n; i++){
				if(!vis[i] && dist[i] < cur){
					cur = dist[i];
					pos = i;
				}
			}
			relax(pos);
			sendValue(pos, 11);
			curMode = 0;
			recValue1 = recValue2 = 0;
		}
		if(curMode == 89){
			dist[recValue1] = min(dist[recValue1], recValue2 + getMax());
			relax(recValue1);
			recValue1 = recValue2 = 0;
			curMode = 0;
			ReceiveA(0);
		}
	}
}

vector<int> Answer(){
	vector<int> v(dist, dist + n);
	return v;
}

#include "Baijan.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2005;
using pi = pair<int, int>;

namespace {
	vector<pi> gph[MAXN];
	int dist[MAXN];
	bool vis[MAXN];
	int n, recValue, recValue2, curMode;
	bool firstSkip = 1;
	void sendValue(int x, int b){
		for(int i=b-1; i>=0; i--){
			SendB((x >> i) & 1);
		}
	}
	void relax(int v){
	//	printf("B relaxed %d = %d\n", v, dist[v]);
		vis[v] = 1;
		for(auto &i : gph[v]){
			dist[i.second] = min(dist[i.second], i.first + dist[v]);
		}
	}
	int getMax(){
		int ret = 0;
		for(int i=0; i<n; i++){
			if(vis[i]) ret = max(ret, dist[i]);
		}
		return ret;
	}
}  // namespace

void InitB(int N, int B, std::vector<int> S, std::vector<int> T,
		std::vector<int> D) {
	n = N;
	for(int i=0; i<B; i++){
		gph[S[i]].emplace_back(D[i], T[i]);
		gph[T[i]].emplace_back(D[i], S[i]);
	}
	memset(dist, 0x3f, sizeof(dist));
	dist[0] = 0;
	SendB(0);
}

void ReceiveB(bool y) {
	if(curMode < 9 - firstSkip){
		curMode++;
		recValue = recValue * 2 + y;
	}
	if(curMode < 9 - firstSkip) return;
	if(curMode > 999){
		curMode++;
		recValue2 = recValue2 * 2 + y;
		if(curMode >= 1011){
			dist[recValue2] = min(dist[recValue2], recValue + getMax());
			relax(recValue2);
			recValue = recValue2 = 0;
			curMode = 0;
			SendB(0);
		}
		return;
	}
	firstSkip = 0;
	int cur = 1048575, pos = -1;
	for(int i=0; i<n; i++){
		if(!vis[i] && dist[i] < cur){
			cur = dist[i];
			pos = i;
		}
	}
	cur -= getMax();
	int another_dist = recValue;
	if(cur > another_dist){
		sendValue(255, 8);
		curMode = 1000;
		// beg A to answer the vertex number
	}
	else{
		relax(pos);
		curMode = 0;
		recValue = recValue2 = 0;
		sendValue(pos, 11);
		sendValue(cur, 9);
		// tell A that vertex number with its distance
	}
}

Compilation message

Azer.cpp: In function 'void ReceiveA(bool)':
Azer.cpp:50:22: warning: variable 'pos' set but not used [-Wunused-but-set-variable]
   int cur = 1048575, pos = -1;
                      ^~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1148 ms 1512 KB Output is correct
2 Correct 4 ms 1232 KB Output is correct
3 Correct 884 ms 1528 KB Output is correct
4 Correct 1420 ms 20072 KB Output is correct
5 Correct 72 ms 1960 KB Output is correct
6 Correct 1226 ms 4584 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 1248 KB Output is correct
2 Correct 1122 ms 1760 KB Output is correct
3 Correct 1271 ms 1584 KB Output is correct
4 Correct 1778 ms 55208 KB Output is correct
5 Correct 1416 ms 48272 KB Output is correct
6 Correct 188 ms 1256 KB Output is correct
7 Correct 1690 ms 48248 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1300 ms 1600 KB Output is correct
2 Correct 6 ms 1352 KB Output is correct
3 Correct 1186 ms 1504 KB Output is correct
4 Correct 822 ms 1672 KB Output is correct
5 Correct 1122 ms 1616 KB Output is correct
6 Correct 1188 ms 1512 KB Output is correct
7 Correct 950 ms 1752 KB Output is correct
8 Correct 1174 ms 1600 KB Output is correct
9 Correct 1120 ms 1656 KB Output is correct
10 Correct 1160 ms 1504 KB Output is correct

Subtask #4
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 502 ms 1352 KB Output is correct
2 Correct 366 ms 1360 KB Output is correct
3 Correct 572 ms 23640 KB Output is correct
4 Correct 422 ms 1760 KB Output is correct
5 Correct 644 ms 17352 KB Output is correct
6 Correct 423 ms 1416 KB Output is correct
7 Correct 532 ms 1520 KB Output is correct
8 Correct 408 ms 1384 KB Output is correct
9 Correct 634 ms 36104 KB Output is correct
10 Correct 788 ms 35880 KB Output is correct
11 Correct 1082 ms 61416 KB Output is correct
12 Correct 906 ms 53648 KB Output is correct
13 Correct 528 ms 1592 KB Output is correct
14 Correct 8 ms 1248 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 502 ms 1352 KB Output is correct
2 Correct 366 ms 1360 KB Output is correct
3 Correct 572 ms 23640 KB Output is correct
4 Correct 422 ms 1760 KB Output is correct
5 Correct 644 ms 17352 KB Output is correct
6 Correct 423 ms 1416 KB Output is correct
7 Correct 532 ms 1520 KB Output is correct
8 Correct 408 ms 1384 KB Output is correct
9 Correct 634 ms 36104 KB Output is correct
10 Correct 788 ms 35880 KB Output is correct
11 Correct 1082 ms 61416 KB Output is correct
12 Correct 906 ms 53648 KB Output is correct
13 Correct 528 ms 1592 KB Output is correct
14 Correct 8 ms 1248 KB Output is correct
15 Correct 624 ms 1464 KB Output is correct
16 Correct 671 ms 1352 KB Output is correct
17 Correct 576 ms 1504 KB Output is correct
18 Correct 657 ms 17544 KB Output is correct
19 Correct 490 ms 1560 KB Output is correct
20 Correct 850 ms 17728 KB Output is correct
21 Correct 449 ms 1648 KB Output is correct
22 Correct 484 ms 1760 KB Output is correct
23 Correct 1090 ms 44144 KB Output is correct
24 Correct 974 ms 43720 KB Output is correct
25 Correct 1302 ms 74920 KB Output is correct
26 Correct 1032 ms 64272 KB Output is correct
27 Correct 562 ms 1856 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 502 ms 1352 KB Output is correct
2 Correct 366 ms 1360 KB Output is correct
3 Correct 572 ms 23640 KB Output is correct
4 Correct 422 ms 1760 KB Output is correct
5 Correct 644 ms 17352 KB Output is correct
6 Correct 423 ms 1416 KB Output is correct
7 Correct 532 ms 1520 KB Output is correct
8 Correct 408 ms 1384 KB Output is correct
9 Correct 634 ms 36104 KB Output is correct
10 Correct 788 ms 35880 KB Output is correct
11 Correct 1082 ms 61416 KB Output is correct
12 Correct 906 ms 53648 KB Output is correct
13 Correct 528 ms 1592 KB Output is correct
14 Correct 8 ms 1248 KB Output is correct
15 Correct 624 ms 1464 KB Output is correct
16 Correct 671 ms 1352 KB Output is correct
17 Correct 576 ms 1504 KB Output is correct
18 Correct 657 ms 17544 KB Output is correct
19 Correct 490 ms 1560 KB Output is correct
20 Correct 850 ms 17728 KB Output is correct
21 Correct 449 ms 1648 KB Output is correct
22 Correct 484 ms 1760 KB Output is correct
23 Correct 1090 ms 44144 KB Output is correct
24 Correct 974 ms 43720 KB Output is correct
25 Correct 1302 ms 74920 KB Output is correct
26 Correct 1032 ms 64272 KB Output is correct
27 Correct 562 ms 1856 KB Output is correct
28 Correct 676 ms 1504 KB Output is correct
29 Correct 776 ms 1408 KB Output is correct
30 Correct 1154 ms 42152 KB Output is correct
31 Correct 762 ms 1464 KB Output is correct
32 Correct 1206 ms 37400 KB Output is correct
33 Correct 820 ms 1600 KB Output is correct
34 Correct 652 ms 1776 KB Output is correct
35 Correct 828 ms 1760 KB Output is correct
36 Correct 1194 ms 49328 KB Output is correct
37 Correct 1108 ms 49104 KB Output is correct
38 Correct 1638 ms 85648 KB Output is correct
39 Correct 1266 ms 78408 KB Output is correct
40 Correct 898 ms 1768 KB Output is correct

Subtask #7
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1148 ms 1512 KB Output is correct
2 Correct 4 ms 1232 KB Output is correct
3 Correct 884 ms 1528 KB Output is correct
4 Correct 1420 ms 20072 KB Output is correct
5 Correct 72 ms 1960 KB Output is correct
6 Correct 1226 ms 4584 KB Output is correct
7 Correct 8 ms 1248 KB Output is correct
8 Correct 1122 ms 1760 KB Output is correct
9 Correct 1271 ms 1584 KB Output is correct
10 Correct 1778 ms 55208 KB Output is correct
11 Correct 1416 ms 48272 KB Output is correct
12 Correct 188 ms 1256 KB Output is correct
13 Correct 1690 ms 48248 KB Output is correct
14 Correct 1300 ms 1600 KB Output is correct
15 Correct 6 ms 1352 KB Output is correct
16 Correct 1186 ms 1504 KB Output is correct
17 Correct 822 ms 1672 KB Output is correct
18 Correct 1122 ms 1616 KB Output is correct
19 Correct 1188 ms 1512 KB Output is correct
20 Correct 950 ms 1752 KB Output is correct
21 Correct 1174 ms 1600 KB Output is correct
22 Correct 1120 ms 1656 KB Output is correct
23 Correct 1160 ms 1504 KB Output is correct
24 Correct 502 ms 1352 KB Output is correct
25 Correct 366 ms 1360 KB Output is correct
26 Correct 572 ms 23640 KB Output is correct
27 Correct 422 ms 1760 KB Output is correct
28 Correct 644 ms 17352 KB Output is correct
29 Correct 423 ms 1416 KB Output is correct
30 Correct 532 ms 1520 KB Output is correct
31 Correct 408 ms 1384 KB Output is correct
32 Correct 634 ms 36104 KB Output is correct
33 Correct 788 ms 35880 KB Output is correct
34 Correct 1082 ms 61416 KB Output is correct
35 Correct 906 ms 53648 KB Output is correct
36 Correct 528 ms 1592 KB Output is correct
37 Correct 8 ms 1248 KB Output is correct
38 Correct 624 ms 1464 KB Output is correct
39 Correct 671 ms 1352 KB Output is correct
40 Correct 576 ms 1504 KB Output is correct
41 Correct 657 ms 17544 KB Output is correct
42 Correct 490 ms 1560 KB Output is correct
43 Correct 850 ms 17728 KB Output is correct
44 Correct 449 ms 1648 KB Output is correct
45 Correct 484 ms 1760 KB Output is correct
46 Correct 1090 ms 44144 KB Output is correct
47 Correct 974 ms 43720 KB Output is correct
48 Correct 1302 ms 74920 KB Output is correct
49 Correct 1032 ms 64272 KB Output is correct
50 Correct 562 ms 1856 KB Output is correct
51 Correct 676 ms 1504 KB Output is correct
52 Correct 776 ms 1408 KB Output is correct
53 Correct 1154 ms 42152 KB Output is correct
54 Correct 762 ms 1464 KB Output is correct
55 Correct 1206 ms 37400 KB Output is correct
56 Correct 820 ms 1600 KB Output is correct
57 Correct 652 ms 1776 KB Output is correct
58 Correct 828 ms 1760 KB Output is correct
59 Correct 1194 ms 49328 KB Output is correct
60 Correct 1108 ms 49104 KB Output is correct
61 Correct 1638 ms 85648 KB Output is correct
62 Correct 1266 ms 78408 KB Output is correct
63 Correct 898 ms 1768 KB Output is correct
64 Correct 1062 ms 1880 KB Output is correct
65 Correct 1590 ms 46920 KB Output is correct
66 Correct 1444 ms 40824 KB Output is correct
67 Correct 1388 ms 1792 KB Output is correct
68 Correct 1008 ms 1752 KB Output is correct
69 Correct 1812 ms 83240 KB Output is correct
70 Correct 1848 ms 67872 KB Output is correct
71 Correct 1270 ms 8944 KB Output is correct
72 Correct 1026 ms 2272 KB Output is correct