結果
問題 | No.1442 I-wate Shortest Path Problem |
ユーザー | 👑 tute7627 |
提出日時 | 2021-03-26 22:47:14 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 381 ms / 3,000 ms |
コード長 | 9,779 bytes |
コンパイル時間 | 2,648 ms |
コンパイル使用メモリ | 232,084 KB |
実行使用メモリ | 47,648 KB |
最終ジャッジ日時 | 2024-11-29 00:44:04 |
合計ジャッジ時間 | 9,338 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 1 ms
6,816 KB |
testcase_02 | AC | 6 ms
6,816 KB |
testcase_03 | AC | 29 ms
6,820 KB |
testcase_04 | AC | 6 ms
6,820 KB |
testcase_05 | AC | 5 ms
6,820 KB |
testcase_06 | AC | 29 ms
6,820 KB |
testcase_07 | AC | 5 ms
6,816 KB |
testcase_08 | AC | 26 ms
6,816 KB |
testcase_09 | AC | 12 ms
6,816 KB |
testcase_10 | AC | 33 ms
6,820 KB |
testcase_11 | AC | 30 ms
6,816 KB |
testcase_12 | AC | 266 ms
37,896 KB |
testcase_13 | AC | 118 ms
25,080 KB |
testcase_14 | AC | 213 ms
34,616 KB |
testcase_15 | AC | 168 ms
28,104 KB |
testcase_16 | AC | 228 ms
31,576 KB |
testcase_17 | AC | 378 ms
36,616 KB |
testcase_18 | AC | 381 ms
37,072 KB |
testcase_19 | AC | 305 ms
37,348 KB |
testcase_20 | AC | 374 ms
35,968 KB |
testcase_21 | AC | 369 ms
36,432 KB |
testcase_22 | AC | 122 ms
34,888 KB |
testcase_23 | AC | 307 ms
47,648 KB |
testcase_24 | AC | 92 ms
24,292 KB |
testcase_25 | AC | 251 ms
35,016 KB |
testcase_26 | AC | 107 ms
32,476 KB |
ソースコード
//#define _GLIBCXX_DEBUG #include<bits/stdc++.h> using namespace std; #define endl '\n' #define lfs cout<<fixed<<setprecision(10) #define ALL(a) (a).begin(),(a).end() #define ALLR(a) (a).rbegin(),(a).rend() #define spa << " " << #define fi first #define se second #define MP make_pair #define MT make_tuple #define PB push_back #define EB emplace_back #define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++) #define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--) using ll = long long; using ld = long double; const ll MOD1 = 1e9+7; const ll MOD9 = 998244353; const ll INF = 1e18; using P = pair<ll, ll>; template<typename T> using PQ = priority_queue<T>; template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>; template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;} template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;} ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});} void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;} void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;} void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;} template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} template<typename T>void debug(const T &v,ll h,ll w,string sv=" "){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}}; template<typename T>void debug(const T &v,ll n,string sv=" "){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;}; template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;} ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;} vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1}; template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);} template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));} template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;} template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;} template<typename T>void rearrange(vector<int>&ord, vector<T>&v){ auto tmp = v; for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]]; } template<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){ rearrange(ord, head); rearrange(ord, tail...); } template<typename T> vector<int> ascend(const vector<T>&v){ vector<int>ord(v.size());iota(ord.begin(),ord.end(),0); sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]<v[j];}); return ord; } template<typename T> vector<int> descend(const vector<T>&v){ vector<int>ord(v.size());iota(ord.begin(),ord.end(),0); sort(ord.begin(),ord.end(),[&](int i,int j){return v[i]>v[j];}); return ord; } ll FLOOR(ll n,ll div){return n>=0?n/div:(n-div+1)/div;} ll CEIL(ll n,ll div){return n>=0?(n+div-1)/div:n/div;} template<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());} template<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());} template<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());}; //mt19937 mt(chrono::steady_clock::now().time_since_epoch().count()); int popcount(ll x){return __builtin_popcountll(x);}; int poplow(ll x){return __builtin_ctzll(x);}; int pophigh(ll x){return 63 - __builtin_clzll(x);}; template<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;}; template<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;}; template<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;}; template<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;}; template< typename T = int > struct edge { int to; T cost; int id; edge() = default; edge(int to, T _cost = 1, int id = -1):to(to), cost(_cost), id(id){} operator int() const { return to; } }; template<typename T> using Graph = vector<vector<edge<T>>>; template<typename T> Graph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){ Graph<T> ret(n); for(int es = 0; es < m; es++){ int u,v,w=1; cin>>u>>v;u-=indexed,v-=indexed; if(weighted)cin>>w; ret[u].emplace_back(v,w*2,es); if(!directed)ret[v].emplace_back(u,w*2,es); } return ret; } template<typename T> Graph<T> readParent(int n,int indexed=1,bool directed=true){ Graph<T>ret(n); for(int i=1;i<n;i++){ int p;cin>>p; p-=indexed; ret[p].emplace_back(i); if(!directed)ret[i].emplace_back(p); } return ret; } template<typename T> vector<ll> dijkstra(Graph<T>&g,ll s = 0) { using PT=pair<ll,int>; priority_queue<PT, vector<PT>, greater<PT> > que; vector<ll>dist(g.size(),INF); dist[s] = 0; que.emplace(0, s); while (!que.empty()) { PT p = que.top(); que.pop(); int v = p.second; if (dist[v] < p.first) continue; for(auto e:g[v]) { if (dist[e.to] > dist[v] + e.cost) { dist[e.to] = dist[v] + e.cost; que.emplace(dist[e.to], e.to); } } } return dist; } template<typename T> struct HLD{ using D=long long; int n; vector<int>sz;//部分木サイズ vector<D>dep; vector<int>par; vector<int>head; Graph<T> &g;//隣接リスト vector<edge<T>>edges;//データ構造に乗せるedge列 vector<int>in,out;//[in,out)で部分木、[ina,inb]でa~bのパス(aが上) vector<int>comp;//連結成分の根 //inは頂点のindexを表す。また、edge列の下側の頂点である HLD(Graph<T> &g,int r=-1):g(g),n(g.size()){ hld_build(r); } void hld_build(int root = -1){ in.assign(n,-1);out.assign(n,-1);dep.assign(n,0); par.assign(n,-1);head.assign(n,-1);sz.assign(n,-1);comp.assign(n,-1); edges.assign(n,edge<T>()); if(root == -1){//根がどこでも良い場合(森でも可) for(int i=0;i<n;i++){ if(sz[i] == -1){ head[i] = i; dfs_sz(i, 0, i); dfs_hld(i); } } } else{ head[root] = root; dfs_sz(root, 0, root); dfs_hld(root); } } void dfs_sz(int k, D d,int r){ sz[k] = 1; comp[k] = r; dep[k] = d; for(auto &e: g[k]){ if(e.to == par[k])continue; par[e.to] = k; dfs_sz(e.to, d+e.cost, r); sz[k] += sz[e.to]; if(sz[e.to] > sz[g[k][0].to])swap(e, g[k][0]); } } int time = 0; void dfs_hld(int k){ in[k] = time++; for(auto e:g[k]){ if(e.to == par[k])continue; head[e.to] = (e.to == g[k][0].to ? head[k]: e.to); edges[time] = e; dfs_hld(e.to); } out[k] = time; } int lca(int p,int q){ while(1){ if(in[p] < in[q])swap(p,q); if(head[p] == head[q])return q; p = par[head[p]]; } } vector<pair<int,int>>query_path(int p,int q,bool isEdge){ int r=lca(p,q); vector<pair<int,int>>ret; for(int i=0;i<2;i++){ if(i == 1)swap(p,q); while(1){ if(isEdge&&p==r)break; if(head[p]==head[r]){ ret.emplace_back(in[r]+(isEdge?1:i),in[p]+1); break; } ret.emplace_back(in[head[p]],in[p]+1); p = par[head[p]]; } } return ret; } vector<vector<pair<int,int>>>query_order_path(int p,int q,bool isEdge){ //非可換クエリ用、配列0を順番を反転したデータ構造に、配列1を通常のデータ構造に vector<vector<pair<int,int>>>ret(2); int r=lca(p,q); for(int i=0;i<2;i++){ if(i == 1)swap(p,q); while(1){ if(isEdge&&p==r)break; if(head[p]==head[r]){ if(i==0) ret[i].emplace_back(n-(in[p]+1),n-(in[r]+(isEdge?1:i))); else ret[i].emplace_back(in[r]+(isEdge?1:i),in[p]+1); break; } if(i==0) ret[i].emplace_back(n-(in[p]+1),n-(in[head[p]])); else ret[i].emplace_back(in[head[p]],in[p]+1); p = par[head[p]]; } } reverse(ret[1].begin(), ret[1].end()); return ret; } pair<int,int>query_subtree(int p,bool isEdge){ return make_pair(in[p]+isEdge,out[p]); } //uのv方向の子 子孫関係は前もって確認すること(in,outを見る) int child(int u,int v){ while(1){ if(head[u]==head[v]){ v=g[u][0].to; break; } v=head[v]; if(par[v]==u)break; v=par[v]; } return v; } //uをv方向に一つ進めた頂点 int move(int u,int v){ assert(u!=v); if(in[u]<in[v]&&in[v]<out[v])return child(u,v); else return par[u]; } D dist(int u,int v){ return dep[u]+dep[v]-2*dep[lca(u,v)]; } vector<int>rev_in; int climb(int u,int k){ if(rev_in.empty()){ rev_in.resize(n); for(int i=0;i<n;i++)rev_in[in[i]]=i; } int nd=max<int>(dep[u]-k, 0); while(dep[u]>nd){ if(dep[head[u]]>nd){ u=par[head[u]]; } else{ u=rev_in[in[head[u]]+nd-dep[head[u]]]; } } return u; } }; int main(){ cin.tie(nullptr); ios_base::sync_with_stdio(false); ll res=0,buf=0; bool judge = true; ll n,k;cin>>n>>k; auto g1=readGraph<ll>(n,n-1,1,false,true); auto g2=g1; g2.resize(n+k); HLD hld(g1); rep(i,0,k){ ll m,p;cin>>m>>p; rep(j,0,m){ ll x;cin>>x;x--; g2[x].EB(i+n,p); g2[i+n].EB(x,p); } } vector<vector<ll>>d; rep(i,0,k){ d.PB(dijkstra(g2,n+i)); //debug(d[i],n+k); } ll q;cin>>q; while(q--){ ll u,v;cin>>u>>v;u--;v--; ll ret=hld.dist(u,v); rep(i,0,k){ //cout<<i spa u spa v spa d.size() spa d[i].size()<<endl; chmin(ret,d[i][u]+d[i][v]); } cout<<ret/2<<endl; } return 0; }