POJ 3687 Labeling Balls

题目链接：https://vjudge.net/problem/POJ-3687

题目大意

　　有 N 个重量互不相同的球，标记为 1 ~ N，现给定 M 个重量约束条件，将 1 ~ N 单位的重量分配给每个球，如果能成功分配，输出重量序列（字典序尽量小），不能则输出 -1。

分析

　　一种错误的想法是先建立拓扑图，然后拓扑排序，每次取序号最小的节点从小到大分配重量，但这是不对的，这里举个反例：5 4 · 5 1 4 2 1 3 2 3。

　　正解是建立逆向拓扑图，然后拓扑排序，每次取序号最大的节点从大到小分配重量。因为这样分配一旦分配好节点就可以扔掉，转化为子问题，而子问题并不会对已扔掉的节点产生影响。

代码如下

#include <cmath>
#include <ctime>
#include <iostream>
#include <string>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <cctype>
#include <stack>
#include <deque>
#include <list>
#include <sstream>
#include <cassert>
using namespace std;
 
#define INIT() ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define Rep(i,n) for (int i = 0; i < (n); ++i)
#define For(i,s,t) for (int i = (s); i <= (t); ++i)
#define rFor(i,t,s) for (int i = (t); i >= (s); --i)
#define ForLL(i, s, t) for (LL i = LL(s); i <= LL(t); ++i)
#define rForLL(i, t, s) for (LL i = LL(t); i >= LL(s); --i)
#define foreach(i,c) for (__typeof(c.begin()) i = c.begin(); i != c.end(); ++i)
#define rforeach(i,c) for (__typeof(c.rbegin()) i = c.rbegin(); i != c.rend(); ++i)
 
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
 
#define LOWBIT(x) ((x)&(-x))
 
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())
#define UNIQUE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define REMOVE(x, c) x.erase(remove(x.begin(), x.end(), c), x.end()); // 删去 x 中所有 c 
#define TOLOWER(x) transform(x.begin(), x.end(), x.begin(),::tolower);
#define TOUPPER(x) transform(x.begin(), x.end(), x.begin(),::toupper);
 
#define ms0(a) memset(a,0,sizeof(a))
#define msI(a) memset(a,0x3f,sizeof(a))
#define msM(a) memset(a,-1,sizeof(a))

#define MP make_pair
#define PB push_back
#define ft first
#define sd second
 
template<typename T1, typename T2>
istream &operator>>(istream &in, pair<T1, T2> &p) {
    in >> p.first >> p.second;
    return in;
}
 
template<typename T>
istream &operator>>(istream &in, vector<T> &v) {
    for (auto &x: v)
        in >> x;
    return in;
}
 
template<typename T1, typename T2>
ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) {
    out << "[" << p.first << ", " << p.second << "]" << "
";
    return out;
}

inline int gc(){
    static const int BUF = 1e7;
    static char buf[BUF], *bg = buf + BUF, *ed = bg;
    
    if(bg == ed) fread(bg = buf, 1, BUF, stdin);
    return *bg++;
} 

inline int ri(){
    int x = 0, f = 1, c = gc();
    for(; c<48||c>57; f = c=='-'?-1:f, c=gc());
    for(; c>47&&c<58; x = x*10 + c - 48, c=gc());
    return x*f;
}

template<class T>
inline string toString(T x) {
    ostringstream sout;
    sout << x;
    return sout.str();
}

inline int toInt(string s) {
    int v;
    istringstream sin(s);
    sin >> v;
    return v;
}

//min <= aim <= max
template<typename T>
inline bool BETWEEN(const T aim, const T min, const T max) {
    return min <= aim && aim <= max;
}
 
typedef long long LL;
typedef unsigned long long uLL;
typedef pair< double, double > PDD;
typedef pair< int, int > PII;
typedef pair< int, PII > PIPII;
typedef pair< string, int > PSI;
typedef pair< int, PSI > PIPSI;
typedef set< int > SI;
typedef set< PII > SPII;
typedef vector< int > VI;
typedef vector< char > VC;
typedef vector< double > VD;
typedef vector< VI > VVI;
typedef vector< SI > VSI;
typedef vector< PII > VPII;
typedef map< int, int > MII;
typedef map< LL, int > MLLI;
typedef map< int, string > MIS;
typedef map< int, PII > MIPII;
typedef map< PII, int > MPIII;
typedef map< string, int > MSI;
typedef map< char, int > MCI;
typedef map< string, string > MSS;
typedef map< PII, string > MPIIS;
typedef map< PII, PII > MPIIPII;
typedef multimap< int, int > MMII;
typedef multimap< string, int > MMSI;
//typedef unordered_map< int, int > uMII;
typedef pair< LL, LL > PLL;
typedef vector< LL > VL;
typedef vector< VL > VVL;
typedef priority_queue< int > PQIMax;
typedef priority_queue< int, VI, greater< int > > PQIMin;
const double EPS = 1e-8;
const LL inf = 0x3fffffff;
const LL infLL = 0x3fffffffffffffffLL;
const LL mod = 1e9 + 7;
const int maxN = 2e2 + 7;
const LL ONE = 1;
const LL evenBits = 0xaaaaaaaaaaaaaaaa;
const LL oddBits = 0x5555555555555555;

struct Edge{
    int from, to;
};

istream& operator>> (istream& in, Edge &x) {
    in >> x.from >> x.to;
    return in;
}

struct Vertex{
    int in;
    VI next;
    
    void clear() {
        in = 0;
        next.clear();
    }
};

int N, M, T;
Vertex V[maxN];
vector< Edge > E;
int topo[maxN], cnt; // 存拓扑序列 

void addEdge(Edge &x) {
    V[x.from].next.PB(E.size());
    ++V[x.to].in;
    E.PB(x);
}

bool TopoSort() {
    PQIMax Q;
    
    For(i, 1, N) if(!V[i].in) Q.push(i);
    
    while(!Q.empty()) {
        int tmp = Q.top(); Q.pop();
        
        topo[tmp] = cnt--;
        Rep(i, V[tmp].next.size()) {
            Edge &e = E[V[tmp].next[i]];
            if(!--V[e.to].in) Q.push(e.to);
        }
    }
    return cnt == 0;
}

void init() {
    For(i, 1, N) V[i].clear();
    E.clear();
    cnt = N;
}

int main(){
    //freopen("MyOutput.txt","w",stdout);
    //freopen("input.txt","r",stdin);
    INIT();
    cin >> T;
    while(T--) {
        cin >> N >> M;
        init();
        
        For(i, 1, M) {
            Edge t;
            cin >> t.to >> t.from; // 存反向拓扑图 
            addEdge(t);
        }
        
        if(TopoSort()) For(i, 1, N) cout << topo[i] << " 
"[i == N];
        else cout << "-1
";
    }
    return 0;
}