CF1245D Shichikuji and Power Grid

思路：

图论。参考了https://codeforces.com/blog/entry/71080。

实现：

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int N = 2005;
ll x[N], y[N], c[N], k[N];
ll dis(int i, int j)
{
    return abs(x[i] - x[j]) + abs(y[i] - y[j]);
}
ll cost(int i, int j)
{
    return (k[i] + k[j]) * dis(i, j); 
}
int main()
{
    int n;
    while (cin >> n)
    {
        for (int i = 0; i < n; i++) cin >> x[i] >> y[i];
        for (int i = 0; i < n; i++) cin >> c[i];
        for (int i = 0; i < n; i++) cin >> k[i];
        vector<bool> vis(n, false);
        vector<int> ch(n, -1);
        for (int i = 0; i < n; i++) ch[i] = i;
        ll res = 0;
        for (int t = 0; t < n; t++)
        {
            ll minn = INF; int index = -1; 
            for (int i = 0; i < n; i++)
            {
                if (!vis[i] and c[i] < minn) 
                {
                    minn = c[i]; index = i;
                }
            }
            vis[index] = true;
            res += minn;
            for (int i = 0; i < n; i++)
            {
                if (vis[i]) continue;
                ll tmp = cost(index, i);
                if (tmp < c[i]) { c[i] = tmp; ch[i] = index; }
            }
        }
        cout << res << endl;
        vector<int> pow;
        vector<pair<int, int>> r;
        for (int i = 0; i < n; i++)
        {
            if (ch[i] == i) pow.push_back(i); 
            else r.push_back({i, ch[i]}); 
        }
        cout << pow.size() << endl;
        for (auto it: pow) cout << it + 1 << " ";
        cout << endl;
        cout << r.size() << endl;
        for (auto it: r)
        {
            cout << it.first + 1 << " " << it.second + 1 << endl;
        }
    }
    return 0;
}