結果

問題 No.922 東北きりきざむたん
コンテスト
ユーザー ningenMe
提出日時 2019-11-08 22:44:48
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 5,072 bytes
コンパイル時間 2,306 ms
コンパイル使用メモリ 188,184 KB
実行使用メモリ 24,240 KB
最終ジャッジ日時 2024-09-15 01:55:33
合計ジャッジ時間 5,967 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 9 WA * 17
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

vector<vector<int>> edge;
vector<ll> dist,dp,dp2,sum;
vector<ll> cnt;
vector<int> v;

void dfs(int curr,int prev){
    for(int next:edge[curr]){
        if(next==prev) continue;
        dist[next] = dist[curr] + 1;
        dfs(next, curr);
    }
    if(prev!=-1) {
        sum[prev] += sum[curr];
    }
    v.push_back(curr);
}



//Union Find Tree
class UnionFindTree {
public:
	vector<int> parent;
    vector<int> rank;

    UnionFindTree(int N) : parent(N), rank(N,0){
		for (int i = 0; i < N; ++i) parent[i] = i;
	}
 
	int root(int n) {
		return (parent[n] == n ? n : parent[n] = root(parent[n]));
	}

    int same(int n, int m) {
		return root(n) == root(m);
	}
 
	void unite(int n, int m) {
		n = root(n);
		m = root(m);
		if (n == m) return;
		if(rank[n]<rank[m]) {
            parent[n] = m;
        }
        else{
            parent[m] = n;
            if(rank[n] == rank[m]) rank[n]++;
        }
	}
};

//verify https://atcoder.jp/contests/abc097/tasks/arc097_b

int main() {
    int N,M,Q; cin >> N >> M >> Q;
    edge.resize(N);
    dist.resize(N,-1);
    dp.resize(N,0);
    dp2.resize(N,0);
    sum.resize(N,0);
    cnt.resize(N,0);
    UnionFindTree uf(N);

    for(int i = 0; i < M; ++i){
        int u,v; cin >> u >> v;
        u--,v--;
        edge[u].push_back(v);
        edge[v].push_back(u);
        uf.unite(u,v);
    }
    vector<vector<P<int,int>>> pp(N);
    for(int i = 0; i < Q; ++i){
        int a,b; cin >> a >> b;
        a--,b--;
        if(uf.same(a,b)){
            pp[uf.root(a)].push_back({a,b});
        }
        else{
            cnt[a]++;
            cnt[b]++;
        }
    }
    sum = cnt;
    ll ans = 0;
    for(int i = 0; i < N; ++i) {
        if(dist[i]!=-1) continue;
        dist[i] = 0;
        v.clear();
        dfs(i,-1);
        reverse(ALL(v));
        ll mmm = 0;
        for(auto e:v) dp[i] += cnt[e]*dist[e];
        for(auto e:v) mmm += cnt[e];
        int rt = uf.root(i);
        for(auto lr:pp[rt]) ans += (dist[lr.first]+dist[lr.second]-2*dist[i]);

        for(auto pa:v){
            for(auto ch:edge[pa]){
                if(dist[ch]<dist[pa]) continue;
                dp[ch] = dp[pa] - sum[ch] + (mmm - sum[ch]);
            }
        }
        ll mini = LOWINF;
        for(auto e:v) chmin(mini,dp[e]);
        ans += mini;
    }
    cout << ans << endl;


    return 0;
}
0