Pagini recente » Cod sursa (job #1996983) | Istoria paginii runda/training_day_10/clasament | Cod sursa (job #579733) | Cod sursa (job #2698744) | Cod sursa (job #376876)
Cod sursa(job #376876)
// sortaret.cpp : Defines the entry point for the console application.
//
/*#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
#define NMAX 50100
int grad[NMAX],viz[NMAX],N,M;
vector<int> g[NMAX];
void rezolvare()
{
for(int i=1;i<=N;i++)
for(int j=1;j<=N;j++)
if(!viz[j] && !grad[j])
{
viz[j]=1;
printf("%d ",j);
for(int k=0;k<g[j].size();k++)
grad[g[j][k]]--;
break;
}
}
void citire()
{
int a,b;
scanf("%d %d",&N,&M);
for(int i=1;i<=N;i++)
{
scanf("%d %d",&a,&b);
g[a].push_back(b);
grad[b]++;
}
}
int main()
{
freopen("sortaret.in","r",stdin);
freopen("sortaret.out","w",stdout);
citire();
rezolvare();
return 0;
}*/
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
#define MAXN 50100
#define pb push_back
int N, M, viz[MAXN], deg[MAXN]; vector<int> G[MAXN];
void solve_and_write(void)
{
int i, j, k;
for(i = 1; i <= N; i++)
{
for(j = 1; j <= N; j++)
if(!viz[j] && deg[j] == 0)
{
viz[j] = 1, printf("%d ", j);
for(k = 0; k < G[j].size(); k++)
deg[ G[j][k] ]--;
break ;
}
}
}
void read_data(void)
{
int i, a, b;
scanf("%d %d\n", &N, &M);
for(i = 1; i <= M; i++)
scanf("%d %d", &a, &b), G[a].pb(b), deg[b]++;
}
int main(void)
{
freopen("sortaret.in", "rt", stdin);
freopen("sortaret.out", "wt", stdout);
read_data();
solve_and_write();
return 0;
}