Submission #832003

#	Time	Username	Problem	Language	Result	Execution time	Memory
832003		Antekb	Road Closures (APIO21_roads)	C++17	31 / 100	2067 ms	36156 KiB

roads

#include<bits/stdc++.h>
#include "roads.h"
#define st first
#define nd second
#define pb push_back
#define pp pop_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii > vii;

void debug(){cerr<<"\n";}
template <typename H, typename... T>
void debug(H h, T... t) {cerr<<h; if (sizeof...(t)) cerr << ", "; debug(t...);}
#define deb(x...) cerr<<#x<<" = ";debug(x);

const int N=1e5+5;
vii E[N];
vector<ll> dp[N][2];

void dfs(int v, int p){
	dp[v][0].resize(E[v].size()+1+(p==-1));
	for(pii e:E[v]){
		int u=e.st, c=e.nd;
		if(u!=p){
			dfs(u, v);
			dp[v][0].resize(max(dp[v][0].size(), dp[u][0].size()));
		}
	}
	dp[v][1]=dp[v][0];
	for(int i=1; i<dp[v][0].size(); i++){
		vector<int> V;
		for(pii e:E[v]){
			int u=e.st, c=e.nd;
			if(u!=p){
				if(i<dp[u][0].size()){
					dp[v][0][i]+=dp[u][1][i];
					V.pb(dp[u][0][i]+c-dp[u][1][i]);
				}
				else{
					dp[v][0][i]+=dp[u][0].back();
					V.pb(c);
				}
			}
		}
		sort(all(V));
		for(int j=V.size()-1; j>=int(V.size())-i+1 && j>=0 && V[j]>0; j--){
			dp[v][0][i]+=V[j];
		}
		dp[v][1][i]=dp[v][0][i];
		if(V.size()>=i && V.end()[-i]>0)dp[v][1][i]+=V.end()[-i];
	}
	//deb(v, dp[v][0], dp[v][1], dp[v][2]);
}

std::vector<long long> minimum_closure_costs(int n, std::vector<int> uu, 
	std::vector<int> vv,std::vector<int> ww) {
	ll sum=0;
	for(int i=0; i<n-1; i++){
		E[uu[i]].eb(vv[i], ww[i]);
		E[vv[i]].eb(uu[i], ww[i]);
		sum+=ww[i];
	}
	dfs(0, -1);
	vector<ll> ans=dp[0][1];
	ans.resize(n, ans.back());
	for(ll &i:ans){
		i=sum-i;
	}
	return ans;
}

Compilation message (stderr)

roads.cpp: In function 'void dfs(int, int)':
roads.cpp:29:15: warning: unused variable 'c' [-Wunused-variable]
   29 |   int u=e.st, c=e.nd;
      |               ^
roads.cpp:36:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |  for(int i=1; i<dp[v][0].size(); i++){
      |               ~^~~~~~~~~~~~~~~~
roads.cpp:41:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |     if(i<dp[u][0].size()){
      |        ~^~~~~~~~~~~~~~~~
roads.cpp:56:14: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   56 |   if(V.size()>=i && V.end()[-i]>0)dp[v][1][i]+=V.end()[-i];
      |      ~~~~~~~~^~~

• Subtask 1: 0 / 5
• Subtask 2: 7 / 7
• Subtask 3: 14 / 14
• Subtask 4: 10 / 10
• Subtask 5: 0 / 17
• Subtask 6: 0 / 25
• Subtask 7: 0 / 22