結果

問題 No.922 東北きりきざむたん
コンテスト
ユーザー maroon_kuri
提出日時 2019-11-08 21:39:02
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 336 ms / 2,000 ms
コード長 6,601 bytes
コンパイル時間 2,700 ms
コンパイル使用メモリ 199,112 KB
実行使用メモリ 74,380 KB
最終ジャッジ日時 2024-09-15 01:19:37
合計ジャッジ時間 8,209 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 26
権限があれば一括ダウンロードができます
コンパイルメッセージ
In member function 'N N::up(ll) const',
    inlined from 'N treedp<N, E>::dfs1(ll, ll) [with N = N; E = long long int]' at main.cpp:275:31:
main.cpp:305:37: warning: 'up' may be used uninitialized [-Wmaybe-uninitialized]
  305 |                 return N{to,c+cnt[to],s+c};
      |                                     ^
main.cpp: In member function 'N treedp<N, E>::dfs1(ll, ll) [with N = N; E = long long int]':
main.cpp:265:19: note: 'up' was declared here
  265 |                 E up;
      |                   ^~

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

using ll=long long;
#define int ll

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}

template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))

using uint=unsigned;
using ull=unsigned long long;

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"{";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<"}";
}

void print(ll x,int suc=1){
	cout<<x;
	if(suc==1)
		cout<<"\n";
	if(suc==2)
		cout<<" ";
}

ll read(){
	ll i;
	cin>>i;
	return i;
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

template<class T>
void print(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print(v[i],i==int(v.size())-1?suc:2);
}

string readString(){
	string s;
	cin>>s;
	return s;
}

template<class T>
T sq(const T& t){
	return t*t;
}

//#define CAPITAL
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<endl;
	#else
	cout<<"Yes"<<endl;
	#endif
	if(ex)exit(0);
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<endl;
	#else
	cout<<"No"<<endl;
	#endif
	if(ex)exit(0);
}

constexpr ll ten(int n){
	return n==0?1:ten(n-1)*10;
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
int mask(int i){
	return (int(1)<<i)-1;
}

bool inc(int a,int b,int c){
	return a<=b&&b<=c;
}

template<class t> void mkuni(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

ll rand_int(ll l, ll r) { //[l, r]
	#ifdef LOCAL
	static mt19937_64 gen;
	#else
    static random_device rd;
    static mt19937_64 gen(rd());
    #endif
    return uniform_int_distribution<ll>(l, r)(gen);
}

//KUPC2017J
//AOJDSL1A
//without rank
struct unionfind{
	vi p,s;
	int c;
	unionfind(int n):p(n,-1),s(n,1),c(n){}
	int find(int a){
		return p[a]==-1?a:(p[a]=find(p[a]));
	}
	//set b to a child of a
	bool unite(int a,int b){
		a=find(a);
		b=find(b);
		if(a==b)return false;
		p[b]=a;
		s[a]+=s[b];
		c--;
		return true;
	}
	bool same(int a,int b){
		return find(a)==find(b);
	}
	int sz(int a){
		return s[find(a)];
	}
};

//CF530F
//CodeChef Persistent Oak
//AOJ GRL5C
template<class E>
struct HLD{
	vvc<E> g;
	int n,rt,cnt;
	vi sub,in,out,par,head,dep;
	int dfs1(int v,int p,int d){
		par[v]=p;
		dep[v]=d;
		g[v].erase(remove(all(g[v]),p),g[v].ed);
		for(auto&e:g[v]){
			sub[v]+=dfs1(e,v,d+1);
			if(sub[g[v][0]]<sub[e])
				swap(g[v][0],e);
		}
		return sub[v];
	}
	void dfs2(int v,int h){
		in[v]=cnt++;
		head[v]=h;
		for(int to:g[v])
			dfs2(to,to==g[v][0]?h:to);
		out[v]=cnt;
	}
	HLD(const vvc<E>&gg,int rr):g(gg),n(g.size()),rt(rr),cnt(0),
		sub(n,1),in(n),out(n),par(n,-1),head(n),dep(n){
		dfs1(rt,-1,0);
		dfs2(rt,rt);
	}
	int lca(int a,int b){
		while(head[a]!=head[b]){
			if(dep[head[a]]>dep[head[b]])
				swap(a,b);
			b=par[head[b]];
		}
		if(dep[a]>dep[b])
			swap(a,b);
		return a;
	}
	int len(int a,int b){
		return dep[a]+dep[b]-dep[lca(a,b)]*2;
	}
};

//AGC034E
//int(E)->to
template<class N,class E>
struct treedp{
	const vvc<E>& g;
	vvc<N> dp1,dp2;
	vc<N> res;
	N dfs1(int v,int p){
		N tmp;tmp.init(v);
		dp1[v].pb(tmp);
		E up;
		for(auto e:g[v])
			if(e!=p)
				dp1[v].pb(dfs1(e,v));
			else
				up=e;
		dp2[v]=dp1[v];
		rng(i,1,dp2[v].size())
			dp2[v][i]=dp2[v][i-1]+dp2[v][i];
		if(p==-1)return N();
		else return dp2[v].back().up(up);
	}
	void dfs2(int v,int p,N cur){
		res[v]=cur+dp2[v].back();
		per(i,g[v].size()){
			auto e=g[v][i];
			if(e==p)continue;
			dp2[v].pop_back();
			dfs2(e,v,(cur+dp2[v].back()).up(e));
			cur=cur+dp1[v].back();
			dp1[v].pop_back();
		}
	}
	treedp(const vvc<E>&gg):g(gg),dp1(g.size()),dp2(g.size()),res(g.size()){
		dfs1(0,-1);
		N tmp;tmp.init(0);
		dfs2(0,-1,tmp);
	}
};

//usage
vi cnt;
struct N{
	int v,c,s;
	void init(int vv){
		v=vv;
		c=cnt[v];
		s=0;
	}
	N up(int to)const{
		return N{to,c+cnt[to],s+c};
	}
	N operator+(const N&r)const{
		assert(v==r.v);
		return N{v,c+r.c-cnt[v],s+r.s};
	}
};

int calc(vi vs,vc<pi> es,vc<pi> qs1,vi qs2){
	int n=vs.size();
	
	vvc<int> g(n);
	for(auto e:es){
		int a=lower_bound(all(vs),e.a)-vs.bg;
		int b=lower_bound(all(vs),e.b)-vs.bg;
		g[a].pb(b);
		g[b].pb(a);
	}
	
	auto hld=HLD<int>(g,0);
	
	int ans=0;
	for(auto p:qs1){
		int a=lower_bound(all(vs),p.a)-vs.bg;
		int b=lower_bound(all(vs),p.b)-vs.bg;
		
		ans+=hld.len(a,b);
	}
	
	cnt.assign(n,0);
	for(auto v:qs2){
		int a=lower_bound(all(vs),v)-vs.bg;
		cnt[a]++;
	}
	
	auto res=treedp<N,int>(g).res;
	
	int mn=inf;
	rep(i,n)chmin(mn,res[i].s);
	
	return ans+mn;
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	
	int n,m,q;cin>>n>>m>>q;
	
	unionfind uf(n);
	vc<pi> es;
	rep(_,m){
		int a,b;cin>>a>>b;
		a--;b--;
		es.eb(a,b);
		uf.unite(a,b);
	}
	
	vvc<int> vs(n);
	vvc<pi> es2(n);
	vvc<pi> qs1(n);
	vvc<int> qs2(n);
	
	rep(i,n)vs[uf.find(i)].pb(i);
	for(auto e:es)es2[uf.find(e.a)].pb(e);
	
	rep(_,q){
		int a,b;cin>>a>>b;
		a--;b--;
		if(uf.same(a,b)){
			qs1[uf.find(a)].eb(a,b);
		}else{
			qs2[uf.find(a)].pb(a);
			qs2[uf.find(b)].pb(b);
		}
	}
	
	int ans=0;
	rep(i,n)if(uf.find(i)==i)
		ans+=calc(vs[i],es2[i],qs1[i],qs2[i]);
	
	cout<<ans<<endl;
}
0