Mai intai trebuie sa te autentifici.
Cod sursa(job #2130038)
| Utilizator | Data | 13 februarie 2018 13:20:05 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.89 kb |
#include <fstream>
#include <vector>
#define NMAX 50005
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n, m, nr;
vector <int> V[NMAX];
vector <int> niv(NMAX);
vector <int> gi(NMAX);
void citire()
{
int x, y;
fin >> n >> m;
for (int i = 1; i <= m; i++)
{
fin >> x >> y;
V[x].push_back(y);
gi[y]++;
}
}
void program()
{
int i, j, NR;
while (nr < n)
{
NR = 0;
for (i = 1; i <= n; i++)
if (gi[i]==0)
niv[++NR] = i;
for (i = 1; i <= NR; i++)
{
fout << niv[i] << ' ';
gi[niv[i]] = -1;
nr++;
for (j = 0; j < V[niv[i]].size(); j++)
gi[V[niv[i]][j]]--;
}
}
}
int main()
{
citire();
program();
return 0;
}
