这道就是跟之前很类似的一个带权并查集,只不过要同时维护两个关系;其次只需要先把询问按index排序,求完答案再按原序排回来就行。
但是写的时候莫名其妙T了,感觉上复杂度改前改后没区别啊,然而就是T。具体位置在注释处。
AC代码:
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn=40005;
int from[maxn],to[maxn],dis[maxn],forward[maxn];
int f[maxn],relaE[maxn],relaN[maxn];
struct node{
int id;
int num1,num2,index;
int ans;
}a[maxn];
int n,m,k;
int cmp1(node n1,node n2)
{
return n1.index<n2.index;
}
int cmp2(node n1,node n2)
{
return n1.id<n2.id;
}
void init()
{
for(int i=1;i<=n;i++)f[i]=i,relaE[i]=relaN[i]=0;
}
int find(int x)
{
if(x==f[x]) return x;
int temp=f[x];
f[x]=find(f[x]);
relaE[x]=(relaE[temp]+relaE[x]);
relaN[x]=(relaN[temp]+relaN[x]);
return f[x];
}
void join(int x1,int x2,int relationE,int relationN)
{
int f1=f[x1],f2=f[x2];
if(f1==f2) return;
f[f2]=f1;
relaE[f2]=relaE[x1]-relaE[x2]-relationE;
relaN[f2]=relaN[x1]-relaN[x2]-relationN;
}
int main()
{
while(scanf("%d%d",&n,&m)!=EOF){
init();
for(int i=1;i<=m;i++){
char s[5];
scanf("%d%d%d",&from[i],&to[i],&dis[i]);
scanf("%s",s);
if(s[0]=='E') forward[i]=1;
else if(s[0]=='W') forward[i]=1,dis[i]=-dis[i];
else if(s[0]=='N') forward[i]=0;
else forward[i]=0,dis[i]=-dis[i];
}
scanf("%d",&k);
for(int i=1;i<=k;i++){
scanf("%d%d%d",&a[i].num1,&a[i].num2,&a[i].index);
a[i].id=i;
}
sort(a+1,a+k+1,cmp1);
int ptr=0;
for(int i=1;i<=k;i++){
int index=a[i].index;
while(++ptr<=index){
if(forward[ptr]) join(from[ptr],to[ptr],dis[ptr],0);
else join(from[ptr],to[ptr],0,dis[ptr]);
}
ptr--;
// for(int j=i;j<=k;j++){
// if(a[j].index!=index){
// i=j-1;
// break;
// }
// if(find(a[j].num1)!=find(a[j].num2)){
// a[j].ans=-1;
// }
// else{
// a[j].ans=abs(relaE[a[j].num1]-relaE[a[j].num2])+abs(relaN[a[j].num1]-relaN[a[j].num2]);
// }
// }
if(find(a[i].num1)!=find(a[i].num2))
a[i].ans=-1;
else
a[i].ans=abs(relaE[a[i].num1]-relaE[a[i].num2])+abs(relaN[a[i].num1]-relaN[a[i].num2]);
}
sort(a+1,a+k+1,cmp2);
for(int i=1;i<=k;i++) printf("%d\n",a[i].ans);
}
return 0;
}