Submission #32851482

---

Source Code Expand

#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#include<bits/stdc++.h>
#define re register
#define fep(i,l,r) for(re int i=l;i<=r;++i)
#define feb(i,r,l) for(re int i=r;i>=l;--i)
#define For(i,u) for(re int i=head[u];i;i=e[i].nxt)
#define int long long
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
 
const int N = 3e5+5;
int n,head[N],tot,m,INF;
struct Egde
{
	int v,nxt;
}e[N<<1];
struct SPFA
{
	int dis[N]; bool vis[N];
	
	inline void spfa(int s)
	{
		queue<int> q; fep(i,1,n) dis[i]=INF,vis[i]=false;
		dis[s]=0; vis[s]=true; q.push(s);// cout<<dis[2]<<endl;
		while(!q.empty())
		{
			int u=q.front(); q.pop(); vis[u]=false;
			For(i,u) if(dis[e[i].v]>dis[u]+1)
			{
				dis[e[i].v]=dis[u]+1;
				if(!vis[e[i].v]) q.push(e[i].v),vis[e[i].v]=true;
			}
		}
	}
}a[5];

inline int read() { int s=0,w=1; char ch=getchar(); while(!(ch<='9'&&ch>='0')) {if(ch=='-') w=-1; ch=getchar();} while(ch<='9'&&ch>='0') {s=(s<<1)+(s<<3)+(ch^48); ch=getchar();} return s*w; }
inline void write(int x) { if(x>=10) write(x/10); putchar(x%10+'0'); }
inline void print(int x,char ch) { if(x<0) putchar('-'),x=~(x-1); write(x);  putchar(ch);}
inline void swap(int &x,int &y) {x^=y; y^=x; x^=y;}
inline void add(int u,int v) {e[++tot]={v,head[u]}; head[u]=tot;}

signed main()
{
	n=read(),m=read(); INF=1e9; vector<int > unknow; int cnt=0;
	fep(i,1,m)
	{
		int u=read(),v=read();
		if(u==0) unknow.emplace_back(v),cnt+=(v==1)+(v==n);
		else if(v==0) unknow.emplace_back(u),cnt+=(u==1)+(u==n);
		else add(u,v),add(v,u);
	}
	a[1].spfa(1); a[2].spfa(n);
	int ans1=INF,ans2=INF;
	fep(j,0,(int)unknow.size()-1)
	ans1=min(ans1,a[2].dis[unknow[j]]+1),
	ans2=min(ans2,a[1].dis[unknow[j]]+1);
	fep(i,1,n)
	{
		int res=a[1].dis[n]; if(cnt==2) res=min(res,2ll);
		res=min(res,min(ans1+a[1].dis[i],ans2+a[2].dis[i]));
		print(res>=INF?-1:res,' ');
	}
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In member function ‘void SPFA::spfa(long long int)’:
./Main.cpp:24:21: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   24 |   queue<int> q; fep(i,1,n) dis[i]=INF,vis[i]=false;
      |                     ^
./Main.cpp:5:31: note: in definition of macro ‘fep’
    5 | #define fep(i,l,r) for(re int i=l;i<=r;++i)
      |                               ^
./Main.cpp:29:8: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   29 |    For(i,u) if(dis[e[i].v]>dis[u]+1)
      |        ^
./Main.cpp:7:29: note: in definition of macro ‘For’
    7 | #define For(i,u) for(re int i=head[u];i;i=e[i].nxt)
      |                             ^
./Main.cpp: In function ‘int main()’:
./Main.cpp:47:6: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   47 |  fep(i,1,m)
      |      ^
./Main.cpp:5:31: note: in definition of macro ‘fep’
    5 | #define fep(i,l,r) for(re int i=l;i<=r;++i)
      |                               ^
./Main.cpp:56:6: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   56 |  fep(j,0,(int)unknow.size()-1)
      |      ^
./Main.cpp:5:31: note: in definition of macro ‘fep’
    5 | #define fep(i,l,r) for(re int i=l;i<=r;++i)
      |                               ^
./Main.cpp:59:6: warning: ISO C++17 does not allow ‘register’ storage class specifier [-Wregister]
   59 |  fep(i,1,n)
      |      ^
./Main.cpp:5:31: note: in definition of macro ‘fep’
    5 | #define fep(i,l,r) for(re int i=l;i<=r;++i)
      |                               ^

Judge Result