#图论/并查集# 美团2018年CodeM大赛C-Traffic

Title

https://ac.nowcoder.com/acm/contest/162/C

---

Solution

首先最短路只会出现两种情况，一是不停地往右走，二是往右走后再往左走且不再往右走。
我们先记录$d[i][j]$为第一种情况，那么对于每个点，从向左距离最近的区间往右跳。

---

Code

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#define rep(i,x,y) for(register int i=x;i<=y;i++)
using namespace std; 
const int N=6010; 
int n,d[N][N],a[N],b[N],ans,f[N],p; 
bool u[N]; 
vector<int> v[N]; 
inline int find(int x){ return f[x]==x?x:f[x]=find(f[x]);}
int main(){
	scanf("%d",&n); 
	rep(i,2,n) scanf("%d",&b[i]); 
	rep(i,2,n) scanf("%d",&a[i]); 
	rep(i,1,n) for(int j=i-1,k=i;j>=1;j--) {
		while (a[k]>j) k--;
		d[j][i]=d[k][i]+1; 
	}
	b[1]=1; 
	rep(i,1,n){
		rep(j,0,n) f[j]=j,v[j].clear(),u[j]=0; 
		rep(j,i,n) v[d[i][j]].push_back(j); 
		rep(j,0,n)
		{
//			rep(k,0,v[j].size()-1) {
			for (int k=0;k<v[j].size();k++){
				p=v[j][k]; 
				if (u[p]) continue; u[p]=1; 
				for(int q=find(p);q>=b[p];q=find(q)){
					if (d[i][q]>d[i][p]+1||(d[i][q]==0&&i!=q)) d[i][q]=d[i][p]+1; 
					v[d[i][q]].push_back(q); 
					f[q]=find(q-1); 
				}
			}
		}
	}

	rep(i,1,n) rep(j,1,n) ans^=d[i][j]*(i+j);
	printf("%d",ans); 
}