#484 F. The Meeting Place Cannot Be Changed

异常暴力的算法.
就是枚举每个点当作答案，然后判断当前点是否可行。。。
不过要按照每个点的度数先来排序。
就这样…
c++代码如下：

#include<bits/stdc++.h>
#define rep(i,x,y) for(register int i = x ; i <= y; ++ i)
#define repd(i,x,y) for(register int i = x ; i >= y; -- i)
using namespace std;
typedef long long ll;
template<typename T>inline void read(T&x)
{
    char c;int sign = 1;x = 0;
    do { c = getchar(); if(c == '-') sign = -1; }while(!isdigit(c));
    do { x = x * 10 + c - '0'; c = getchar(); }while(isdigit(c));
    x *= sign;
}

const int N = 5e5+50;
int n,m;
int head[N],to[N],nxt[N],tot;

inline void add(int x,int y)
{
    to[tot] = y;
    nxt[tot] = head[x];
    head[x] = tot++;
}

int vis[N];
int in[N],id[N];
bool dt[N],k;

const bool cmp(int a,int b) { return in[a] < in[b] ; }
inline double FIND_TIME(){ return clock() / (double)CLOCKS_PER_SEC;}

void dfs(int x)
{
    vis[x] = 1;
    for(register int i = head[x];~i;i=nxt[i])
    {
        if(!vis[to[i]]) dfs(to[i]);
        if(vis[to[i]] == 1) k = 1;
        if(k) return;
    }
    vis[x] = 2;
}

inline bool check(int x)
{
    memset(vis,0,sizeof vis);
    vis[x] = 2; k = 0;
    rep(i,1,n)
        if(!vis[i]){
            dfs(i);
            if(k)
            {
                rep(i,1,n)
                    if(vis[i] != 1)
                        dt[i] = 1;
                return false;
            }
    }
    return true;
}

int main()
{
    memset(head,-1,sizeof head);
    read(n); read(m);
    rep(i,1,m)
    {
        int u,v;
        read(u); read(v);
        add(u,v); ++ in[u], ++ in[v];
    }

    rep(i,1,n) id[i] = i;

    sort(id + 1,id + 1 + n, cmp);

    rep(i,1,n)
        if(FIND_TIME() > 0.9) break;
        else if(!dt[id[i]] && check(id[i]))
        {
            printf("%d\n",id[i]);
            return 0;
        }

    puts("-1");

    return 0;
}