hdu 4274 Spy's Work

#pragma comment(linker, "/STACK:102400000,102400000")
#include<stdio.h>
#include<string.h>
#include<ctype.h>
#include<math.h>
#include<string>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
void fre(){freopen("t.txt","r",stdin);}
#define ls o<<1
#define rs o<<1|1
#define MS(x,y) memset(x,y,sizeof(x))
#define debug(x) printf("%d",x);
typedef long long LL;
typedef unsigned long long UL;
typedef unsigned int UI;
const int MAXN = 10010;

LL Min[MAXN],Max[MAXN];
int n;
vector<int>e[MAXN];
void init()
{
for(int i = 0; i <= n; ++i) e[i].clear(), Min[i] = 1, Max[i] = 1000000000000ll;
}
bool dfs(int u)
{
int v;
LL umin = 1;
for(int i = 0; i < e[u].size(); ++i)
{
v = e[u][i];
if(!dfs(v)) return 0;
umin += Min[v];
}
if(umin > Min[u]) Min[u] = umin;
if(Min[u] > Max[u]) return 0;
return 1;
}
int main()
{
fre();
int u,v,m;
char ope[5];
while(~scanf("%d",&n))
{
init();
for(int i = 2; i <= n; ++i)
{
scanf("%d",&u);
e[u].push_back(i);
}
scanf("%d",&m);
while(m--)
{
scanf("%d%s%d",&u,ope,&v);
if(ope[0] == '>') if(++v > Min[u]) Min[u] = v;
else if(ope[0] == '<') if(--v < Max[u]) Max[u] = v;
else
{
if(v > Min[u]) Min[u] = v;
if(v < Max[u]) Max[u] = v;
}
}
if(dfs(1)) printf("True\n");
else printf("Lie\n");
}
}