bitset was the idea of coach fegla.
/* * 6432.cpp * * Created on: Sep 4, 2014 * Author: ghooo */ #include <cstring> #include <map> #include <deque> #include <queue> #include <stack> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <ctime> #include <algorithm> #include <vector> #include <set> #include <complex> #include <list> #include <climits> #include <cctype> #include <bitset> //#include <windows.h> using namespace std; #define pb push_back #define all(v) v.begin(),v.end() #define rall(v) v.rbegin(),v.rend() #define sz(v) ((int)v.size()) #define rep(i,m) for(int i=0;i<(int)(m);++i) #define repe(i,n,m) for(int i=n;i<=(int)(m);++i) #define rep2(i,n,m) for(int i=n;i<(int)(m);i++) #define For(it,c) for(__typeof(c.begin()) it=c.begin();it!=c.end();++it) #define reset(a,b) memset(a,b,sizeof(a)) #define mp make_pair #define dot(a,b) ((conj(a)*(b)).X) #define X real() #define Y imag() #define length(V) (hypot((V).X,(V).Y)) #define vect(a,b) ((b)-(a)) #define cross(a,b) ((conj(a)*(b)).imag()) #define normalize(v) ((v)/length(v)) #define rotate(p,about,theta) ((p-about)*exp(point(0,theta))+about) #define pointEqu(a,b) (comp(a.X,b.X)==0 && comp(a.Y,b.Y)==0) #define clrq(x) while(!x.empty()) x.pop(); #define clrvv(v) rep(i,sz(v))v[i].clear(); #define debug(x) cerr << #x << ": " << x << endl; #define debugv(v) cerr << #v << ": ";For(it,v)cerr <<(*it)<<", "; cerr<<endl; typedef stringstream ss; typedef long long ll; typedef pair<int, int> pii; typedef vector<pii> vpii; typedef vector<string> vs; typedef vector<int> vi; typedef vector<double> vd; typedef vector<vector<int> > vii; typedef long double ld; typedef complex<double> point; typedef pair<point, point> segment; typedef pair<double, point> circle; typedef vector<point> polygon; typedef unsigned long long ull; typedef long long ll; //============================================================== // handling triples typedef pair<ll,pair<ll,ll> > triple; #define tfirst first #define tsecond second.first #define tthird second.second #define mt(x,y,z) mp(x,mp(y,z)) //--------------------------------------------------------------- const int oo = (int) 1e9; const double PI = 2 * acos(0.0); const double eps = 1e-9; vector<vector<short> > adj; bitset<5001> mem[5001]; int vis[5001], ID; bitset<5001> dp(short cur){ if(vis[cur] == ID) return mem[cur]; vis[cur] = ID; mem[cur]=0; mem[cur][cur]=1; for(short i = 0; i < sz(adj[cur]); i++){ mem[cur]|= dp(adj[cur][i]); } return mem[cur]; } int main(){ ios_base::sync_with_stdio(false); #ifndef ONLINE_JUDGE freopen("in.txt", "r", stdin); //freopen("out.txt", "w", stdout); #endif short n, k, x, y; while(cin >> n >> k){ vector<short> v; rep(i,k){ cin >> x; v.pb(x); } adj.clear(); adj.resize(n+1); string s; getline(cin,s); rep(i,n){ getline(cin,s); stringstream ss(s); ss >> x; while(!ss.eof()){ ss >> y; adj[x].pb(y); } } short ans = 0, ansIdx = -1; ID++; rep(i,sz(v)){ short t = dp(v[i]).count(); if(t > ans) ans = t, ansIdx = v[i]; } cout << ansIdx << endl; } return 0; }
No comments:
Post a Comment