結果
問題 | No.2634 Tree Distance 3 |
ユーザー | 沙耶花 |
提出日時 | 2024-02-16 22:51:03 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,917 ms / 3,000 ms |
コード長 | 2,177 bytes |
コンパイル時間 | 4,786 ms |
コンパイル使用メモリ | 278,540 KB |
実行使用メモリ | 117,476 KB |
最終ジャッジ日時 | 2024-02-16 22:52:42 |
合計ジャッジ時間 | 95,404 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,751 ms
102,844 KB |
testcase_01 | AC | 1,758 ms
102,844 KB |
testcase_02 | AC | 1,712 ms
102,844 KB |
testcase_03 | AC | 1,692 ms
102,844 KB |
testcase_04 | AC | 1,716 ms
102,844 KB |
testcase_05 | AC | 1,716 ms
102,844 KB |
testcase_06 | AC | 1,692 ms
102,844 KB |
testcase_07 | AC | 1,684 ms
102,844 KB |
testcase_08 | AC | 1,466 ms
104,160 KB |
testcase_09 | AC | 1,469 ms
104,268 KB |
testcase_10 | AC | 1,486 ms
104,228 KB |
testcase_11 | AC | 1,491 ms
104,100 KB |
testcase_12 | AC | 1,475 ms
104,120 KB |
testcase_13 | AC | 1,481 ms
104,316 KB |
testcase_14 | AC | 1,538 ms
104,044 KB |
testcase_15 | AC | 1,486 ms
104,204 KB |
testcase_16 | AC | 1,503 ms
105,496 KB |
testcase_17 | AC | 811 ms
58,992 KB |
testcase_18 | AC | 1,066 ms
65,756 KB |
testcase_19 | AC | 1,217 ms
99,672 KB |
testcase_20 | AC | 348 ms
32,376 KB |
testcase_21 | AC | 1,911 ms
112,484 KB |
testcase_22 | AC | 1,888 ms
115,980 KB |
testcase_23 | AC | 1,917 ms
117,476 KB |
testcase_24 | AC | 1,885 ms
107,816 KB |
testcase_25 | AC | 1,878 ms
105,968 KB |
testcase_26 | AC | 1,812 ms
108,432 KB |
testcase_27 | AC | 1,879 ms
105,928 KB |
testcase_28 | AC | 1,853 ms
107,568 KB |
testcase_29 | AC | 1,862 ms
106,592 KB |
testcase_30 | AC | 1,766 ms
102,548 KB |
testcase_31 | AC | 1,801 ms
102,596 KB |
testcase_32 | AC | 1,737 ms
102,604 KB |
testcase_33 | AC | 1,119 ms
88,896 KB |
testcase_34 | AC | 190 ms
17,424 KB |
testcase_35 | AC | 627 ms
50,060 KB |
testcase_36 | AC | 328 ms
28,504 KB |
testcase_37 | AC | 681 ms
53,408 KB |
testcase_38 | AC | 8 ms
6,676 KB |
testcase_39 | AC | 9 ms
6,676 KB |
testcase_40 | AC | 6 ms
6,676 KB |
testcase_41 | AC | 6 ms
6,676 KB |
testcase_42 | AC | 6 ms
6,676 KB |
testcase_43 | AC | 471 ms
44,952 KB |
testcase_44 | AC | 290 ms
26,956 KB |
testcase_45 | AC | 1,395 ms
95,168 KB |
testcase_46 | AC | 835 ms
56,356 KB |
testcase_47 | AC | 1,583 ms
99,900 KB |
testcase_48 | AC | 1,736 ms
102,592 KB |
testcase_49 | AC | 1,684 ms
102,584 KB |
testcase_50 | AC | 1,680 ms
102,568 KB |
testcase_51 | AC | 1,714 ms
102,564 KB |
testcase_52 | AC | 1,705 ms
102,588 KB |
testcase_53 | AC | 6 ms
6,676 KB |
testcase_54 | AC | 6 ms
6,676 KB |
testcase_55 | AC | 6 ms
6,676 KB |
testcase_56 | AC | 6 ms
6,676 KB |
testcase_57 | AC | 6 ms
6,676 KB |
testcase_58 | AC | 2 ms
6,676 KB |
testcase_59 | AC | 2 ms
6,676 KB |
testcase_60 | AC | 1,718 ms
102,844 KB |
testcase_61 | AC | 1,724 ms
102,844 KB |
testcase_62 | AC | 1,748 ms
102,844 KB |
testcase_63 | AC | 1,405 ms
102,332 KB |
testcase_64 | AC | 866 ms
61,056 KB |
testcase_65 | AC | 1,282 ms
100,304 KB |
testcase_66 | AC | 335 ms
30,460 KB |
testcase_67 | AC | 262 ms
28,052 KB |
testcase_68 | AC | 1,468 ms
103,964 KB |
testcase_69 | AC | 1,476 ms
103,964 KB |
testcase_70 | AC | 1,540 ms
103,964 KB |
ソースコード
#include <stdio.h> #include <bits/stdc++.h> #include <atcoder/all> using namespace atcoder; using mint = modint998244353; using namespace std; #define rep(i,n) for (int i = 0; i < (n); ++i) #define Inf32 1000000001 #define Inf64 1000000000000000001 vector<int> vs; vector<vector<int>> pos; long long d[300005]; void dfs(int cv,int pv,vector<vector<int>> &E){ if(pv==-1)d[cv] = 0; else d[cv] = d[pv] + 1; pos[cv].push_back(vs.size()); vs.push_back(cv); rep(i,E[cv].size()){ int to = E[cv][i]; if(to==pv)continue; dfs(to,cv,E); pos[cv].push_back(vs.size()); vs.push_back(cv); } } using A = array<long long,6>; A e(){ A c; rep(i,6)c[i] = -Inf64; return c; } A op(A a,A b){ A c = e(); rep(i,6){ c[i] = max({c[i],a[i],b[i]}); } c[3] = max(c[3],a[0]+b[1]); c[4] = max(c[4],a[1]+b[2]); c[5] = max({c[5],a[0]+b[4],a[3]+b[2]}); return c; } int main(){ int n; cin>>n; vector<int> a(n); rep(i,n)scanf("%d",&a[i]); vector<vector<int>> E(n); rep(i,n-1){ int x,y; scanf("%d %d",&x,&y); x--,y--; E[x].push_back(y); E[y].push_back(x); } pos.resize(n); dfs(0,-1,E); vector<long long> ans(n,-Inf64); rep(_,2){ vector<pair<int,int>> t; rep(i,n){ if(_)t.emplace_back(a[i],i); else t.emplace_back(-a[i],i); } sort(t.rbegin(),t.rend()); if(_){ } else{ reverse(t.begin(),t.end()); } segtree<A,op,e> seg;//(vs.size()); { vector<A> tt(vs.size()); rep(i,n){ A temp = e(); temp[1] = -2 * d[i]; rep(j,pos[i].size())tt[pos[i][j]] = temp;//seg.set(pos[i][j],temp); } seg = segtree<A,op,e>(tt); } rep(i,n){ int v = t[i].second; A temp = e(); temp[0] = d[v]; temp[1] = -2*d[v]; temp[2] = d[v]; temp[3] = -d[v]; temp[4] = -d[v]; temp[5] = 0; rep(j,pos[v].size()){ A rr; rr = seg.prod(0,pos[v][j]); ans[v] = max({ans[v],rr[0]+temp[4],rr[3]+temp[2],temp[5]}); rr = seg.prod(pos[v][j]+1,vs.size()); ans[v] = max({ans[v],temp[0]+rr[4],temp[3]+rr[2],temp[5]}); } rep(j,pos[v].size()){ seg.set(pos[v][j],temp); } } } rep(i,n){ if(i!=0)cout<<' '; cout<<ans[i]; } cout<<endl; return 0; }