제출 #90597

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
90597		jasony123123	Grad (COI14_grad)	C++11	21 / 100	1592 ms	163556 KiB

grad

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;

#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define mp make_pair
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"

typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }

void io() {
#ifdef LOCAL_PROJECT 
	freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else 
	/* online submission */

#endif 
	ios_base::sync_with_stdio(false); cin.tie(NULL);
}

const ll MOD = 1000000007LL;
const ll PRIME = 105943LL;
const ll INF = 1e18;
/****************************************************************/

map<pii, double> dp; // {4,1}
pii pnts[100001];
pii par[100001];

double dist(pii a, pii b) {
	return sqrt(pow(a.first - b.first, 2) + pow(a.second - b.second, 2));
}

void add(pii edge) {
	if (edge.first < edge.second) swap(edge.first, edge.second);
	dp[edge] = dist(pnts[edge.first], pnts[edge.second]);
}

double query(int a, int b) {
	if (a < b) swap(a, b); // a>b
	if (dp.find({ a,b }) != dp.end()) return dp[{a, b}];
	
	double ans = min(dist(pnts[a], pnts[par[a].second]) + query(par[a].second, b), dist(pnts[a], pnts[par[a].first]) + query(par[a].first, b));
	dp[{a, b}] = ans;
	return ans;
}

int main() {
	io();
	cin >> pnts[1].first >> pnts[1].second >> pnts[2].first >> pnts[2].second;
	add({ 1,2 });

	int n;
	cin >> n;
	int node = 3;
	FOR(i, 0, n) {
		char cmd;
		cin >> cmd;
		if (cmd == 'd') {
			cin >> pnts[node].first >> pnts[node].second;
			int a, b;
			cin >> a >> b;
			add({ node, a });
			add({ node, b });
			par[node] = { a,b };
			node++;
		}
		else {
			int a, b;
			cin >> a >> b;
			cout << fixed << setprecision(6) << query(a, b) << "\n";
		}
	}

	return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 7 / 7
• Subtask 3: 7 / 7
• Subtask 4: 0 / 6
• Subtask 5: 0 / 6
• Subtask 6: 0 / 6
• Subtask 7: 0 / 6
• Subtask 8: 0 / 11
• Subtask 9: 0 / 11
• Subtask 10: 0 / 11
• Subtask 11: 0 / 11
• Subtask 12: 0 / 11