結果
問題 | No.2316 Freight Train |
ユーザー |
|
提出日時 | 2023-05-26 21:41:07 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 83 ms / 2,000 ms |
コード長 | 2,264 bytes |
コンパイル時間 | 2,242 ms |
コンパイル使用メモリ | 170,448 KB |
実行使用メモリ | 6,656 KB |
最終ジャッジ日時 | 2024-12-25 05:48:40 |
合計ジャッジ時間 | 5,382 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; using pll = pair<ll, ll>; #define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i) #define rep(i, n) drep(i, 0, n - 1) #define all(a) (a).begin(), (a).end() #define pb push_back #define fi first #define se second mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count()); const ll MOD1000000007 = 1000000007; const ll MOD998244353 = 998244353; const ll MOD[3] = {999727999, 1070777777, 1000000007}; const ll LINF = 1LL << 60; const int IINF = 1 << 30 - 1; template<typename T> struct Edge{ int to; T w; Edge(int to_, T w_=1){ to = to_; w=w_; } }; template<typename T> using Tree = vector<vector<Edge<T>>>; template<typename T> using Graph = vector<vector<Edge<T>>>; /* 容量&重み付きエッジ for Dinic */ template<typename T> struct REdge{ int to; T cap; T cost; int rev; REdge(int to_, T cap_, T cost_=1){ to = to_; cap = cap_; cost = cost_; } REdge(int to_, T cap_, T cost_, int rev_){ to = to_; cap = cap_; cost = cost_; rev = rev_; } }; /* 残余グラフ for Dinic */ template<typename T> using RGraph = vector<vector<REdge<T>>>; struct UnionFind{ vector<ll> parent; vector<ll> sizes; UnionFind(ll N) : parent(N), sizes(N, 1){ rep(i, N) parent[i] = i; } ll root(ll x){ if (parent[x] == x) return x; return parent[x] = root(parent[x]); } void unite(ll x, ll y){ ll rx = root(x); ll ry = root(y); if (rx == ry) return; if (sizes[rx] < sizes[ry]) swap(rx, ry); sizes[rx] += sizes[ry]; parent[ry] = rx; } bool same(ll x, ll y){ ll rx = root(x); ll ry = root(y); return rx == ry; } ll size(ll x){ return sizes[root(x)]; } }; int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); ll n, q; cin >> n >> q; UnionFind UF(n); rep(i, n){ ll p; cin >> p; if(p!=-1) UF.unite(i, p-1); } rep(i, q){ ll a, b; cin >> a >> b; a--; b--; if(UF.same(a, b)) cout << "Yes" << '\n'; else cout << "No" << '\n'; } }