結果
問題 | No.2892 Lime and Karin |
ユーザー | 👑 potato167 |
提出日時 | 2024-09-13 22:18:43 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 205 ms / 8,000 ms |
コード長 | 6,330 bytes |
コンパイル時間 | 2,923 ms |
コンパイル使用メモリ | 227,300 KB |
実行使用メモリ | 72,912 KB |
最終ジャッジ日時 | 2024-09-13 22:18:54 |
合計ジャッジ時間 | 10,515 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 2 ms
5,376 KB |
testcase_14 | AC | 101 ms
19,680 KB |
testcase_15 | AC | 69 ms
19,564 KB |
testcase_16 | AC | 116 ms
34,204 KB |
testcase_17 | AC | 30 ms
11,252 KB |
testcase_18 | AC | 117 ms
34,184 KB |
testcase_19 | AC | 155 ms
35,916 KB |
testcase_20 | AC | 11 ms
5,612 KB |
testcase_21 | AC | 86 ms
20,364 KB |
testcase_22 | AC | 120 ms
34,292 KB |
testcase_23 | AC | 50 ms
18,232 KB |
testcase_24 | AC | 163 ms
36,056 KB |
testcase_25 | AC | 191 ms
36,000 KB |
testcase_26 | AC | 158 ms
35,988 KB |
testcase_27 | AC | 162 ms
36,072 KB |
testcase_28 | AC | 168 ms
36,004 KB |
testcase_29 | AC | 163 ms
36,332 KB |
testcase_30 | AC | 161 ms
36,016 KB |
testcase_31 | AC | 173 ms
36,096 KB |
testcase_32 | AC | 161 ms
36,108 KB |
testcase_33 | AC | 161 ms
36,032 KB |
testcase_34 | AC | 164 ms
60,636 KB |
testcase_35 | AC | 170 ms
60,764 KB |
testcase_36 | AC | 172 ms
60,640 KB |
testcase_37 | AC | 171 ms
60,764 KB |
testcase_38 | AC | 193 ms
60,632 KB |
testcase_39 | AC | 146 ms
50,152 KB |
testcase_40 | AC | 164 ms
72,912 KB |
testcase_41 | AC | 121 ms
44,872 KB |
testcase_42 | AC | 145 ms
65,476 KB |
testcase_43 | AC | 132 ms
51,012 KB |
testcase_44 | AC | 62 ms
19,020 KB |
testcase_45 | AC | 143 ms
35,128 KB |
testcase_46 | AC | 69 ms
19,440 KB |
testcase_47 | AC | 102 ms
32,928 KB |
testcase_48 | AC | 40 ms
11,792 KB |
testcase_49 | AC | 113 ms
33,704 KB |
testcase_50 | AC | 173 ms
60,696 KB |
testcase_51 | AC | 176 ms
60,956 KB |
testcase_52 | AC | 171 ms
60,832 KB |
testcase_53 | AC | 173 ms
60,952 KB |
testcase_54 | AC | 205 ms
60,700 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using std::cout; using std::cin; using std::endl; using ll=long long; using ld=long double; const ll ILL=2167167167167167167; const int INF=2100000000; #define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++) #define all(p) p.begin(),p.end() template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>; template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();} template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();} template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;} template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;} template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());} template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});} bool yneos(bool a,bool upp=0){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;} template<class T> void vec_out(vector<T> &p,int ty=0){ if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";} else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}} template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;} template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;} template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;} int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;} template<class T> bool inside(T l,T x,T r){return l<=x&&x<r;} const int D = 18; struct node{ ll sum = 0; int depth = D - 1; array<int, 2> to = {-1, -1}; }; int f(int a,int d){ return (a & (1 << d)) != 0; } vector<node> nodes; struct binary{ int root; int C = 0; binary(){ root = nodes.size(); node tmp; nodes.push_back(tmp); } void set(int a, ll v = 1){ a -= C; int ind = root; nodes[ind].sum += v; while (nodes[ind].depth != -1){ int b = f(a, nodes[ind].depth); if (nodes[ind].to[b] == -1){ nodes[ind].to[b] = nodes.size(); node tmp; tmp.depth = nodes[ind].depth - 1; nodes.push_back(tmp); } ind = nodes[ind].to[b]; nodes[ind].sum += v; } } ll prod(int l, int r){ ll res = 0; r -= C; auto calc = [&](auto self, int ind, int vall, int varr){ if (ind == -1) return; if (l <= vall && varr <= r){ res += nodes[ind].sum; return; } if (varr <= l || r <= vall) return; varr = vall + (varr - vall) / 2; for (int i = 0; i < 2; i++){ self(self, nodes[ind].to[i], vall, varr); swap(vall, varr); varr += 2 * (vall - varr); } }; calc(calc, root, 0, 1 << D); return res; } vector<pair<int, ll>> get_list(){ vector<pair<int, ll>> res; auto f = [&](auto self, int ind, int val) -> void { if (ind == -1) return; if (nodes[ind].depth == -1){ res.push_back({val + C, nodes[ind].sum}); return; } for (int i = 0; i < 2; i++){ self(self, nodes[ind].to[i], val + i * (1 << nodes[ind].depth)); } }; f(f, root, 0); return res; } }; std::vector<std::vector<int>> tree_in(int N){ std::vector<std::vector<int>> G(N); for(int i=0;i<N-1;i++){ int a;int b; cin>>a>>b; a--,b--; G[a].push_back(b); G[b].push_back(a); } return G; } std::tuple<std::vector<int>,std::vector<int>,std::vector<int>> tree_order_pare_depth(std::vector<std::vector<int>> &G,int root){ int n=G.size(); std::vector<int> order={root},pare(n,-1),depth(n); pare[root]=-2; for(int i=0;i<n;i++){ int a=order[i]; for(auto x:G[a]){ if(pare[x]==-1){ pare[x]=a; depth[x]=depth[a]+1; order.push_back(x); } } } return {order,pare,depth}; } std::vector<int> tree_diameter_path(std::vector<std::vector<int>> &G){ int n=G.size(); auto r=(std::get<0>(tree_order_pare_depth(G,0))).at(n-1); std::vector<int> order,pare,depth,ans; tie(order,pare,depth)=tree_order_pare_depth(G,r); int ind=order[n-1]; while(ind!=-2){ ans.push_back(ind); ind=pare[ind]; } return ans; } void solve(); // CYAN / FREDERIC int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t = 1; // cin >> t; rep(i, 0, t) solve(); } void solve(){ int N; cin >> N; auto G = tree_in(N); string S; cin >> S; auto [order, pare, depth] = tree_order_pare_depth(G, 0); rep(i, 1, N){ rep(j, 0, G[i].size()) if (G[i][j] == pare[i]) swap(G[i][j], G[i].back()); G[i].pop_back(); } vector<int> wei(N, 1); rep(i, 0, N){ int a = order[N - i - 1]; if (a) wei[pare[a]] += wei[a]; } rep(i, 0, N) sort(all(G[i]), [&](int l, int r){return wei[l] > wei[r];}); ll ans = 0; auto dfs = [&](auto self, int var) -> binary { binary base; int val = (S[var] == '1' ? -1 : 1); if (G[var].empty()){ // nop } else{ base = self(self, G[var][0]); rep(i, 1, G[var].size()){ binary tmp = self(self, G[var][i]); // merge auto lis = tmp.get_list(); for (auto x : lis){ ans += x.second * base.prod(0, 2 * N - x.first - val); } for (auto x : lis){ base.set(x.first, x.second); } } } base.set(N); base.C += val; ans += base.prod(0, N); //cout << var << " " << nodes[base.root].sum << "\n"; //cout << ans << "\n"; return base; }; auto tr = dfs(dfs, 0); cout << ans << "\n"; }