oj.uz

답안 #235696

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
235696 2020-05-29T12:05:52 Z alishahali1382 포탈들 (BOI14_portals) C++14
100 / 100
 216 ms 32760 KB 
#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.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 18696 KB Output is correct
2 Correct 33 ms 18952 KB Output is correct
3 Correct 35 ms 18856 KB Output is correct
4 Correct 34 ms 18824 KB Output is correct
5 Correct 35 ms 18824 KB Output is correct
6 Correct 34 ms 18824 KB Output is correct
7 Correct 39 ms 18824 KB Output is correct
8 Correct 34 ms 18832 KB Output is correct
9 Correct 34 ms 18824 KB Output is correct
10 Correct 34 ms 18704 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 18704 KB Output is correct
2 Correct 40 ms 18824 KB Output is correct
3 Correct 34 ms 18824 KB Output is correct
4 Correct 34 ms 18752 KB Output is correct
5 Correct 34 ms 18832 KB Output is correct
6 Correct 39 ms 18824 KB Output is correct
7 Correct 33 ms 18952 KB Output is correct
8 Correct 35 ms 18824 KB Output is correct
9 Correct 35 ms 19464 KB Output is correct
10 Correct 35 ms 19472 KB Output is correct
11 Correct 42 ms 19468 KB Output is correct
12 Correct 34 ms 19464 KB Output is correct
13 Correct 43 ms 19464 KB Output is correct
14 Correct 33 ms 18824 KB Output is correct
15 Correct 34 ms 19464 KB Output is correct
16 Correct 34 ms 18696 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 18696 KB Output is correct
2 Correct 34 ms 18832 KB Output is correct
3 Correct 33 ms 18832 KB Output is correct
4 Correct 34 ms 18952 KB Output is correct
5 Correct 39 ms 21768 KB Output is correct
6 Correct 39 ms 21640 KB Output is correct
7 Correct 38 ms 21640 KB Output is correct
8 Correct 37 ms 21776 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 18704 KB Output is correct
2 Correct 33 ms 18832 KB Output is correct
3 Correct 35 ms 18952 KB Output is correct
4 Correct 34 ms 18824 KB Output is correct
5 Correct 33 ms 18824 KB Output is correct
6 Correct 34 ms 18824 KB Output is correct
7 Correct 33 ms 18960 KB Output is correct
8 Correct 35 ms 18832 KB Output is correct
9 Correct 33 ms 19472 KB Output is correct
10 Correct 34 ms 19448 KB Output is correct
11 Correct 34 ms 19472 KB Output is correct
12 Correct 34 ms 19464 KB Output is correct
13 Correct 35 ms 19464 KB Output is correct
14 Correct 39 ms 21772 KB Output is correct
15 Correct 39 ms 21640 KB Output is correct
16 Correct 39 ms 21768 KB Output is correct
17 Correct 38 ms 21648 KB Output is correct
18 Correct 40 ms 21700 KB Output is correct
19 Correct 39 ms 21648 KB Output is correct
20 Correct 39 ms 21520 KB Output is correct
21 Correct 38 ms 21768 KB Output is correct
22 Correct 39 ms 21768 KB Output is correct
23 Correct 38 ms 21648 KB Output is correct
24 Correct 37 ms 21512 KB Output is correct
25 Correct 33 ms 18824 KB Output is correct
26 Correct 34 ms 19472 KB Output is correct
27 Correct 33 ms 18832 KB Output is correct
28 Correct 36 ms 21644 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 18704 KB Output is correct
2 Correct 34 ms 18832 KB Output is correct
3 Correct 33 ms 18824 KB Output is correct
4 Correct 33 ms 18824 KB Output is correct
5 Correct 33 ms 18960 KB Output is correct
6 Correct 33 ms 18832 KB Output is correct
7 Correct 33 ms 18824 KB Output is correct
8 Correct 33 ms 18824 KB Output is correct
9 Correct 34 ms 19464 KB Output is correct
10 Correct 34 ms 19464 KB Output is correct
11 Correct 34 ms 19464 KB Output is correct
12 Correct 35 ms 19464 KB Output is correct
13 Correct 34 ms 19464 KB Output is correct
14 Correct 38 ms 21768 KB Output is correct
15 Correct 38 ms 21644 KB Output is correct
16 Correct 39 ms 21640 KB Output is correct
17 Correct 37 ms 21640 KB Output is correct
18 Correct 39 ms 21640 KB Output is correct
19 Correct 39 ms 21512 KB Output is correct
20 Correct 39 ms 21512 KB Output is correct
21 Correct 38 ms 21776 KB Output is correct
22 Correct 38 ms 21776 KB Output is correct
23 Correct 39 ms 21640 KB Output is correct
24 Correct 143 ms 31224 KB Output is correct
25 Correct 216 ms 27384 KB Output is correct
26 Correct 170 ms 27384 KB Output is correct
27 Correct 169 ms 27264 KB Output is correct
28 Correct 131 ms 31984 KB Output is correct
29 Correct 131 ms 31992 KB Output is correct
30 Correct 147 ms 32120 KB Output is correct
31 Correct 37 ms 21512 KB Output is correct
32 Correct 122 ms 27260 KB Output is correct
33 Correct 33 ms 18824 KB Output is correct
34 Correct 34 ms 19516 KB Output is correct
35 Correct 122 ms 29312 KB Output is correct
36 Correct 35 ms 18824 KB Output is correct
37 Correct 37 ms 21640 KB Output is correct
38 Correct 87 ms 32760 KB Output is correct
39 Correct 88 ms 31480 KB Output is correct