Submission #710159

#TimeUsernameProblemLanguageResultExecution timeMemory
710159victor_gaoDesignated Cities (JOI19_designated_cities)C++17
0 / 100
2080 ms122596 KiB
//#pragma GCC optimize("Ofast,unroll-loops,O3") //#pragma GCC optimize("avx,avx2,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,fma,tune=native") #include<bits/stdc++.h> //#include<bits/extc++.h> //#pragma pack(1) #define fast ios::sync_with_stdio(0); cin.tie(0); #define int long long #define pii pair<int,int> #define x first #define y second #define N 200015 using namespace std; //using namespace __gnu_pbds; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); //typedef tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> order_multiset; //typedef tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> order_set; int n,dp[N],fa[N],ans[N],mx[N],pos[N],total=0,s,t; vector<int>g[N],leaf; multiset<pii>st[N]; map<pii,int>cost; void count_max(int p){ if (!st[p].empty()){ pii big=*(--st[p].end()); mx[p]=big.x; pos[p]=big.y; } else mx[p]=0,pos[p]=p; } void Insert(int p,int i,int val){ int cs=mx[i]+val; st[p].insert({cs,pos[i]}); count_max(p); } void Erase(int p,int i,int val){ int cs=mx[i]+val; st[p].erase(st[p].find({cs,pos[i]})); count_max(p); } void dfs1(int p,int lp){ if (g[p].size()==1){ leaf.push_back(p); pos[p]=p; } for (auto i:g[p]){ if (i!=lp){ dfs1(i,p); dp[p]=dp[p]+dp[i]+cost[{i,p}]; Insert(p,i,cost[{p,i}]); } } } void dfs2(int p,int lp){ dp[p]=(dp[p]+dp[lp]+cost[{lp,p}]); Insert(p,lp,cost[{p,lp}]); ans[1]=min(ans[1],total-dp[p]); if (ans[2]>total-dp[p]-mx[p]){ ans[2]=total-dp[p]-mx[p]; s=p; t=pos[p]; } for (auto i:g[p]){ if (i!=lp){ Erase(p,i,cost[{p,i}]); dp[p]=dp[p]-dp[i]-cost[{i,p}]; dfs2(i,p); dp[p]=dp[p]+dp[i]+cost[{i,p}]; Insert(p,i,cost[{p,i}]); } } Erase(p,lp,cost[{p,lp}]); dp[p]=(dp[p]-dp[lp]-cost[{lp,p}]); } signed main(){ fast cin>>n; for (int i=0;i<=n;i++){ ans[i]=1e18; cost[{0,i}]=0; cost[{i,0}]=0; } for (int i=1;i<n;i++){ int a,b,c,d; cin>>a>>b>>c>>d; total=(total+c+d); g[a].push_back(b); g[b].push_back(a); cost[{a,b}]=c; cost[{b,a}]=d; } dfs1(1,0); dfs2(1,0); int q; cin>>q; while (q--){ int c; cin>>c; cout<<ans[c]<<'\n'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...