Pagini recente » Cod sursa (job #2919043) | Cod sursa (job #208456) | Cod sursa (job #2901016) | Cod sursa (job #2424420) | Cod sursa (job #2500132)
#include <bits/stdc++.h>
#define NMAX 50005
#define cin fin
#define cout fout
class InParser {
private:
FILE *fin;
char *buff;
int sp;
char read_ch() {
++sp;
if (sp == 4096) {
sp = 0;
fread(buff, 1, 4096, fin);
}
return buff[sp];
}
public:
InParser(const char* nume) {
fin = fopen(nume, "r");
buff = new char[4096]();
sp = 4095;
}
InParser& operator >> (int &n) {
char c;
while (!isdigit(c = read_ch()) && c != '-');
int sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
} else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
InParser& operator >> (long long &n) {
char c;
n = 0;
while (!isdigit(c = read_ch()) && c != '-');
long long sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
} else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
};
class OutParser {
private:
FILE *fout;
char *buff;
int sp;
void write_ch(char ch) {
if (sp == 50000) {
fwrite(buff, 1, 50000, fout);
sp = 0;
buff[sp++] = ch;
} else {
buff[sp++] = ch;
}
}
public:
OutParser(const char* name) {
fout = fopen(name, "w");
buff = new char[50000]();
sp = 0;
}
~OutParser() {
fwrite(buff, 1, sp, fout);
fclose(fout);
}
OutParser& operator << (int vu32) {
if (vu32 <= 9) {
write_ch(vu32 + '0');
} else {
(*this) << (vu32 / 10);
write_ch(vu32 % 10 + '0');
}
return *this;
}
OutParser& operator << (long long vu64) {
if (vu64 <= 9) {
write_ch(vu64 + '0');
} else {
(*this) << (vu64 / 10);
write_ch(vu64 % 10 + '0');
}
return *this;
}
OutParser& operator << (char ch) {
write_ch(ch);
return *this;
}
OutParser& operator << (const char *ch) {
while (*ch) {
write_ch(*ch);
++ch;
}
return *this;
}
};
using namespace std;
InParser fin("dijkstra.in");
OutParser fout("dijkstra.out");
int n, m, p;
int x, y, cost;
int d[NMAX];
vector< pair<int, int> > a[NMAX]; //nod, cost
queue< int > coada;
void read();
void BFS();
int main()
{
read();
coada.push(p);
BFS();
for(int i=2; i<=n; ++i)
{
cout<<d[i]<<' ';
}
return 0;
}
void BFS()
{
while(!coada.empty())
{
int first=coada.front();
coada.pop();
for(int i=0; i<a[first].size(); ++i)
{
int nod=a[first][i].first;
int c=a[first][i].second;
if(d[nod]>d[first]+c || d[nod]==0)
{
d[nod]=d[first]+c;
coada.push(nod);
}
}
}
}
void read()
{
cin>>n>>m;
for(int i=1; i<=m; ++i)
{
cin>>x>>y>>cost;
a[x].push_back({y, cost});
}
p=1;
}