[문제 링크] : https://www.acmicpc.net/problem/1516#include #include using namespace std;int C[501];vector V[501];int DP[501];void solve(int n){ if(DP[n] != 1234567890) return; if(V[n].size() == 0){ DP[n] = C[n]; return; } int cnt = 0; for(int i=0; i> N; for(int i=0; i> C[i]; while(cin >> p && p != -1){ V[i].push_back(p); } } ..