oj.uz

Submission #735611

# Submission time Handle Problem Language Result Execution time Memory
735611 2023-05-04T11:57:36 Z josanneo22 Portals (BOI14_portals) C++17
70 / 100
 1000 ms 146156 KB 
#include<bits/stdc++.h>
using namespace std;
 
#define int long long
#define mp make_pair
#define fi first
#define se second

const int maxn=1005;
int a[maxn][maxn],ans[maxn][maxn],up[maxn][maxn],dw[maxn][maxn],rt[maxn][maxn],lf[maxn][maxn];
int n,m,sx,sy,ex,ey;
int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};

struct e{
	int x,y,dist;
};
class comp {
public:
    bool operator()(e f,e s)
    {
		return f.dist>s.dist;
    }
};
bool valid(int x,int y){
	if(x>=0 && x<=n-1 && y>=0 && y<=m-1 && a[x][y]==1) return true;
	else return false;
}
void init(){
	for (int i=0; i<n; i++)  
        for (int j=0; j<m; j++) 
			ans[i][j]=1e9;
	for (int i=0; i<n; i++) {
        int pre = 0;
        for (int j=0; j<m; j++) {
            if(a[i][j]==0) pre = j+1;
            lf[i][j] = pre;
        }
    }
    for (int i=0; i<n; i++) {
        int pre = m-1;
        for (int j=m-1; j>=0; j--) {
            if(a[i][j] ==0) pre = j-1;
            rt[i][j] = pre;
        }
    }
    for (int j=0; j<m; j++) {
        int pre = 0;
        for (int i=0; i<n; i++) {
            if(a[i][j] == 0) pre = i+1;
            up[i][j] = pre;
        }
    }
    for (int j=0; j<m; j++) {
        int pre = n-1;
        for (int i=n-1; i>=0; i--) {
            if(a[i][j] == 0) pre = i-1;
            dw[i][j] = pre;
        }
    }
}
signed main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin>>n>>m;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			char x; cin>>x;
			if(x=='#') a[i][j]=0;
			else a[i][j]=1;

			if(x=='S') {sx=i;sy=j;}
			if(x=='C') {ex=i;ey=j;}
		}
	}
	init();
	priority_queue<e,vector<e>,comp> pq;
	pq.push({sx,sy,0});
	while(pq.size()){
		e u=pq.top(); pq.pop();
		if(ans[u.x][u.y]<=u.dist) continue;
		if(u.x==ex && u.y==ey){
			cout<<u.dist<<'\n';
			return 0;
		}
		ans[u.x][u.y]=u.dist;
		for(int i=0;i<4;i++){
			if(valid(u.x+dx[i],u.y+dy[i])) 
			pq.push({u.x+dx[i],u.y+dy[i],u.dist+1});
		}
		//找到最靠近的传送门
		int mn=min({abs(u.x-up[u.x][u.y]),
					abs(u.x-dw[u.x][u.y]),
					abs(u.y-rt[u.x][u.y]),
					abs(u.y-lf[u.x][u.y])
				});
		//往上下左右发射，走mn个步就可以到那里然后tp就要+1
		if(valid(u.x,rt[u.x][u.y])) pq.push({u.x,rt[u.x][u.y],u.dist+mn+1});
		if(valid(u.x,lf[u.x][u.y])) pq.push({u.x,lf[u.x][u.y],u.dist+mn+1});
		if(valid(up[u.x][u.y],u.y)) pq.push({up[u.x][u.y],u.y,u.dist+mn+1});
		if(valid(dw[u.x][u.y],u.y)) pq.push({dw[u.x][u.y],u.y,u.dist+mn+1});
	}
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 0 ms 596 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 0 ms 340 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 596 KB Output is correct
9 Correct 2 ms 1940 KB Output is correct
10 Correct 2 ms 1876 KB Output is correct
11 Correct 1 ms 1620 KB Output is correct
12 Correct 2 ms 1620 KB Output is correct
13 Correct 2 ms 1620 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 1748 KB Output is correct
16 Correct 0 ms 340 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 11 ms 6996 KB Output is correct
6 Correct 15 ms 7124 KB Output is correct
7 Correct 12 ms 7124 KB Output is correct
8 Correct 10 ms 7040 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 0 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 2 ms 1940 KB Output is correct
10 Correct 2 ms 1876 KB Output is correct
11 Correct 2 ms 1636 KB Output is correct
12 Correct 2 ms 1620 KB Output is correct
13 Correct 2 ms 1620 KB Output is correct
14 Correct 11 ms 7048 KB Output is correct
15 Correct 16 ms 7124 KB Output is correct
16 Correct 14 ms 7124 KB Output is correct
17 Correct 15 ms 7124 KB Output is correct
18 Correct 19 ms 7444 KB Output is correct
19 Correct 5 ms 7272 KB Output is correct
20 Correct 18 ms 10184 KB Output is correct
21 Correct 12 ms 7048 KB Output is correct
22 Correct 12 ms 7064 KB Output is correct
23 Correct 16 ms 6996 KB Output is correct
24 Correct 39 ms 8652 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 2 ms 1748 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 11 ms 6996 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 0 ms 596 KB Output is correct
8 Correct 0 ms 596 KB Output is correct
9 Correct 2 ms 1940 KB Output is correct
10 Correct 2 ms 1964 KB Output is correct
11 Correct 1 ms 1620 KB Output is correct
12 Correct 2 ms 1620 KB Output is correct
13 Correct 2 ms 1620 KB Output is correct
14 Correct 12 ms 7060 KB Output is correct
15 Correct 15 ms 7116 KB Output is correct
16 Correct 12 ms 7124 KB Output is correct
17 Correct 15 ms 7116 KB Output is correct
18 Correct 18 ms 7444 KB Output is correct
19 Correct 5 ms 7316 KB Output is correct
20 Correct 18 ms 10184 KB Output is correct
21 Correct 12 ms 7048 KB Output is correct
22 Correct 12 ms 6996 KB Output is correct
23 Correct 14 ms 7124 KB Output is correct
24 Correct 526 ms 49136 KB Output is correct
25 Execution timed out 1075 ms 146156 KB Time limit exceeded
26 Halted 0 ms 0 KB -