codefoces 449B Jzzhu and Cities（最短路）

题解：

题目给出m条双向边，k条从节点1出发的有向边，问在不影响最短路的情况下，这k条从1出发的边最多能去掉几个。
其实转换过来的意思就是在图中跑最短路找关键路径。其做法就是在每次松弛的时候判断边是否为k条边中的一条，若是则把这个结点打上true标记，若不是则打上false标记。

代码：

#include <map>
#include <set>
#include <ctime>
#include <cmath>
#include <queue>
#include <stack>
#include <ctime>
#include <string>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
//#include <random>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
#define PB push_back
#define MP make_pair
#define INF 1073741824
#define inf 1152921504606846976
#define pi 3.14159265358979323846
//#pragma comment(linker,"/STACK:10240000,10240000")
//mt19937 rand_(time(0));
const int N=3e5+7,M=2e6;
const long long mod=1e9+7;
inline int read(){int ret=0;char ch=getchar();bool f=1;for(;!isdigit(ch);ch=getchar()) f^=!(ch^'-');for(;isdigit(ch);ch=getchar()) ret=(ret<<1)+(ret<<3)+ch-48;return f?ret:-ret;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}//ÄæÔª
ll wei[M];
int head[N],NEXT[M],ver[M],tot;void link(int u,int v,ll w){ver[++tot]=v;NEXT[tot]=head[u];head[u]=tot;wei[tot]=w;}
ll dis[N];
bool vis[N],ans[N];
int n,m,k,tmp;
void dij(){
    for(int i=1;i<=n;i++) {
        dis[i]=inf;
        vis[i]=false;
        ans[i]=false;
    }
    dis[1]=0;
    priority_queue<pair<ll,int> >q;
    q.push(MP(0,1));
    while(!q.empty()){
        int x=q.top().second;
        q.pop();
        if(vis[x]) continue;
        vis[x]=true;
        for(int i=head[x];i;i=NEXT[i]){
            int y=ver[i];
            if(dis[y]>dis[x]+wei[i]){
                if(i>tmp){
                    ans[y]=true;
                }
                else ans[y]=false;
                dis[y]=dis[x]+wei[i];
                q.push(MP(-dis[y],y));
            }
            else if(dis[y]==dis[x]+wei[i]){
                if(i<=tmp) ans[y]=false;
            }
        }
    }
}
int main(){
    //freopen("1.txt","r",stdin);
    //ios::sync_with_stdio(false);
    int u,v;
    ll w;
    scanf("%d%d%d",&n,&m,&k);
    for(int i=1;i<=m;i++){
        scanf("%d%d%lld",&u,&v,&w);
        link(u,v,w);
        link(v,u,w);
    }
    tmp=tot;
    for(int i=1;i<=k;i++){
        scanf("%d%lld",&v,&w);
//        cout<<dis[v]<<endl;
        link(1,v,w);
    }
    dij();
    int res=0;
    for(int i=2;i<=n;i++){
        if(ans[i]) res++;
    }
    printf("%d\n",k-res);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}