Skip to content

Commit

Permalink
[auto-verifier] docs commit d42e65d
Browse files Browse the repository at this point in the history
  • Loading branch information
web-flow authored Nov 14, 2024
1 parent cfb0963 commit e802f68
Showing 1 changed file with 3 additions and 3 deletions.
Original file line number Diff line number Diff line change
Expand Up @@ -213,7 +213,7 @@ data:
\ c.resize(2*n-1);\n for(int i=0;i<n;i++){\n cin >> a[i];\n }\n\
\ Graph<void,false> g(2*n-1);\n for(int i=0;i<n-1;i++){\n int u,v;\n\
\ cin >> u >> v >> b[i+n] >> c[i+n];\n g.add_edge(u,i+n);\n \
\ g.add_edge(v,i+n);\n }\n HLD hld(g);\n StaticTopTreeDP<decltype(hld),TreeDP,true>\
\ g.add_edge(v,i+n);\n }\n HLD hld(g);\n StaticTopTreeDP<decltype(hld),TreeDP>\
\ dp(hld);\n while(q--){\n int op;\n cin >> op;\n if(op==0){\n\
\ int u;\n mint x;\n cin >> u >> x;\n \
\ a[u]=x;\n dp.recalc(u);\n }else{\n int e;\n\
Expand Down Expand Up @@ -241,7 +241,7 @@ data:
\ c.resize(2*n-1);\n for(int i=0;i<n;i++){\n cin >> a[i];\n }\n\
\ Graph<void,false> g(2*n-1);\n for(int i=0;i<n-1;i++){\n int u,v;\n\
\ cin >> u >> v >> b[i+n] >> c[i+n];\n g.add_edge(u,i+n);\n \
\ g.add_edge(v,i+n);\n }\n HLD hld(g);\n StaticTopTreeDP<decltype(hld),TreeDP,true>\
\ g.add_edge(v,i+n);\n }\n HLD hld(g);\n StaticTopTreeDP<decltype(hld),TreeDP>\
\ dp(hld);\n while(q--){\n int op;\n cin >> op;\n if(op==0){\n\
\ int u;\n mint x;\n cin >> u >> x;\n \
\ a[u]=x;\n dp.recalc(u);\n }else{\n int e;\n\
Expand All @@ -258,7 +258,7 @@ data:
isVerificationFile: false
path: verify/yosupo/data-structure/point_set_tree_path_composite_sum_fixed_root.cpp
requiredBy: []
timestamp: '2024-11-15 02:28:18+07:00'
timestamp: '2024-11-15 02:29:59+07:00'
verificationStatus: LIBRARY_NO_TESTS
verifiedWith: []
documentation_of: verify/yosupo/data-structure/point_set_tree_path_composite_sum_fixed_root.cpp
Expand Down

0 comments on commit e802f68

Please sign in to comment.