树形dp,这道题主要是把题目的模型转换一下,给每个节点设置一个上下界,然后dfs分别判断每个节点上下界时候有冲突即可。每个节点下届等于子节点下届之和加1。
#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
#include<cstdio>
#include<cmath>
#include<set>
#define SL strlen
#define PB push_back
#define LL long long
#define INF 0X3f3f3f3f
#define CLR(a, b) memset(a, b, sizeof(a))
using namespace std;
const int N = 11111;
struct Edge
{
int u, v;
}E[N];
struct Dot
{
int up, dw;
}d[N];
int fir[N], next[N], tot;
char op[2];
void Add_Edge(int u, int v)
{
E[tot].u = u, E[tot].v = v;
next[tot] = fir[u], fir[u] = tot ++;
}
bool dfs(int u)
{
int i, v, dw = 0;
for(i = fir[u]; ~i; i = next[i])
{
v = E[i].v;
if(!dfs(v)) return 0;
dw += d[v].dw;
}
d[u].dw = max(d[u].dw, dw + 1);
if(d[u].dw > d[u].up) return 0;
return 1;
}
int main()
{
//freopen("input.txt", "r", stdin);
int n, i, j, x, w, m;
while(scanf("%d", &n) != EOF)
{
d[1].up = INF;
d[1].dw = 1;tot = 0;
CLR(fir, -1);
for(i = 2; i <= n; i ++)
{
scanf("%d", &x);
Add_Edge(x, i);
d[i].dw = 1;
d[i].up = INF;
}
scanf("%d", &m);
for(i = 0; i < m; i ++)
{
scanf("%d%s%d", &x, op, &w);
if(op[0] == '<') d[x].up = w - 1;
else if(op[0] == '=') d[x].up = d[x].dw = w;
else d[x].dw = w + 1;
}
if(dfs(1)) puts("True");
else puts("Lie");
}
}