#include "september.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;;
const int INF = INT_MAX;
vector < int > adj[N];
int idx[N] , sub[N];
int cur_idx = 0;
void dfs(int v , int p)
{
sub[v] = 1;
idx[v] = ++cur_idx;
for(int u : adj[v])
{
if(u != p)
{
dfs(u , v);
sub[v] += sub[u];
}
}
}
bool is_anc(int u , int v)
{
if(idx[v] >= idx[u] && idx[u] + sub[u] - 1 >= idx[v]) return true;
return false;
}
void fix(int n)
{
for(int i = 0;i <= n;i++) adj[i].clear() , idx[i] = 0 , sub[i] = 0;
cur_idx = 0;
}
int solve(int n , int m , vector < int > F , vector < vector < int > > S)
{
for(int i = 1;i <= n - 1;i++)
{
adj[i].push_back(F[i]);
adj[F[i]].push_back(i);
}
dfs(0 , -1);
int res = 0;
vector < vector < int > > curv(m);
for(int i = 0;i < S[0].size();i++)
{
for(int j = 0;j < m;j++) curv[j].push_back(S[j][i]) , sort(curv[j].begin() , curv[j].end());
set < vector < int > > st;
for(int j = 0;j < m;j++) st.insert(curv[j]);
if(st.size() != m) continue;
bool can = 1;
for(int j = 0;j < m;j++)
{
for(int fi = 0;fi <= i;fi++)
{
for(int si = i + 1;si < S[0].size();si++)
{
if(is_anc(S[j][fi] , S[j][si])) can = 0;
}
}
}
if(can) for(int j = 0;j < m;j++) curv[j].clear();
res += can;
}
fix(n);
return res;
}
# | 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... |