luogu P3084 [USACO13OPEN]照片Photo

analysis

不等式组:

$$(a_i,bi)=>\{\begin{array}{l}{x}_{b_i}-x_{a_i}<=1\\ x_{b_i}-x_{a_i}>=1\end{array}$$
$$\forall i\in [1,n]=>\{\begin{array}{l}{x}_i-x_{i-1}>=0\\ x_i-x_{i-1}<=1\end{array}$$

无解可能会卡slf优化,但不用slf优化的话其他点又会被卡

于是可以用clock或者判断入队次数

很草率但是很有用的做法

code

#include<bits/stdc++.h>
using namespace std;
#define loop(i,start,end) for(register int i=start;i<=end;++i)
#define clean(arry,num) memset(arry,num,sizeof(arry))
template<typename T>void read(T &x){
	char r=getchar();T neg=1;x=0;
	while(r>'9'||r<'0'){if(r=='-')neg=-1;r=getchar();}
	while(r>='0'&&r<='9'){x=(x<<1)+(x<<3)+r-'0';r=getchar();}
	x*=neg;
}
int n,m;
const int maxn=200000+10;
const int maxm=100000+10;
struct node{
	int e;
	int w;
	int nxt;
}edge[(maxm<<1)+(maxn<<1)];
int head[maxn];
int cnt=0;
inline void addl(int u,int v,int w){
	edge[cnt].e=v;
	edge[cnt].w=w;
	edge[cnt].nxt=head[u];
	head[u]=cnt++;
}
int dis[maxn];
deque<int>q;
int in[maxn];
bool vis[maxn];
void spfa(){
	int qwq=0;
	clean(dis,0x3f);
	clean(vis,false);
	clean(in,0);
	++in[0];
	vis[0]=true;
	dis[0]=0;
	q.push_front(0);
	while(q.empty()==false){
		int f=q.front();
		q.pop_front();
		vis[f]=false;
		for(int i=head[f];i!=-1;i=edge[i].nxt){
			int v=edge[i].e;
			if(dis[v]>dis[f]+edge[i].w){
				dis[v]=dis[f]+edge[i].w;
				if(!vis[v]){
					vis[v]=true;
					if(!q.empty()&&dis[q.front()]>dis[v])
						q.push_front(v);
					else q.push_back(v);
					if(++in[v]>n||++qwq>2015999){
						printf("-1");
						return;
					}
				}
			}
		}
	}
	printf("%d\n",dis[n]);
}
int main(){
	#ifndef ONLINE_JUDGE
	freopen("datain.txt","r",stdin);
	#endif
	clean(head,-1);
	read(n);
	read(m);
	loop(i,1,m){
		int ai,bi;
		read(ai);
		read(bi);
		addl(ai-1,bi,1);
		addl(bi,ai-1,-1);
	}
	loop(i,1,n){
		addl(i,i-1,0);
		addl(i-1,i,1);
	}
	spfa();
	return 0;
}