結果

問題 No.1293 2種類の道路
ユーザー hamamu
提出日時 2020-11-20 22:17:47
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 104 ms / 2,000 ms
コード長 4,959 bytes
コンパイル時間 2,272 ms
コンパイル使用メモリ 208,928 KB
最終ジャッジ日時 2025-01-16 02:29:34
ジャッジサーバーID
(参考情報)
judge5 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

·#include "bits/stdc++.h"
using namespace std;
using ll=long long; using dd=double;
using vll=vector< ll>; using vdd=vector< dd>;
using vvll=vector< vll>; using vvdd=vector<vdd>;
using vvvll=vector< vvll>;
using vvvvll=vector<vvvll>;
using pll=pair<ll,ll>; using tll=tuple<ll,ll,ll>; using qll=tuple<ll,ll,ll,ll>;
using vpll=vector< pll>; using vtll=vector< tll>; using vqll=vector< qll>;
using vvpll=vector<vpll>; using vvtll=vector<vtll>; using vvqll=vector<vqll>;
constexpr ll INF = 1LL << 60;
struct Fast{ Fast(){ cin.tie(0); ios::sync_with_stdio(false); cout<<fixed<<setprecision(numeric_limits<double>::max_digits10); } } fast;
#define REPS(i, S, E) for (ll i = (S); i <= (E); i++)
#define REP(i, N) REPS(i, 0, (N)-1)
#define DEPS(i, S, E) for (ll i = (E); i >= (S); i--)
#define DEP(i, N) DEPS(i, 0, (N)-1)
#define rep(i, S, E) for (ll i = (S); i <= (E); i++)
#define dep(i, E, S) for (ll i = (E); i >= (S); i--)
#define each(e, v) for (auto&& e : v)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; }return false; }
template<class T> inline T MaxE(vector<T>&v,ll S,ll E){ T m=v[S]; rep(i,S,E)chmax(m,v[i]); return m; }
template<class T> inline T MinE(vector<T>&v,ll S,ll E){ T m=v[S]; rep(i,S,E)chmin(m,v[i]); return m; }
template<class T> inline T MaxE(vector<T> &v) { return MaxE(v,0,(ll)v.size()-1); }
template<class T> inline T MinE(vector<T> &v) { return MinE(v,0,(ll)v.size()-1); }
template<class T> inline T Sum(vector<T> &v,ll S,ll E){ T s=T(); rep(i,S,E)s+=v[i]; return s; }
template<class T> inline T Sum(vector<T> &v) { return Sum(v,0,v.size()-1); }
template<class T> inline ll sz(T &v){ return (ll)v.size(); }
inline ll CEIL(ll a,ll b){ return (a<0) ? -(-a/b) : (a+b-1)/b; }
inline ll FLOOR(ll a,ll b){ return -CEIL(-a,b); }
#if 0
#include <atcoder/all>
using namespace atcoder;
#endif
vvll cinGraph(ll nodeNum,ll edgeNum,bool isDirected){//falsetrue
vvll to(nodeNum);
rep(i,0,edgeNum-1){
ll v,u; cin >> v >> u;
v--; u--;
to[v].push_back(u);
if (!isDirected) to[u].push_back(v);
}
return move(to);
}
struct ConnectedComponents{
vvll &to; ll n; vll ccids;
ConnectedComponents(vvll &to):to(to),n((ll)to.size()),ccids(n,-1){}
void dfs(ll v){
each(u,to[v]){
if (ccids[u]!=-1)continue;
ccids[u]=ccids[v];
dfs(u);
}
}
pair<ll,vll> get(){
ll nm=0;
rep(v,0,n-1){
if (ccids[v]!=-1)continue;
ccids[v]=nm++;
dfs(v);
}
return {nm,move(ccids)};
}
};
template<class T> struct SET{
set<T> s;
typename set<T>::iterator it;
bool empty() const { return s.empty(); }
ll size() const { return (ll)s.size(); }
void clear() { return s.clear(); }
bool insert(const T &x){ bool r; tie(it,r)=s.insert(x); return r; }
template <class It> void insert(It b,It e){ s.insert(b,e); }
void erase(const T &x){ s.erase(x); }
void eraseit(){ s.erase(it); }
void swap(SET &b){ s.swap(b.s); }
bool contains(const T &x){ find(x); return it != s.end(); }
void find(const T &x){ it=s.find(x); }
T next() { return *(++it); }
T prev() { return *(--it); }
pair<T, bool> Next(){
if (it!=s.end()) it++;
if (it!=s.end()) return {*it,true};
else return {T(),false};
}
pair<T, bool> Prev(){
if (it!=s.begin()) return {*(--it), true};
else return {T(),false};
}
T front() const{ return *s.begin(); }
T back() const{ return *(--s.end()); }
void pop_front(){ s.erase(s.begin()); }
void pop_back(){ s.erase(--s.end()); }
void push_front(const T &x){ it=s.insert(s.begin(), x); }
void push_back(const T &x){ it=s.insert(s.end(), x); }
void push_out(SET &b){ b.push_front(back()); pop_back(); }
void pull_in(SET &b){ push_back(b.front()); b.pop_front(); }
#ifdef _DEBUG
void dump(){
each(e, s) cout << e << " ";
cout << '\n';
}
#endif
};
void solve()
{
ll n,d,w; cin >> n >> d >> w;
vvll tod = cinGraph(n,d,false);
vvll tow = cinGraph(n,w,false);
ll dnm; vll dids; tie(dnm,dids)=ConnectedComponents(tod).get();
ll wnm; vll wids; tie(wnm,wids)=ConnectedComponents(tow).get();
vvll vof(dnm);//vof[did]
rep(v,0,n-1){
ll did=dids[v];
vof[did].push_back(v);
}
vll wsz(wnm);
each(e,wids) wsz[e]++;
ll ans=0;
rep(did,0,dnm-1){
SET<ll> st;
ll cnt=0;
each(v,vof[did]){
ll wid=wids[v];
ll x = wsz[wid];
if (x==1)continue;
st.insert(wid);
cnt++;
}
ll nm=sz(vof[did]);
ll de=nm-cnt;
each(wid,st.s){
de+=wsz[wid];
}
ans+=nm*(de-1);
}
cout << ans << '\n';
}
int main(){
#if 1
solve();
//cin2solve();
//generand();
#else
ll t; cin >> t;
rep(i, 0, t-1){
solve();
//cin2solve();
}
#endif
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0