제출 #737161

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
737161		shadow_sami	도로 폐쇄 (APIO21_roads)	C++17	24 / 100	319 ms	6552 KiB

roads

#include<bits/stdc++.h>
#include "roads.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 2e3+5;
const ll mod = 1e9+7;

// // ==========================(MOD)=============================================================================================== //

// ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
// ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
// ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
// ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
// ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// // ==========================(MOD)=============================================================================================== //

bool f = false;
vector<pi> adj[mx];
ll dp[mx][2];

void dfs(ll u,ll par,ll degree){
	dp[u][0] = dp[u][1] = 1e18;
	ll sm = 0;
	vi v;
	fx(adj[u]){
		if(x.ff!=par){
			dfs(x.ff,u,degree);
			sm += dp[x.ff][1];
			v.push_back(dp[x.ff][0] + x.ss - dp[x.ff][1]);
		}
	}
	ll pt = (long long)v.size();
	srt(v);
	fip(0,2){
		if(pt + i <= degree)
			dp[u][i] = min(dp[u][i],sm);
	}
	fx(v){
		sm += x;
		pt--;
		fip(0,2){
			if(pt + i <= degree)
				dp[u][i] = min(dp[u][i],sm);
		}
	}
	return ;
}

vi minimum_closure_costs(int N,vector<int> u,vector<int> v,vector<int> w){
	n = N;
	fip(0,n-1){
		adj[u[i]].push_back({v[i],w[i]});
		adj[v[i]].push_back({u[i],w[i]});
		// sum += w[i];
	}
	vi na(n,0);
	fip(0,n){
		// fjp(0,n)
		// 	require[j] = adj[i].size()<=i ? 0 : 1;
		// cerr<<i<<" tt"<<nli;;		
		dfs(0,-1,i);
		na[i] = dp[0][0];
	}
	return na;
}

// int main(){
//     ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//     #ifndef ONLINE_JUDGE
//         freopen("input1.txt", "r", stdin);
//         freopen("output1.txt", "w", stdout);
//         freopen("error1.txt", "w", stderr);
//     #endif // ONLINE_JUDGE

//         cin>>n;
//         vector<int> u(n-1),v(n-1),w(n-1);
//         fip(0,n-1)
//         	cin>>u[i]>>v[i]>>w[i];
//         vi nas = minimum_closure_costs(n,u,v,w);
//         fx(nas)
//         	cout<<x<<" ";
//         cout<<nli;
        
//     cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
//     return 0;
// }

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