1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"CodeViewer"] 1c:T5de,#include using namespace std; int32_t main() { cin.tie(0)->sync_with_stdio(0); int N; cin >> N; vector E(N+1); vector> dep(N+1); for(int i=1; i<=N; i++) { cin >> E[i]; int d; cin >> d; while(d--) { int t; cin >> t; dep[i].push_back(t); } } auto solve = [&](int m) { queue que; vector in(N+1), mx(N+1); for(int i=1; i<=N; i++) { for(int a: dep[i]) { in[a]++; } mx[i] = m - E[i] + 1; } for(int i=1; i<=N; i++) { if(!in[i]) { que.push(i); } } while(que.size()) { int q = que.front(); que.pop(); for(int a: dep[q]) { mx[a] = min(mx[a], mx[q] - 1); in[a]--; if(!in[a]) { que.push(a); } } } vector v; for(int i=1; i<=N; i++) { v.push_back(mx[i]); } sort(v.begin(), v.end()); for(int i=0; i v[i]) { return false; } } return true; }; int l = N, r = 1e7; while(l < r) { int m = (l+r) / 2; if(solve(m)) { r = m; } else { l = m+

코드 #4582