Submission #743175

#	Time	Username	Problem	Language	Result	Execution time	Memory
743175		zaneyu	Maze (JOI23_ho_t3)	C++17	0 / 100	2098 ms	329248 KiB

Main

#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=6e6+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-4;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
string arr[maxn];
int r,c,n;
int to(int i,int j){
	return i*c+j;
}
bool isin(int x,int y){
	if(x<0 or x>=r or y<0 or y>=c) return false;
	return true;
}
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
int mxx[maxn],mnx[maxn],mxy[maxn],mny[maxn];
vector<pii> bord[maxn];
bool vis[maxn];
bool bad(int a,int b){
	a=abs(a),b=abs(b);
	if(min(a,b)>=n) return true;
	if(max(a,b)>n) return true;
	return false;
}
int main(){
	cin>>r>>c>>n;
	int sx,sy,a,b;
	cin>>sx>>sy>>a>>b;
	--sx,--sy,--a,--b;
	REP(i,r){
		cin>>arr[i];
	}
	queue<pii> q;
	q.push({sx,sy});
	vector<pii> vv;
	REP(i,r) mxx[i]=-1,mnx[i]=INF;
	REP(i,c) mxy[i]=-1,mny[i]=INF;
	vector<int> hx,hy;
	while(sz(q)){
		pii z=q.front();
		if(mxx[z.f]==-1) hx.pb(z.f);
		if(mxy[z.s]==-1) hy.pb(z.s);
		MXTO(mxx[z.f],z.s);
		MNTO(mnx[z.f],z.s);
		MXTO(mxy[z.s],z.f);
		MNTO(mny[z.s],z.f);
		q.pop();
		REP(k,4){
			int x=dx[k]+z.f,y=dy[k]+z.s;
			if(!isin(x,y) or arr[x][y]=='#' or vis[to(x,y)]) continue;
			vis[to(x,y)]=1;
			q.push({x,y});
		}
	}
	int ans=0;
	
	while(!vis[to(a,b)])
	{
		queue<pair<pii,pii>> q;
		for(int i:hx){
			if(mxx[i]!=-1) q.push({{i,mxx[i]},{0,0}}),q.push({{i,mnx[i]},{0,0}});
		}
		for(int i:hy){
			if(mxy[i]!=-1) q.push({{mxy[i],i},{0,0}}),q.push({{mny[i],i},{0,0}});
		}
		while(sz(q)){
			pii z=q.front().f;
			if(mxx[z.f]==-1) hx.pb(z.f);
			if(mxy[z.s]==-1) hy.pb(z.s);
			MXTO(mxx[z.f],z.s);
			MNTO(mnx[z.f],z.s);
			MXTO(mxy[z.s],z.f);
			MNTO(mny[z.s],z.f);
			pii df=q.front().s;
			q.pop();
			REP(k,4){
				int x=dx[k]+z.f,y=dy[k]+z.s;
				int ndx=df.f+dx[k],ndy=df.s+dy[k];
				if(!isin(x,y) or (arr[x][y]=='#' and bad(ndx,ndy)) or vis[to(x,y)]) continue;
				vis[to(x,y)]=1;
				q.push({{x,y},{ndx,ndy}});
			}
		}
		++ans;
	}
	cout<<ans<<'\n';
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 19
• Subtask 3: 0 / 16
• Subtask 4: 0 / 19
• Subtask 5: 0 / 5
• Subtask 6: 0 / 19
• Subtask 7: 0 / 8
• Subtask 8: 0 / 6