2015-2016 ACM-ICPC, NEERC, Moscow Subregional Contest K

K. King’s Rout
time limit per test4 seconds
memory limit per test512 megabytes
inputstandard input
outputstandard output
The great rout will be held this evening in the palace of his majesty Nassah II, the king of Occorom. There are n guests invited. While they are preparing evening dresses and collecting fresh rumors to talk about, the chief valet of the palace has a tricky task to solve: choose the right order for persons to arrive to the palace.

Guests always arrive one by one, that is, no two guests may arrive at the same moment of time. Due to the court etiquette, there are some limitations on the order of the arrival. For example, a notable landlord should arrive later than all his vassals, but should be earlier than his wives. After reading “Etiquette guide for dummies” the valet found out m order conditions to be satisfied. Each of them has a form: ai must come before bi. Rules are so complicated that some conditions may appear in the list two or more times.

So far the problem seems to be easy and familiar. But some guests (actually, all of them) tried to bribe valet to allow them arrive before others. So valet sorted guests according to their payoffs amounts and decided that guest number 1 should arrive as early as possible (without violating etiquette rules), among all such options valet chooses the one with the guest number 2 arriving as early as possible, and so on. All payoffs were different, so valet has no problem in selecting guests priority.

Help valet to find the best possible schedule. Guests already have numbers in valet’s private list of priority, so you will not know bribes amounts and will not be accused in complicity in corruption.

Input
The first line of the input contains two integers n and m (1 ≤ n ≤ 200 000, 0 ≤ m ≤ 400 000) — the number of guests invited and the number of order conditions respectively.

Next m lines describe the conditions, each of them containing a single pair ai, bi (1 ≤ ai, bi ≤ n). That means the guest ai is required to come earlier than the guest bi.

Output
Print n different integers from 1 to n to describe the best possible order (according to valet’s understanding) for guests to arrive. It is guaranteed that at least one valid order exists.

Examples
input
3 1
3 1
output
3 1 2
input
5 6
2 1
5 2
4 1
5 4
3 1
5 3
output
5 2 3 4 1
Note
In the first sample all the permutations where guest number 1 comes after guest number 3 are acceptable according to etiquette. As the valet wants the guest number 1 to come as early as possible he puts him on the second slot and the guest number 3 on the first slot. There is only one slot remaining for the guest number 2.

题意：已知一个DAG，求拓扑序，要求数字1尽量靠前，然后数字2尽量靠前，然后数字3……

做法：以前做过原题，好像是poj的，但是第一时间，当时也忘了做法，当时也没记录，给自己记过。
关于题目，第一反应是求最小字典序，但是这是错的，第一组样例就过不了。
然后就是倒过来求字典序最大的序列反向输出，这是标算。
为什么对呢，这样看：反过来排，后k个数已确定，这时候第k-1个数大的方案，显然好于第k-1个数小的方案。例如1 2 3 4排，最后一个填了3，而第3个空可以填2或4，这样必然填4。若填了2，结果无非是4 1 2 3或1 4 2 3，而对应地将2和4交换后会得到一个更优的序列2 1 4 3或1 2 4 3（交换的正确性仔细想想便知），然后就是一个类似贪心的过程。
我记得背包里好像也有这种反过来做的题，具体忘了，再说吧。
之前写toposort都是n^2的，现在知道不要优先级的话一个queue就是o（n），本题这样的用到一个priority_queue，是nlogn的。

代码：

// ml:run = $bin < input
#include <bits/stdc++.h>
using namespace std;

int n, m;
int indegree[205000];
bool vis[205000];
vector<int>g[205000];
int ans[205000];

void toposort()
{
    std::priority_queue<int> q;
    for (int i = 1; i <= n; i++)
        if (!indegree[i])
            q.push(i);

    for (int ti = 1; !q.empty(); ti++) {
        int now = q.top(); q.pop();
        ans[ti] = now;
        for (int j = 0; j < (int)g[now].size(); j++) {
            int v = g[now][j];
            indegree[v]--;
            if (!indegree[v]) q.push(v);
        }
    }
}

int main()
{
    scanf("%d%d", &n, &m);
    memset(vis, false, sizeof(vis));
    memset(indegree, 0, sizeof(indegree));
    for(int i=1;i<=n;i++)g[i].clear();
    int x, y;
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d", &x, &y);
        g[y].push_back(x);
        indegree[x]++;
    }
    toposort();
    for(int i=n;i>=1;i--)
    {
        printf("%d%c", ans[i], i==1?'\n':' ');
    }
}