#include <iostream> #include <vector> #include <set> using namespace std; int main() { int n, t, x; cin >> n; set<int> monsters; vector<int> types(n); vector<int> nodes(n); for (int i = 0; i < n; ++i) { cin >> types[i] >> nodes[i]; nodes[i] -= 1; } int last = 0; // 1 说 2 是宝箱 2说3是宝箱， 3说1是宝箱怪，这样的矛盾判断1是宝箱怪 for (int i = 0; i < n; ++i) { int count = 0; int k = i; while (types[k] == 1) { k = nodes[k]; if (++count >= n) break; // 处理 环 } if (types[k] == 2 && nodes[k] == i) monsters.insert(i); } // 指向宝箱怪 是 宝箱的 都是 宝箱怪 while (last != monsters.size()) { last = monsters.size(); for (int i = 0; i < n; ++i) { if (types[i] == 1 && monsters.find(nodes[i]) != monsters.end()) { monsters.insert(i); } } } cout << 0 << " " << monsters.size() << endl; return 0; }