Cod sursa(job #1729307)
| Utilizator | Data | 14 iulie 2016 16:04:38 | |
|---|---|---|---|
| Problema | Algoritmul lui Dijkstra | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <queue>
#include <cstdio>
#include <bitset>
#define NMax 50005
using namespace std;
priority_queue < pair < int, int > Q;
vector < pair <int, int > G[NMax];
int N,M;
void citire()
{
printf("%d%d", &N, &M);
int x,y,c;
for(i=1; i<=M; i++)
{
printf("%d%d", &x, &y, &c+);
G[x].push_back(make_pair(c,y));
}
}
int main()
{
citire();
return 0;
}
/*
roy floyd
rfinv
rf*/
