#include using namespace std; const int MX = 10000; #define int long long vector> adj, adjt; stack st; vector seen; vector> cc; void dfs1(int i) { seen[i] = true; for(int a: adj[i]) { if(!seen[a]) dfs1(a); } st.push(i); } void dfs2(int i) { seen[i] = true; cc.back().push_back(i); for(int a: adjt[i]) { if(!seen[a]) dfs2(a); } } void scc(int v) { fill(seen.begin(), seen.end(), false); for(int i=0; isync_with_stdio(0); int N; cin >> N; map mp; vector v; map> adj_raw; auto add_node = [&](string s) { if(mp.count(s)) return; mp[s] = v.size(); v.push_back(s); }; for(int i=0; i> s; add_node(s); int m; cin >> m; while(m--) { string t; cin >> t; add_node(t); adj_raw[s].push_back(t); } } adj.resize(v.size()); adjt.resize(v.size()); seen.resize(v.size()); for(auto &[a, vec]: adj_raw) { for(string b: vec) { // printf("adding edge %s -> %s. number is %d -> %d\n", b.c_str(), a.c_str(), mp[b], mp[a]); adj[mp[b]].push_back(mp[a]); adjt[mp[a]].push_back(mp[b]); } } vector score(v.size(), 1); scc(v.size()); for(int i=0; i> qry; cout << score[mp[qry]] << '\n'; }

코드 #2600