Submission #235696

#	Time	Username	Problem	Language	Result	Execution time	Memory
235696		alishahali1382	Portals (BOI14_portals)	C++14	100 / 100	216 ms	32760 KiB

portals

#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod=1000000007;
const int N=1010;

int n, m, k, u, v, x, y, t, a, b, ans;
char A[N][N];
int dist1[N][N];
int dist2[N][N];
int L[N][N], R[N][N], U[N][N], D[N][N];
bool mark[N][N];
queue<pii> Q;

inline void upd(int x, int y, int d){
	if (x<0 || x>=N || y<0 || y>=N || A[x][y]=='#' || dist1[x][y]<=d) return ;
	dist1[x][y]=d;
	if (!mark[x][y]){
		mark[x][y]=1;
		Q.push({x, y});
	}
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	for (int i=0; i<N; i++) fill(A[i], A[i]+N, '#');
	cin>>n>>m;
	for (int i=1; i<=n; i++) for (int j=1; j<=m; j++) cin>>A[i][j];
	for (int i=1; i<=n; i++) for (int j=1; j<=m; j++) L[i][j]=(A[i][j-1]=='#'?j:L[i][j-1]);
	for (int i=1; i<=n; i++) for (int j=m; j; j--) R[i][j]=(A[i][j+1]=='#'?j:R[i][j+1]);
	for (int i=1; i<=n; i++) for (int j=1; j<=m; j++) U[i][j]=(A[i-1][j]=='#'?i:U[i-1][j]);
	for (int i=n; i; i--) for (int j=1; j<=m; j++) D[i][j]=(A[i+1][j]=='#'?i:D[i+1][j]);
	
	memset(dist1, 31, sizeof(dist1));
	memset(dist2, 31, sizeof(dist2));
	for (int i=0; i<N; i++) for (int j=0; j<N; j++) if (A[i][j]=='#'){
		dist1[i][j]=-1;
		Q.push({i, j});
	}
	while (Q.size()){
		int x=Q.front().first, y=Q.front().second;
		Q.pop();
		mark[x][y]=0;
		upd(x-1, y, dist1[x][y]+1);
		upd(x+1, y, dist1[x][y]+1);
		upd(x, y-1, dist1[x][y]+1);
		upd(x, y+1, dist1[x][y]+1);
	}
	swap(dist1, dist2);
	
	for (int i=1; i<=n; i++) for (int j=1; j<=m; j++) if (A[i][j]=='S') upd(i, j, 0);
	while (Q.size()){
		int x=Q.front().first, y=Q.front().second;
		Q.pop();
		mark[x][y]=0;
		upd(x-1, y, dist1[x][y]+1);
		upd(x+1, y, dist1[x][y]+1);
		upd(x, y-1, dist1[x][y]+1);
		upd(x, y+1, dist1[x][y]+1);
		upd(U[x][y], y, dist1[x][y]+dist2[x][y]+1);
		upd(D[x][y], y, dist1[x][y]+dist2[x][y]+1);
		upd(x, L[x][y], dist1[x][y]+dist2[x][y]+1);
		upd(x, R[x][y], dist1[x][y]+dist2[x][y]+1);
	}
	for (int i=1; i<=n; i++) for (int j=1; j<=m; j++) if (A[i][j]=='C') cout<<dist1[i][j]<<'\n';
	
	
	return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 19 / 19
• Subtask 5: 30 / 30