Created
September 15, 2018 08:31
-
-
Save completejavascript/0aa61f4f21a6c32dd73da0c0321e1794 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
using namespace std; | |
const int MAX_INT = 1 << 20; | |
const int MAX = 105; | |
int N, M, E, T; | |
int Matrix[MAX][MAX]; | |
int Mark[MAX], Value[MAX]; | |
int FindIdMinValue() | |
{ | |
int idm = 0, _min = MAX_INT; | |
for(int i = 1; i <= N; i++) | |
if(Mark[i] == 0 && Value[i] < _min) | |
{ | |
_min = Value[i]; | |
idm = i; | |
} | |
return idm; | |
} | |
void Dijkstra(int start) | |
{ | |
int cnt = 0; | |
for(int i = 1; i <= N; i++) | |
{ | |
Mark[i] = 0; | |
Value[i] = MAX_INT; | |
} | |
Value[start] = 0; | |
while(cnt < N) | |
{ | |
int idmin = FindIdMinValue(); | |
Mark[idmin] = 1; | |
cnt++; | |
for(int i = 1; i <= N; i++) | |
if(Mark[i] == 0 && Matrix[idmin][i] > 0 && | |
Value[idmin] + Matrix[idmin][i] < Value[i]) | |
Value[i] = Value[idmin] + Matrix[idmin][i]; | |
} | |
} | |
int main() | |
{ | |
ios::sync_with_stdio(false); | |
//freopen("input.txt","r",stdin); | |
cin >> N >> E >> T >> M; | |
for(int i = 1; i <= N; i++) | |
for(int j = 1; j <= N; j++) | |
Matrix[i][j] = 0; | |
int a, b, t; | |
for(int i = 0; i < M; i++) | |
{ | |
cin >> a >> b >> t; | |
Matrix[b][a] = t; | |
} | |
// implementing code | |
Dijkstra(E); | |
// Đếm những ô có giá trị <= T | |
// là những ô con chuột có thể thoát. | |
int Answer = 0; | |
for(int i = 1; i <= N; i++) | |
if(Value[i] <= T) Answer++; | |
// output | |
cout << Answer << endl; | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment