Submission #1451119

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <bitset>
#include <vector>
#include <queue>

using namespace std;

typedef long long ll;
#define FOR(i,a,b)   for(ll i = (a); i < (b); i++ )
#define REP(i, n)    FOR(i,0,n)
typedef pair< ll, ll >   cp2;
typedef pair< ll, cp2 >   cp3;
#define fi first
#define se second
#define sec  se.fi
#define thr  se.se
const ll mod = 1000000007;
//              123456789

 
///////////////////////////////////////////////
//ダイクスト①
//O(n^2)
///////////////////////////////////////////////

////////////////////////////////////////////////
////////////////////////////////////////////////

#define V_MAX   1010
#define E_MAX   V_MAX(V_MAX-1)/2

int N, M;
int A, B, C;
int s, g;
int p[V_MAX][V_MAX];
int d[V_MAX];
bool flag[V_MAX];
int MIN;
int idx;

void dijkstra( int S ){
	fill( flag, flag+V_MAX, 1 );
	fill( d, d+V_MAX, -1 );
	d[S] = 0;
	REP( i, N ){
		MIN = mod;
		FOR( j, 1, N+1 ){
			if( 0 <= d[j] && d[j] < MIN && flag[j] ){
				MIN = d[j];
				idx = j;
			}
		}
		flag[idx] = 0;
		FOR( j, 1, N+1 ){
			if( p[idx][j] < 0 || !flag[j] ) continue;
			if( d[j] < 0 ) d[j] = d[idx]+p[idx][j];
			d[j] = min( d[j], d[idx]+p[idx][j] );
		}
	}
}

int ans = 0;

int main(){
	
	cin>>N>>M;
	//cin>>s>>g;
	
	fill( p[0], p[V_MAX], -1 );
	
	REP( i, M ){
		scanf("%d %d %d", &A, &B, &C);
		p[A][B] = C;
		p[B][A] = C;
	}
	
	FOR( a, 1, N+1 ){
		dijkstra( a );
		FOR( b, a+1, N+1 ){
			if( p[a][b] != d[b] && p[a][b] >= 0 ) ans++;
		}
	}
	
	cout<<ans<<endl;
	
	return 0;
	
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:77:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &A, &B, &C);
                                ^

Judge Result