可以图论虚拟点做，也可以直接DP

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
#define int long long
const int N = 1e6+10;
const int inf = 0x3f3f3f3f;
const int mod = 1e9+7;
int gcd(int a,int b){return b?a:gcd(b,a%b);}
int lcm(int a,int b){return a*b/gcd(a,b);}
int qmi(int a,int b,int mod){int res=1;while(b){if(b&1)res=res*a%mod;b>>=1;a=a*a%mod;}return res;}int n,q,m;
int pos[N],temp[N];
// int e[N],ne[N],w[N],h[N],idx;
// void add(int a,int b,int c){// e[idx] = b,ne[idx] = h[a],w[idx] = c,h[a] = idx++;
// }
int dp[N];void solve()
{cin>>n>>m;for(int i=0;i<=n+1;i++)dp[i] = 0x3f3f3f3f;for(int i=1;i<=m;i++)cin>>pos[i];for(int i=1;i<=m;i++)cin>>temp[i];for(int i=1;i<=m;i++)dp[pos[i]] =  temp[i];for(int i=1;i<=n;i++)dp[i] = min(dp[i],dp[i-1]+1);for(int i=n;i>=1;--i)dp[i] = min(dp[i],dp[i+1]+1);for(int i=1;i<=n;i++)cout<<dp[i]<<" \n"[i==n];}signed main()
{ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);int _;cin>>_;//_ = 1;while(_--)solve();return 0;
}

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
#define int long long
const int N = 1e6+10;
const int inf = 0x3f3f3f3f;
const int mod = 1e9+7;
int gcd(int a,int b){return b?a:gcd(b,a%b);}
int lcm(int a,int b){return a*b/gcd(a,b);}
int qmi(int a,int b,int mod){int res=1;while(b){if(b&1)res=res*a%mod;b>>=1;a=a*a%mod;}return res;}int n,q,m;
int pos[N],temp[N];
// int e[N],ne[N],w[N],h[N],idx;
// void add(int a,int b,int c){// e[idx] = b,ne[idx] = h[a],w[idx] = c,h[a] = idx++;
// }
int dp[N];void solve()
{cin>>n>>m;for(int i=0;i<=n+1;i++)dp[i] = 0x3f3f3f3f;for(int i=1;i<=m;i++)cin>>pos[i];for(int i=1;i<=m;i++)cin>>temp[i];for(int i=1;i<=m;i++)dp[pos[i]] =  temp[i];for(int i=1;i<=n;i++)dp[i] = min(dp[i],dp[i-1]+1);for(int i=n;i>=1;--i)dp[i] = min(dp[i],dp[i+1]+1);for(int i=1;i<=n;i++)cout<<dp[i]<<" \n"[i==n];}signed main()
{ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);int _;cin>>_;//_ = 1;while(_--)solve();return 0;
}