Submission #943826

#TimeUsernameProblemLanguageResultExecution timeMemory
943826yeediotDesignated Cities (JOI19_designated_cities)C++14
100 / 100
294 ms51204 KiB
#include<bits/stdc++.h> using namespace std; #define ll long long #define int long long #define F first #define S second #define all(x) x.begin(),x.end() #define pii pair<int,int> #define pb push_back #define sz(x) (int)(x.size()) #define chmin(x,y) x=min(x,y) #define chmax(x,y) x=max(x,y) #define vi vector<int> #define vp vector<pii> #define vvi vector<vi> #define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) #define __lg(x) 63-__builtin_clzll(x) #define pow2(x) (1LL<<x) void __print(int x) {cerr << x;} void __print(float x) {cerr << x;} void __print(double x) {cerr << x;} void __print(long double x) {cerr << x;} void __print(char x) {cerr << '\'' << x << '\'';} void __print(const char *x) {cerr << '\"' << x << '\"';} void __print(const string &x) {cerr << '\"' << x << '\"';} void __print(bool x) {cerr << (x ? "true" : "false");} template<typename T, typename V> void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';} template<typename T> void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";} void _print() {cerr << "]\n";} template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);} #ifdef local void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);} #define debug(x...) cerr << "[" << #x << "] = ["; _print(x) #else void setio(){} #define debug(x...) #endif const int mxn=2e5+5; vector<tuple<int,int,int>>adj[mxn]; ll dp[mxn][2]; pair<ll,int> dp2[mxn]; ll dep[mxn]; int p1; void dfs(int v,int pa){ for(auto [u,d,d2]:adj[v]){ if(u==pa)continue; dp[u][0]+=dp[v][0]+d; dep[u]=dep[v]+d; dfs(u,v); dp[v][1]+=d2+dp[u][1]; } } ll all; ll ans[mxn]; void calc(int v,int pa){ int mx=0; dp2[v].F=dep[v]; dp2[v].S=v; int t1=0; for(auto [u,d,d2]:adj[v]){ if(u==pa)continue; dp[u][1]+=dp[v][1]-dp[u][1]-d2; calc(u,v); if(dp2[v].F+dp2[u].F-2*dep[v]>mx){ t1=dp2[v].S; mx=dp2[v].F+dp2[u].F-2*dep[v]; } dp2[v]=max(dp2[v],dp2[u]); } ans[1]=min(ans[1],all-dp[v][0]-dp[v][1]); if(ans[2]>all-dp[v][0]-dp[v][1]-mx){ p1=t1; ans[2]=all-dp[v][0]-dp[v][1]-mx; } } ll len[mxn]; int idx; int dfs2(int v,int pa){ vector<int>temp; for(auto [u,d,d2]:adj[v]){ if(u==pa)continue; temp.pb(dfs2(u,v)+d); } if(sz(temp)==0)return 0; auto it=max_element(temp.begin(),temp.end()); for(auto it2=temp.begin();it2!=temp.end();it2++){ if(it2==it)continue; len[idx++]=*it2; } return *it; } signed main(){ setio(); ios::sync_with_stdio(0); cin.tie(0);cout.tie(0); int n; cin>>n; ans[2]=1e18; ans[1]=1e18; for(int i=1;i<n;i++){ int a,b,c,d; cin>>a>>b>>c>>d; adj[a].pb({b,c,d}); adj[b].pb({a,d,c}); all+=c+d; } dfs(1,1); calc(1,1); int v=dfs2(p1,p1); len[idx++]=v; sort(len,len+idx,greater<int>()); for(int i=1;i<idx;i++){ ans[2+i]=ans[1+i]-len[i]; } int q; cin>>q; while(q--){ int x; cin>>x; cout<<ans[x]<<'\n'; } } /* input: */

Compilation message (stderr)

designated_cities.cpp: In function 'void dfs(long long int, long long int)':
designated_cities.cpp:49:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   49 |     for(auto [u,d,d2]:adj[v]){
      |              ^
designated_cities.cpp: In function 'void calc(long long int, long long int)':
designated_cities.cpp:64:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   64 |     for(auto [u,d,d2]:adj[v]){
      |              ^
designated_cities.cpp: In function 'long long int dfs2(long long int, long long int)':
designated_cities.cpp:84:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   84 |     for(auto [u,d,d2]:adj[v]){
      |              ^
#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...