19:I[13002,["52266","static/chunks/870fdd6f-3edbf5e5faf3a3e9.js","97330","static/chunks/d3ac728e-6938b2b492a69981.js","6079","static/chunks/363642f4-c76dc299f9b79c67.js","57489","static/chunks/57489-612de1b2ecbff857.js","57181","static/chunks/57181-b112fbb14ea35934.js","6874","static/chunks/6874-f6ef90b4e9b1a57c.js","66439","static/chunks/66439-31aa122d966c9045.js","34540","static/chunks/34540-0bf1ca1fd95318af.js","88600","static/chunks/88600-07962c26369d873a.js","81548","static/chunks/81548-2af8f9e6fb9ecfbe.js","39554","static/chunks/39554-fcde086ccbc79707.js","76921","static/chunks/76921-f2f6b3b4ed745e8c.js","66766","static/chunks/66766-e1b70a369ce4303d.js","21715","static/chunks/21715-52525116a0dbc7e3.js","62792","static/chunks/62792-0f25cfbbb1922fc5.js","21727","static/chunks/21727-f3242da66653f478.js","7988","static/chunks/7988-8da6930e348f9942.js","55706","static/chunks/55706-e39f25de6daceca5.js","6837","static/chunks/6837-0b93a094a9c0cb62.js","98314","static/chunks/98314-d00d7bfb906dd74f.js","85562","static/chunks/85562-83fff821b93329e4.js","24341","static/chunks/24341-f1bfe5d6cef912d5.js","21639","static/chunks/21639-8b9a2ea74aaf2fb4.js","95415","static/chunks/95415-0267125d04be6390.js","6751","static/chunks/6751-8620b93062b3d59d.js","49408","static/chunks/app/coding-problems/%5Bid%5D/submissions/page-6d18bfbf5181b2c8.js"],"default"] 1a:T523,#include #include #include #include #include #include #include #include using namespace std; const int N = 305; int fa[N], dep[N]; bool vis[N]; vector ch[N]; int getdep(int x) { return x == 0 ? 0 : getdep(fa[x]) + 1; } void dfs(int x) { vis[x] = 1; for (int y : ch[x]) dfs(y); } bool check(int x, int n, const vector& vec) { for (int i = 0; i <= n; i++) vis[i] = 0; dfs(x); for (int y : vec) if (!vis[y]) return 0; return 1; } int main() { // freopen("data.1.in", "r", stdin); // freopen("tmp.txt", "w", stdout);

题库

题库

12970.工作沟通

提交记录

测试用例