HDU 5996 博弈

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <assert.h>
#define IOS ios::sync_with_stdio(false)
using namespace std;
#define inf (0x3f3f3f3f)
typedef long long int LL;


#include <iostream>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <string>
const int maxn = 300000 + 20;
int first[maxn];
struct node {
    int u, v;
    int tonext;
}e[maxn * 2];
int num;
int a[maxn];
void add(int u, int v) {
    ++num;
    e[num].u = u;
    e[num].v = v;
    e[num].tonext = first[u];
    first[u] = num;
}
vector<int>gg;
int vis[maxn];
int DFN;
void dfs(int cur, int deep) {
    if (deep % 2 == 0) {
        gg.push_back(a[cur]);
    }
    for (int i = first[cur]; i; i = e[i].tonext) {
        int v = e[i].v;
        if (vis[v] == DFN) continue;
        vis[v] = DFN;
        dfs(v, !deep);
    }
}
void work() {
    DFN++;
    gg.clear();
    num = 0;
    memset(first, 0, sizeof first);
    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n - 1; ++i) {
        int fa;
        scanf("%d", &fa);
        add(fa, i);
        add(i, fa);
    }
    for (int i = 0; i < n; ++i) {
        scanf("%d", &a[i]);
    }
    if (n == 1) {
        printf("lose\n");
        return;
    }
    vis[0] = DFN;
    dfs(0, 1);
    LL ans = gg[0];
    for (int i = 1; i < gg.size(); ++i) {
        ans ^= gg[i];
    }
    if (ans != 0) {
        printf("win\n");
    } else printf("lose\n");
}

int main() {
#ifdef local
    freopen("data.txt", "r", stdin);
//    freopen("data.txt", "w", stdout);
#endif
    int t;
    scanf("%d", &t);
    while (t--) work();
    return 0;
}