Submission #2241786

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n)  RFOR(i,0,n)
#define VSORT(v) sort(v.begin(), v.end())
#define DVSORT(v) sort(v.begin(), v.end(),greater<int>())
#define SORT(v, n) sort(v, v+n)
#define DSORT(v,n) sort(v, v+n,greater<int>())
#define vi vector<int>
#define pb push_back
 
template <class T> void chmin(T&a,const T&b) { a = min(a,b); }
template <class T> void chmax(T&a,const T&b) { a = max(a,b); }
 
void print(){cout<<endl;}
template <class Head, class... Tail>
void print(Head&& h,Tail&&... t){ 
	if(sizeof...(t)==0)
		cout<<h;
	else
		cout<<h<<' ';
	print(move(t)...);
}
 
const double EPS =1e-9;
const long INF =2147483647;//32bit 2*1e+9
const long MOD =1e+9+7;
#define PI 3.14159265258979
#define P pair<int,int>
#define PPi pair<P,int>
 
int dy[]={0, 0, 1, -1, 1, 1, -1, -1};
int dx[]={1, -1, 0, 0, 1, -1, -1, 1};
const int MAX_V = 100;
const int MAX_E = 1000;

struct edge{ int from,to,cost,No;};
int V,E;
vector<edge> G[MAX_V];
int d[MAX_V];
int pd[MAX_V];

int used[MAX_E];

#define T tuple<int,int,int>

void dijkstra(int s){
	priority_queue<T,vector<T>,greater<T>> que;
	fill(d,d+V,INF);
	fill(pd,pd+V,-1);

	d[s]=0;
	que.push(T(0,s,-1));

	while(!que.empty()){
		T p=que.top();
		que.pop();

		int v=get<1>(p);
		if(d[v]<(get<0>(p))) continue;

		if(get<2>(p)!=-1) used[get<2>(p)]=1;

		REP(i,(int)G[v].size()){
			edge e=G[v][i];
			if(d[e.to]>d[v]+e.cost){
				d[e.to]=d[v]+e.cost;
				pd[e.to]=v;
				que.push(T(d[e.to],e.to,e.No));
			}
		}
	}
}

vector<int> get_path(int t){
	vector<int> path;
	for(;t!=-1;t=pd[t]) path.pb(t);
	reverse(path.begin(),path.end());
	return path;
}


int main(void){
	cin.tie(0);
	ios_base::sync_with_stdio(false);

	fill(used,used+1000,0);
	cin>>V>>E;

	edge e;
	REP(i,E){
		cin>>e.from>>e.to>>e.cost;
		e.from--; e.to--; e.No=i;
		G[e.from].pb(e);
		//有向グラフの場合不要
		swap(e.from,e.to);
		G[e.from].pb(e);
	}
	dijkstra(0);
	
	int result=0;
	REP(i,E) if(used[i]==0) result++;
	print(result);
	return 0;
}

Submission Info

Judge Result