oj.uz

답안 #547555

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
547555 2022-04-11T00:36:53 Z dolphingarlic Grad (COI14_grad) C++14
100 / 100
 332 ms 120716 KB 
#include <bits/stdc++.h>
using namespace std;
 
struct Point { int x, y; } p[101010];
 
struct SP;
 
struct Node { // Node in tree decomposition
	int idx[2], depth;
	double dist;
 
	Node(int _u, int _v) : dist(hypot(p[_u].x - p[_v].x, p[_u].y - p[_v].y)) {
		idx[0] = _u;
		idx[1] = _v;
	}
 
	Node *complement;
	vector<Node *> anc;
	vector<SP> anc_sp;
} *has_city[101010];
 
struct SP { // Shortest path between two nodes in tree decomposition
	int idx[2][2];
	double dist[2][2];
 
	SP(Node *u) {
		idx[0][0] = idx[1][0] = u->idx[0];
		idx[0][1] = idx[1][1] = u->idx[1];
		dist[0][0] = dist[1][1] = 0;
		dist[0][1] = dist[1][0] = u->dist;
	}
 
	SP(Node *u, Node *v) {
		assert(u->anc[0] == v);
		idx[0][0] = u->idx[0], idx[0][1] = u->idx[1];
		idx[1][0] = v->idx[0], idx[1][1] = v->idx[1];
		if (u->idx[0] == v->idx[0]) {
			dist[0][0] = 0;
			dist[0][1] = v->dist;
			dist[1][0] = u->dist;
			dist[1][1] = u->complement->dist;
		} else {
			dist[0][0] = v->dist;
			dist[0][1] = 0;
			dist[1][0] = u->complement->dist;
			dist[1][1] = u->dist;
		}
	}
 
	SP(SP a, SP b) {
		assert(a.idx[1][0] == b.idx[0][0] && a.idx[1][1] == b.idx[0][1]);
		idx[0][0] = a.idx[0][0], idx[0][1] = a.idx[0][1];
		idx[1][0] = b.idx[1][0], idx[1][1] = b.idx[1][1];
		for (int i : {0, 1}) for (int j : {0, 1})
			dist[i][j] = min(a.dist[i][0] + b.dist[0][j], a.dist[i][1] + b.dist[1][j]);
	}
};
 
map<pair<int, int>, Node*> mp;
 
int main() {
	cin.tie(0)->sync_with_stdio(0);
	int n;
	cin >> p[1].x >> p[1].y >> p[2].x >> p[2].y >> n;
	has_city[1] = has_city[2] = mp[{1, 2}] = new Node(1, 2);
 
	for (int cnt = 2; n; n--) {
		char c;
		cin >> c;
		if (c == 'd') {
			cnt++;
			int a, b;
			cin >> p[cnt].x >> p[cnt].y >> a >> b;
			if (a > b) swap(a, b);
			Node *par = mp[{a, b}];
 
			Node *u = new Node(a, cnt), *v = new Node(b, cnt);
			u->complement = v, v->complement = u;
			u->depth = v->depth = par->depth + 1;
			has_city[cnt] = u;
 
			u->anc.push_back(par);
			u->anc_sp.push_back(SP(u, par));
			for (int i = 0; i < u->anc.size() && i < u->anc[i]->anc.size(); i++) {
				u->anc.push_back(u->anc[i]->anc[i]);
				u->anc_sp.push_back(SP(u->anc_sp[i], u->anc[i]->anc_sp[i]));
			}
			mp[{a, cnt}] = u;
 
			v->anc.push_back(par);
			v->anc_sp.push_back(SP(v, par));
			for (int i = 0; i < v->anc.size() && i < v->anc[i]->anc.size(); i++) {
				v->anc.push_back(v->anc[i]->anc[i]);
				v->anc_sp.push_back(SP(v->anc_sp[i], v->anc[i]->anc_sp[i]));
			}
			mp[{b, cnt}] = v;
 
			has_city[cnt] = u;
		} else {
			int a, b;
			cin >> a >> b;
			if (has_city[a]->depth < has_city[b]->depth) swap(a, b);
			double ans = 1e18;
			Node *anode = has_city[a], *bnode = has_city[b];
			SP asp = SP(anode), bsp = SP(bnode);
 
			for (int k = 0, diff = anode->depth - bnode->depth; diff; k++, diff >>= 1) {
				if (diff & 1) {
					asp = SP(asp, anode->anc_sp[k]);
					anode = anode->anc[k];
				}
			}
			for (int k = anode->anc.size() - 1; ~k; k--) {
				if (k < anode->anc.size() && anode->anc[k] != bnode->anc[k]) {
					asp = SP(asp, anode->anc_sp[k]);
					anode = anode->anc[k];
					bsp = SP(bsp, bnode->anc_sp[k]);
					bnode = bnode->anc[k];
				}
			}
 
			for (int k : {0, 1}) for (int l : {0, 1}) if (asp.idx[0][k] == a && bsp.idx[0][l] == b)
				for (int m : {0, 1}) for (int o : {0, 1}) if (asp.idx[1][m] == bsp.idx[1][o])
					ans = min(ans, asp.dist[k][m] + bsp.dist[l][o]);
			if (anode != bnode) {
				asp = SP(asp, anode->anc_sp[0]), bsp = SP(bsp, bnode->anc_sp[0]);
				for (int k : {0, 1}) for (int l : {0, 1}) if (asp.idx[0][k] == a && bsp.idx[0][l] == b)
					for (int m : {0, 1}) for (int o : {0, 1}) if (asp.idx[1][m] == bsp.idx[1][o])
						ans = min(ans, asp.dist[k][m] + bsp.dist[l][o]);
			}
			cout << fixed << setprecision(6) << ans << '\n';
		}
	}
	return 0;
}

Compilation message

grad.cpp: In function 'int main()':
grad.cpp:84:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Node*>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |    for (int i = 0; i < u->anc.size() && i < u->anc[i]->anc.size(); i++) {
      |                    ~~^~~~~~~~~~~~~~~
grad.cpp:84:43: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Node*>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |    for (int i = 0; i < u->anc.size() && i < u->anc[i]->anc.size(); i++) {
      |                                         ~~^~~~~~~~~~~~~~~~~~~~~~~
grad.cpp:92:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Node*>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |    for (int i = 0; i < v->anc.size() && i < v->anc[i]->anc.size(); i++) {
      |                    ~~^~~~~~~~~~~~~~~
grad.cpp:92:43: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Node*>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |    for (int i = 0; i < v->anc.size() && i < v->anc[i]->anc.size(); i++) {
      |                                         ~~^~~~~~~~~~~~~~~~~~~~~~~
grad.cpp:114:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Node*>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |     if (k < anode->anc.size() && anode->anc[k] != bnode->anc[k]) {
      |         ~~^~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB 41 numbers

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB 300 numbers

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1108 KB 500 numbers

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 143 ms 75252 KB 15000 numbers
2 Correct 121 ms 43876 KB 15000 numbers
3 Correct 152 ms 64588 KB 30000 numbers

Subtask #5
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 228 ms 111264 KB 28333 numbers
2 Correct 201 ms 96104 KB 28333 numbers
3 Correct 207 ms 86248 KB 40000 numbers

Subtask #6
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 251 ms 107920 KB 50000 numbers
2 Correct 221 ms 55668 KB 50000 numbers
3 Correct 256 ms 107824 KB 50000 numbers

Subtask #7
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 257 ms 97440 KB 55000 numbers
2 Correct 229 ms 84952 KB 55000 numbers
3 Correct 259 ms 107848 KB 50000 numbers

Subtask #8
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 283 ms 107948 KB 50000 numbers
2 Correct 267 ms 107012 KB 50000 numbers
3 Correct 246 ms 43724 KB 50000 numbers
4 Correct 301 ms 107896 KB 50000 numbers

Subtask #9
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 300 ms 120716 KB 44000 numbers
2 Correct 263 ms 117960 KB 44000 numbers
3 Correct 240 ms 67272 KB 44000 numbers
4 Correct 332 ms 120604 KB 44000 numbers

Subtask #10
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 291 ms 108008 KB 50000 numbers
2 Correct 281 ms 107740 KB 50000 numbers
3 Correct 241 ms 48692 KB 50000 numbers
4 Correct 322 ms 107852 KB 50000 numbers

Subtask #11
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 308 ms 117188 KB 45713 numbers
2 Correct 281 ms 98628 KB 54285 numbers
3 Correct 232 ms 44360 KB 58571 numbers
4 Correct 300 ms 93164 KB 57000 numbers

Subtask #12
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 295 ms 109472 KB 49285 numbers
2 Correct 299 ms 109544 KB 49285 numbers
3 Correct 249 ms 48460 KB 49285 numbers
4 Correct 311 ms 118476 KB 45000 numbers