結果
問題 | No.2431 Viral Hotel |
ユーザー | akiaa11 |
提出日時 | 2023-08-19 20:22:55 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 126 ms / 2,000 ms |
コード長 | 3,723 bytes |
コンパイル時間 | 4,948 ms |
コンパイル使用メモリ | 267,892 KB |
実行使用メモリ | 14,280 KB |
最終ジャッジ日時 | 2024-05-07 03:18:38 |
合計ジャッジ時間 | 9,159 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 92 ms
10,412 KB |
testcase_01 | AC | 79 ms
10,036 KB |
testcase_02 | AC | 92 ms
10,472 KB |
testcase_03 | AC | 106 ms
11,200 KB |
testcase_04 | AC | 108 ms
11,968 KB |
testcase_05 | AC | 116 ms
11,968 KB |
testcase_06 | AC | 18 ms
6,940 KB |
testcase_07 | AC | 17 ms
6,940 KB |
testcase_08 | AC | 17 ms
6,944 KB |
testcase_09 | AC | 2 ms
6,940 KB |
testcase_10 | AC | 2 ms
6,940 KB |
testcase_11 | AC | 2 ms
6,944 KB |
testcase_12 | AC | 126 ms
13,832 KB |
testcase_13 | AC | 111 ms
10,744 KB |
testcase_14 | AC | 49 ms
7,684 KB |
testcase_15 | AC | 17 ms
6,948 KB |
testcase_16 | AC | 67 ms
11,612 KB |
testcase_17 | AC | 40 ms
6,940 KB |
testcase_18 | AC | 101 ms
12,352 KB |
testcase_19 | AC | 65 ms
9,272 KB |
testcase_20 | AC | 29 ms
6,940 KB |
testcase_21 | AC | 22 ms
6,944 KB |
testcase_22 | AC | 62 ms
8,516 KB |
testcase_23 | AC | 69 ms
8,128 KB |
testcase_24 | AC | 39 ms
7,308 KB |
testcase_25 | AC | 90 ms
9,836 KB |
testcase_26 | AC | 56 ms
8,636 KB |
testcase_27 | AC | 60 ms
8,052 KB |
testcase_28 | AC | 48 ms
7,296 KB |
testcase_29 | AC | 47 ms
7,020 KB |
testcase_30 | AC | 55 ms
7,532 KB |
testcase_31 | AC | 79 ms
10,064 KB |
testcase_32 | AC | 21 ms
6,940 KB |
testcase_33 | AC | 43 ms
6,944 KB |
testcase_34 | AC | 5 ms
6,940 KB |
testcase_35 | AC | 15 ms
6,940 KB |
testcase_36 | AC | 84 ms
10,232 KB |
testcase_37 | AC | 56 ms
8,284 KB |
testcase_38 | AC | 27 ms
6,940 KB |
testcase_39 | AC | 2 ms
6,944 KB |
testcase_40 | AC | 2 ms
6,940 KB |
testcase_41 | AC | 2 ms
6,940 KB |
testcase_42 | AC | 2 ms
6,944 KB |
testcase_43 | AC | 101 ms
14,280 KB |
testcase_44 | AC | 63 ms
9,192 KB |
testcase_45 | AC | 49 ms
7,884 KB |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> #define SELECTER(_1,_2,_3,SELECT,...) SELECT #define rep1(i,n) for(int i=0;i<(int)n;++i) #define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i) #define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__) #define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT #define rrep1(i,n) for(int i=(int)n-1;i>=0;--i) #define rrep2(i,a,n) for(int i=(int)n-1;i>=(int)a;--i) #define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define fi first #define se second #define PrintR LogOutput #ifdef _DEBUG #define Log(...) LogOutput(__VA_ARGS__) #else #define Log(...) #endif using namespace std; using namespace atcoder; using ll=long long; using pii=pair<int,int>; using pll=pair<long long,long long>; using pdd=pair<long double,long double>; using veci=vector<int>; using vecpii=vector<pair<int,int>>; using vecll=vector<long long>; using vecpll=vector<pair<long long,long long>>; using vecpdd=vector<pair<long double,long double>>; using vecs=vector<string>; using vecb=vector<bool>; using vecd=vector<double>; using tp=tuple<int,int,int>; using tpll=tuple<ll,ll,ll>; using mint=modint998244353; using mint10=modint1000000007; template<typename T, typename S> istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;} template<typename T, typename S> ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;} ostream& operator<<(ostream& out, const mint& a){return out << a.val();} ostream& operator<<(ostream& out, const mint10& a){return out << a.val();} ostream& operator<<(ostream& out, const modint& a){return out << a.val();} template<typename T> ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;} template<typename T, typename S> pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};} template<typename T, typename S> pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};} 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;} bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;} constexpr ll INF=numeric_limits<ll>::max() / 4; constexpr ll MOD=998244353; const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0}; template<typename... Args> void LogOutput(Args&&... args){ stringstream ss; ((ss << args << ' '), ...); cout << ss.str().substr(0, ss.str().length() - 1) << endl; } template<typename T> void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);} int main(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); int n, k, m, p;cin>>n>>k>>m>>p; vector<veci> g(n); rep(i, m){ int a, b;cin>>a>>b; a--, b--; g[a].push_back(b); g[b].push_back(a); } veci a(n); rep(i, n) cin>>a[i]; veci cnt(n, 0); priority_queue<pll, vecpll, greater<pll>> q; rep(i, k){ int b;cin>>b; b--; q.emplace(p, -b); q.emplace(a[b], b + 1); cnt[b]++; } veci res(n, 2); int ans = 0; veci d; while(q.size()){ auto [b, c] = q.top(); q.pop(); if(c > 0){ c--; if(res[c]){ for(int nv : g[c]) if(res[nv] == 2){ cnt[nv]++; if(cnt[nv] == 2){ d.push_back(nv); ans++; }else if(cnt[nv] == 1){ q.emplace(b + p, -nv); q.emplace(b + a[nv], nv + 1); } } } }else{ if(res[-c] == 2) res[-c] = 1; } if(q.size() && b == q.top().fi) continue; while(d.size()) res[d.back()] = 0, d.pop_back(); } cout<<ans<<endl; }