BZOJ2395【最小乘积生成树】

/* I will wait for you*/

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <string>
#define make make_pair
#define fi first
#define se second

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;

const int maxn = 1000010;
const int maxm = 1010;
const int maxs = 26;
const int inf = 1 << 28;
const int P = 1000000007;
const double error = 1e-9;

inline ll read()
{
	ll x = 0, f = 1;
	char ch = getchar();
	while (ch <= 47 || ch >= 58)
		f = (ch == 45 ? -1 : 1), ch = getchar();
	while (ch >= 48 && ch <= 57)
		x = x * 10 + ch - 48, ch = getchar();
	return x * f;
}

struct point
{
	ll x, y;
} ans;

point operator - (point a, point b)
{
	return (point) {a.x - b.x, a.y - b.y};
}

ll operator * (point a, point b)
{
	return a.x * b.y - a.y * b.x;
}

bool operator < (point a, point b)
{
	return a.x * a.y < b.x * b.y || 
	       a.x * a.y == b.x * b.y && a.x < b.x;
}

struct edge
{
	int u, v, x, y; ll w;
} e[maxn];

bool operator < (edge a, edge b)
{
	return a.w < b.w;
}


int n, m, fa[maxn];

int find(int x)
{
	return x == fa[x] ? x : fa[x] = find(fa[x]);
}

int init()
{
	for (int i = 0; i < n; i++)
		fa[i] = i;
}

point kruscal()
{
	point tmp = (point) {0, 0};

	init(), sort (e, e + m);

	for (int i = 0; i < m; i++) {
		int u = find(e[i].u), v = find(e[i].v);
		if (u != v) {
			fa[u] = v;
			tmp.x += e[i].x;
			tmp.y += e[i].y;
		}
	}
	
	if (tmp < ans)
		ans = tmp;

	return tmp;
}

void solve(point a, point b)
{
	for (int i = 0; i < m; i++)
		e[i].w = (b.x - a.x) * e[i].y + (a.y - b.y) * e[i].x;

	point c = kruscal();

	if ((a - c) * (b - c) < 0)
		solve(a, c), solve(c, b);
}

int main()
{
	n = read(), m = read();

	for (int i = 0; i < m; i++) {
		e[i].u = read(), e[i].v = read();
		e[i].x = read(), e[i].y = read();
	}

	ans.x = ans.y = inf;

	for (int i = 0; i < m; i++)
		e[i].w = e[i].x;
	point a = kruscal();

	for (int i = 0; i < m; i++)
		e[i].w = e[i].y;
	point b = kruscal();

	solve(a, b);

	printf("%lld %lld\n", ans.x, ans.y);

	return 0;
}