結果
問題 | No.3093 Safe Infection |
ユーザー |
![]() |
提出日時 | 2025-04-06 16:58:31 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 61 ms / 2,000 ms |
コード長 | 3,618 bytes |
コンパイル時間 | 3,972 ms |
コンパイル使用メモリ | 288,480 KB |
実行使用メモリ | 13,952 KB |
最終ジャッジ日時 | 2025-04-06 16:58:40 |
合計ジャッジ時間 | 7,501 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 70 |
ソースコード
// #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") #include<bits/stdc++.h> using namespace std; using uint = unsigned int; using ll = long long; using ull = unsigned long long; using ld = long double; template<class T> using V = vector<T>; template<class T> using VV = V<V<T>>; template<class T> using VVV = V<VV<T>>; template<class T> using VVVV = VV<VV<T>>; #define rep(i,n) for(ll i=0ll;(i)<(n);(i)++) #define REP(i,a,n) for(ll i=(a);(i)<(n);(i)++) #define rrep(i,n) for(ll i=(n)-1;(i)>=(0ll);(i)--) #define RREP(i,a,n) for(ll i=(n)-1;(i)>=(a);(i)--) const long long INF = (1LL << 60); const long long mod99 = 998244353; const long long mod107 = 1000000007; const long long mod = mod99; #define eb emplace_back #define be(v) (v).begin(),(v).end() #define all(v) (v).begin(),(v).end() #define foa(i,v) for(auto& (i) : (v)) #define UQ(v) sort(be(v)), (v).erase(unique(be(v)), (v).end()) #define UQ2(v,cmp) sort(be(v)), (v).erase(unique(be(v),cmp), (v).end()) #define UQ3(v,cmp) sort(be(v),cmp), (v).erase(unique(be(v)), (v).end()) #define UQ4(v,cmp,cmp2) sort(be(v), cmp), (v).erase(unique(be(v),cmp2), (v).end()) #define LB(x,v) (lower_bound(be(v),(x))-(v).begin()) #define LB2(x,v,cmp) (lower_bound(be(v),(x),(cmp))-(v).begin()) #define UB(x,v) (upper_bound(be(v),(x))-(v).begin()) #define UB2(x,v,cmp) (upper_bound(be(v),(x),(cmp))-(v).begin()) #define dout() cout << fixed << setprecision(20) #define randinit() srand((unsigned)time(NULL)) template<class T, class U> bool chmin(T& t, const U& u) { if (t > u){ t = u; return 1;} return 0; } template<class T, class U> bool chmax(T& t, const U& u) { if (t < u){ t = u; return 1;} return 0; } ll Rnd(ll L=0, ll R=mod99){return rand()%(R-L)+L;} struct UnionFind { vector<long long> par; long long gn; UnionFind(long long N) : par(N, -1), gn(N){ } long long root(long long x) { if (par[x] < 0) return x; return par[x] = root(par[x]); } long long size(long long x) { return -par[root(x)]; } bool merge(long long x, long long y) { long long rx = root(x), ry = root(y); if (rx == ry) return 0; gn --; // if (par[rx] < par[ry]) swap(rx, ry); par[ry] += par[rx]; par[rx] = ry; return 1; } bool same(long long x, long long y) { return root(x) == root(y); } }; void solve(){ ll n,m,k; cin >> n >> m >> k; V<ll> a(n); rep(i,n) cin >> a[i]; // V<set<ll>> G(n); VV<ll> G(n); rep(i,m){ ll u,v; cin >> u >> v; u--; v--; // G[u].insert(v); // G[v].insert(u); G[u].eb(v); G[v].eb(u); } V<ll> ord(n); rep(i,n) ord[i] = i; auto cmp = [&](const ll&i, const ll&j) -> bool { return a[i] < a[j]; }; V<ll> L = a, R = a; UnionFind uf(n); sort(be(ord), cmp); V<ll> seen(n, 0); for(auto nd:ord){ seen[nd] = 1; for(auto nx:G[nd]) if(seen[nx] and uf.root(nx) != uf.root(nd)){ nx = uf.root(nx); // cout << nd << " " << nx << " " << a[nd] << " " << R[nx] << endl; if(a[nd] - R[nx] <= k){ // cout << nd << " " << nx << endl; chmin(L[nd], L[nx]); uf.merge(nx, nd); // assert(uf.root(nd) == nd); } } } if(uf.size(0) == n) cout << "Yes" << endl; else cout << "No" << endl; } int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); int t=1; // cin >> t; rep(i,t) solve(); }