이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "september.h"
#include <bits/stdc++.h>
using namespace std;
int solve(int n, int m, vector<int> p, vector<vector<int>> b) {
vector<vector<int>> adj(n, vector<int>());
for (int i = 1; i < n; i++) adj[p[i]].push_back(i);
int ans = n-1;
for (auto vec : b) {
set<int> pending;
vector<int> vis(n);
int day = 0;
for (int i = 0; i < n-1; i++) {
pending.erase(vec[i]);
vis[vec[i]] = 1;
for (auto children : adj[vec[i]]) {
if (!vis[children]) pending.insert(children);
}
day += pending.size() == 0;
}
ans = min(ans, day);
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |