loj#2838 「JOISC 2018 Day 3」比太郎的聚会

分析

预处理每个点的前根号小的距离

对于每次询问删除点小于根号则已经处理好

否则直接暴力dp即可

代码

#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
const int b= ;
int n,m,Q,dp[],vis[];
priority_queue<pair<int,int> >q[];
pair<int,int>d[][b+];
vector<int>v[];
int main(){
    int i,j,k;
    scanf("%d%d%d",&n,&m,&Q);
    for(i=;i<=m;i++){
      int x,y;
      scanf("%d%d",&x,&y);
      v[x].push_back(y);
    }
    for(i=;i<=n;i++){
      for(j=;j<=b;j++)d[i][j]=mp(-,);
      q[i].push(mp(,i));
      for(j=;j<=b;j++){
          while(!q[i].empty()&&vis[q[i].top().se]==i)q[i].pop();
          if(q[i].empty())break;
          d[i][j]=q[i].top();vis[q[i].top().se]=i;q[i].pop();
      }
      for(j=;j<v[i].size();j++)
        for(k=;k<=b&&d[i][k].se;k++)
          q[v[i][j]].push(mp(d[i][k].fi+,d[i][k].se));
    }
    memset(vis,,sizeof(vis));
    for(int _=;_<=Q;_++){
      int x,y,z;
      scanf("%d%d",&x,&y);
      for(i=;i<=y;i++)scanf("%d",&z),vis[z]=_;
      if(y<b){
          for(i=;i<=b;i++)
          if(vis[d[x][i].se]!=_){
              printf("%d\n",d[x][i].fi);
            break;
          }
      }else {
          memset(dp,-,sizeof(dp));
          for(i=;i<=n;i++){
              if(vis[i]!=_)dp[i]=max(dp[i],);
              if(dp[i]>=)for(j=;j<v[i].size();j++)
                dp[v[i][j]]=max(dp[v[i][j]],dp[i]+);
          }
          printf("%d\n",dp[x]);
      }
    }
    return ;
}