1022
#include <vector> #include <list> #include <map> #include <set> #include <deque> #include <queue> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <ctime> #include <math.h> #include <limits.h> #include <hash_map> using namespace std; // Datatypes typedef vector<int> vi; typedef vector<string> vs; typedef vector<vi> vvi; typedef pair<int,int> ii; typedef long long ll; typedef long double ld; // Define #define sz(a) int((a).size()) #define pb push_back #define all(c) (c).begin(),(c).end() #define present(c,x) ((c).find(x) != (c).end()) #define cpresent(c,x) (find(all(c),x) != (c).end()) #define FOR(_i,_n) for(int (_i) = 0; (_i) < (_n); (_i)++) #define mp make_pair // Constants const double eps = 1e-8; const double PI = 3.1415926535897932384626433832795; #define INPUT_FILE "xo.in" #define OUTPUT_FILE "xo.out" #define WHITE 0 #define GREY 1 #define BLACK 2 vector< vector<int> > g; vector< int > color; vector< int > vlist; int num; void dfs(int v) { color[v] = GREY; for(int i = 0; i < sz(g[v]); i++) { if(color[g[v][i]] == WHITE) { dfs(g[v][i]); } else if(color[g[v][i]] == GREY){ // есть циклы } } vlist[num] = v; num--; color[v] = BLACK; } int main(void) { #ifdef ALEX freopen("input.in", "r", stdin); freopen("output.out", "w", stdout); #else //freopen(INPUT_FILE, "r", stdin); //freopen(OUTPUT_FILE, "w", stdout); #endif int N; cin >> N; g.resize(N); color.resize(N); vlist.resize(N); num = N-1; for(int i = 0; i < N; i++) { int t; cin >> t; while(t != 0) { g[i].pb(t-1); cin >> t; } } for(int i = 0; i < N; i++) { if(color[i] == WHITE) dfs(i); } for(int i = 0; i < N; i++) { cout << vlist[i] + 1 << " "; } return 0; }
page revision: 0, last edited: 13 Sep 2007 11:25