D. Weights Assignment For Tree Edges
给定b数组:对于b数中的一个数,
b
i
b_i
bi 是i个祖先
给定一个排列p,要求 d i s t [ p [ i ] ] < d i s t [ p [ i + 1 ] ] dist[p[i]] < dist[p[i+1]] dist[p[i]]<dist[p[i+1]] ,也就是说p排列给了从根节点到各个节点距离大小关系。
d i s t [ i ] dist[i] dist[i] 表示从根节点到当前节点的距离
(1)根节点的 d i s t [ p [ 1 ] ] = 0 dist[p[1]]=0 dist[p[1]]=0, p[1] 一定是根节点,否则根节点在后面无法保证升序
(2)寻循环遍历p数组,对于一个节点,它的父亲节点一定是被计算过的,否则后面再计算父亲节点,无法保证升序
每次更新 : d i s t [ p [ i ] ] = d i s t [ p [ i − 1 ] ] + 1 dist[p[i]] = dist[p[i-1]] + 1 dist[p[i]]=dist[p[i−1]]+1
所求 w [ i ] w[i] w[i] 是从 b [ i ] b[i] b[i] 到 i 的距离,也即是当前节点到父亲节点的距离 d i s t [ i ] − d i s t [ b [ i ] ] dist[i] - dist[b[i]] dist[i]−dist[b[i]]
// Problem: D. Weights Assignment For Tree Edges
// Contest: Codeforces - Codeforces Round #756 (Div. 3)
// URL: https://codeforces.com/problemset/problem/1611/D
// Memory Limit: 256 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define lowbit(x) (x&-x)
#define pf(a) printf("%d\n",a)
#define mem(x,y) memset(x,y,sizeof(x))
#define dbg(x) cout << #x << " = " << x << endl
#define rep(i,l,r) for(int i = l; i <= r; i++)
#define fep(i,a,b) for(int i=b; i>=a; --i)
#define PII pair<int,int>
//#define long long in
typedef long long ll;
const int N = 1e6+10;
int n,m;
void solve()
{
scanf("%d",&n);
vector<int> b(n+1),p(n+1), dist(n+1,-1);
rep(i,1,n) scanf("%d",&b[i]);
rep(i,1,n) scanf("%d",&p[i]);
if(b[p[1]] != p[1]) { // 判断p[1] 是不是根
puts("-1");
return;
}
dist[p[1]] = 0;
rep(i,2,n) {
if(dist[b[p[i]]] == -1) { // 父亲节点dist > 儿子节点dist
puts("-1");
return;
}
dist[p[i]] = dist[p[i-1]] + 1;
}
rep(i,1,n) printf("%d ",dist[i]-dist[b[i]]);
puts("");
}
int main()
{
int t;
scanf("%d", &t);
while(t--)
solve();
return 0;
}