传送门
题解:
注意到一条边的存在实际上是限制了 ∣ d u − d v ∣ ≤ 1 |d_u-d_v|\leq 1 ∣du−dv∣≤1。我们对这道题,对于最短路为每个值的情况建立一个点,用最小割建图,然后对于 d u ≤ d v + 1 d_u\leq d_v+1 du≤dv+1连一条INF边就行了。
代码:
#include<bits/stdc++.h>
#define ll long long
#define re register
#define cs const
using std::string;
class FoxAndCity{
private:
static cs int N=5e4+7,M=107,INF=0x3f3f3f3f;
int S,T,tot,n,m;
int id[M][M],g[M][M],dis[M];
struct edge{int to,cap,rev;};
typedef std::vector<edge>::iterator iter;
std::vector<edge> G[N];iter cur[N];
inline void adde(int u,int v,int val){
G[u].push_back((edge){v,val,G[v].size()});
G[v].push_back((edge){u,0,G[u].size()-1});
}
int lev[N],gap[N],finish;
inline void BFS(){
memset(lev+1,0,sizeof(int)*tot);
memset(gap+1,0,sizeof(int)*tot);
std::queue<int> q;q.push(T);lev[T]=gap[1]=1;
while(!q.empty()){
int u=q.front();q.pop();cur[u]=G[u].begin();
for(auto e:G[u])if(!lev[e.to]){
lev[e.to]=lev[u]+1;
++gap[lev[e.to]];
q.push(e.to);
}
}
finish=lev[S]==0;
}
int dfs(int u,int flow){
if(u==T)return flow;
int ans=0;
for(iter &e=cur[u];e!=G[u].end();++e)
if(e->cap&&lev[e->to]+1==lev[u]){
int delta=dfs(e->to,std::min(flow-ans,e->cap));
if(delta){
e->cap-=delta;
G[e->to][e->rev].cap+=delta;
if((ans+=delta)==flow)return ans;
}
}
if(!--gap[lev[u]++])finish=true;
++gap[lev[u]];cur[u]=G[u].begin();
return ans;
}
inline int Flow(){
int flow=0;BFS();
while(!finish)flow+=dfs(S,INF);
return flow;
}
inline void get_dis(){
memset(dis,0x3f,sizeof(int)*n);
std::queue<int> q;q.push(0);dis[0]=0;
while(!q.empty()){
int u=q.front();q.pop();
for(int re v=1;v<n;++v)
if(dis[v]>n&&g[u][v]){
dis[v]=dis[u]+1;
q.push(v);
}
}
}
public:
FoxAndCity(){}
int minimalCost(std::vector<string> linked,std::vector<int> want){
n=want.size();
for(int re i=0;i<n;++i)
for(int re j=0;j<n;++j)
g[i][j]=linked[i][j]=='Y';
get_dis();S=1;T=tot=2;
for(int re i=1;i<n;++i)
for(int re j=1;j<=dis[i]+1;++j)id[i][j]=++tot;
for(int re i=1;i<n;++i){
adde(S,id[i][1],INF);
adde(id[i][dis[i]+1],T,INF);
for(int re j=1,t=want[i];j<=dis[i];++j){
adde(id[i][j],id[i][j+1],(t-j)*(t-j));
if(j>1)for(int re k=1;k<n;++k)
if(i!=k&&g[i][k]){
adde(id[i][j],id[k][j-1],INF);
}
}
}
return Flow();
}
};
#ifdef zxyoi
FoxAndCity Solver;
signed main(){
std::cout<<Solver.minimalCost(
{"NYNNNN",
"YNYNNN",
"NYNYYY",
"NNYNYY",
"NNYYNY",
"NNYYYN"},
{0, 1, 2, 4, 0, 4}
)<<"\n";
return 0;
}
#endif