結果
問題 | No.2618 除霊 |
ユーザー | dyktr_06 |
提出日時 | 2024-01-27 00:17:08 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 209 ms / 2,000 ms |
コード長 | 5,475 bytes |
コンパイル時間 | 2,569 ms |
コンパイル使用メモリ | 211,576 KB |
実行使用メモリ | 25,224 KB |
最終ジャッジ日時 | 2024-01-27 00:17:21 |
合計ジャッジ時間 | 13,007 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,676 KB |
testcase_01 | AC | 2 ms
6,676 KB |
testcase_02 | AC | 2 ms
6,676 KB |
testcase_03 | AC | 2 ms
6,676 KB |
testcase_04 | AC | 2 ms
6,676 KB |
testcase_05 | AC | 2 ms
6,676 KB |
testcase_06 | AC | 168 ms
23,116 KB |
testcase_07 | AC | 159 ms
22,908 KB |
testcase_08 | AC | 209 ms
23,824 KB |
testcase_09 | AC | 183 ms
23,656 KB |
testcase_10 | AC | 198 ms
24,448 KB |
testcase_11 | AC | 148 ms
22,956 KB |
testcase_12 | AC | 175 ms
22,796 KB |
testcase_13 | AC | 109 ms
23,420 KB |
testcase_14 | AC | 141 ms
24,752 KB |
testcase_15 | AC | 122 ms
23,068 KB |
testcase_16 | AC | 122 ms
23,024 KB |
testcase_17 | AC | 143 ms
25,160 KB |
testcase_18 | AC | 139 ms
24,212 KB |
testcase_19 | AC | 126 ms
23,776 KB |
testcase_20 | AC | 108 ms
23,232 KB |
testcase_21 | AC | 144 ms
24,152 KB |
testcase_22 | AC | 143 ms
25,224 KB |
testcase_23 | AC | 130 ms
23,744 KB |
testcase_24 | AC | 132 ms
23,424 KB |
testcase_25 | AC | 149 ms
25,208 KB |
testcase_26 | AC | 137 ms
24,148 KB |
testcase_27 | AC | 123 ms
23,348 KB |
testcase_28 | AC | 128 ms
23,684 KB |
testcase_29 | AC | 152 ms
25,180 KB |
testcase_30 | AC | 152 ms
25,144 KB |
testcase_31 | AC | 180 ms
23,176 KB |
testcase_32 | AC | 168 ms
23,364 KB |
testcase_33 | AC | 161 ms
23,492 KB |
testcase_34 | AC | 158 ms
22,788 KB |
testcase_35 | AC | 166 ms
23,276 KB |
testcase_36 | AC | 178 ms
24,020 KB |
testcase_37 | AC | 176 ms
23,536 KB |
testcase_38 | AC | 189 ms
24,328 KB |
testcase_39 | AC | 193 ms
24,480 KB |
testcase_40 | AC | 191 ms
24,116 KB |
testcase_41 | AC | 196 ms
24,792 KB |
testcase_42 | AC | 198 ms
24,616 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define overload4(_1, _2, _3, _4, name, ...) name #define rep1(n) for(int i = 0; i < (int)(n); ++i) #define rep2(i, n) for(int i = 0; i < (int)(n); ++i) #define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i) #define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i) #define ALL(a) (a).begin(), (a).end() #define Sort(a) (sort((a).begin(), (a).end())) #define RSort(a) (sort((a).rbegin(), (a).rend())) #define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end())) typedef long long int ll; typedef unsigned long long ul; typedef long double ld; typedef vector<int> vi; typedef vector<long long> vll; typedef vector<char> vc; typedef vector<string> vst; typedef vector<double> vd; typedef vector<long double> vld; typedef pair<long long, long long> P; template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); } template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); } template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); } const long long MINF = 0x7fffffffffff; const long long INF = 0x1fffffffffffffff; const long long MOD = 998244353; const long double EPS = 1e-9; const long double PI = acos(-1); template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; } template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; } template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; } template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; } template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; } template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; } template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; } template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; } template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; } template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; } template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; } template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; } template<class... T> void in(T&... a){ (cin >> ... >> a); } void out(){ cout << '\n'; } template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; } template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } } ll n, m; vll v; vector<vll> G; void input(){ in(n); G.resize(n); rep(i, n - 1){ ll a, b; in(a, b); a--, b--; G[a].push_back(b); G[b].push_back(a); } in(m); vin(v, m); } void solve(){ vll cnt(n); vll check(n); ll now = 0; auto del = [&](ll i){ if(check[i] == 0){ return false; } cnt[i]--; if(cnt[i] == 0) now--; for(auto x : G[i]){ cnt[x]--; if(cnt[x] == 0) now--; } return true; }; auto add = [&](ll i){ check[i] = 1; cnt[i]++; if(cnt[i] == 1) now++; for(auto x : G[i]){ cnt[x]++; if(cnt[x] == 1) now++; } }; rep(i, m){ v[i]--; add(v[i]); } vll only(n); rep(i, m){ if(cnt[v[i]] == 1) only[v[i]]++; for(auto x : G[v[i]]){ if(cnt[x] == 1) only[v[i]]++; } } vll ans(n); rep(i, n){ ll res = now; ll is_i = check[i]; if(is_i) res -= only[i]; for(auto x : G[i]){ if(check[x]){ res -= only[x]; if(is_i && cnt[x] == 2) res--; } } if(cnt[i] > 1) res--; ans[i] = res; } vout(ans); } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20); input(); solve(); }