oj.uz

Submission #118416

# Submission time Handle Problem Language Result Execution time Memory
118416 2019-06-19T02:21:05 Z kig9981 None (JOI16_skating) C++17
78 / 100
 3000 ms 71424 KB 
#include <bits/stdc++.h>

#ifdef NON_SUBMIT
#define TEST(n) (n)
#define tout cerr
#else
#define TEST(n) ((void)0)
#define tout cin
#endif

using namespace std;

int D[1000][1000][4], dist[1000][1000];
vector<string> F;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(NULL); cout.tie(NULL);
	TEST(freopen("input.txt","r",stdin));
	TEST(freopen("output.txt","w",stdout));
	TEST(freopen("debug.txt","w",stderr));
	int N, M, x, y;
	priority_queue<tuple<int,int,int>> Q;
	cin>>N>>M;
	F.resize(N);
	for(int i=0;i<N;i++) cin>>F[i];
	for(int i=0;i<N;i++) {
		D[i][M-1][1]=M-1;
		for(int j=1;j<M;j++) D[i][j][0]=F[i][j-1]=='.' ? D[i][j-1][0]:j;
		for(int j=M-2;j>=0;j--) D[i][j][1]=F[i][j+1]=='.' ? D[i][j+1][1]:j;
	}
	for(int j=0;j<M;j++) {
		D[N-1][j][3]=N-1;
		for(int i=1;i<N;i++) D[i][j][2]=F[i-1][j]=='.' ? D[i-1][j][2]:i;
		for(int i=N-2;i>=0;i--) D[i][j][3]=F[i+1][j]=='.' ? D[i+1][j][3]:i;
	}
	cin>>x>>y;
	memset(dist,0x7f,sizeof(dist));
	dist[--x][--y]=0;
	Q.emplace(0,x,y);
	while(!Q.empty()) {
		auto[t,x,y]=Q.top();
		Q.pop();
		if(-t!=dist[x][y]) continue;
		for(int i=D[x][y][0];i<=D[x][y][1];i++) if(dist[x][i]>dist[x][y]+min(2*abs(y-i),1+2*min(i-D[x][y][0],D[x][y][1]-i))) {
			dist[x][i]=dist[x][y]+min(2*abs(y-i),1+2*min(i-D[x][y][0],D[x][y][1]-i));
			Q.emplace(-dist[x][i],x,i);
		}
		for(int i=D[x][y][2];i<=D[x][y][3];i++) if(dist[i][y]>dist[x][y]+min(2*abs(x-i),1+2*min(i-D[x][y][2],D[x][y][3]-i))) {
			dist[i][y]=dist[x][y]+min(2*abs(x-i),1+2*min(i-D[x][y][2],D[x][y][3]-i));
			Q.emplace(-dist[i][y],i,y);
		}
	}
	cin>>x>>y;
	cout<<(dist[--x][--y]==0x7f7f7f7f ? -1:dist[x][y])<<'\n';
	return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4352 KB Output is correct
2 Correct 4 ms 4352 KB Output is correct
3 Correct 5 ms 4224 KB Output is correct
4 Correct 5 ms 4352 KB Output is correct
5 Correct 5 ms 4224 KB Output is correct
6 Correct 5 ms 4352 KB Output is correct
7 Correct 5 ms 4352 KB Output is correct
8 Correct 5 ms 4224 KB Output is correct
9 Correct 5 ms 4352 KB Output is correct
10 Correct 6 ms 4352 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4352 KB Output is correct
2 Correct 4 ms 4352 KB Output is correct
3 Correct 5 ms 4224 KB Output is correct
4 Correct 5 ms 4352 KB Output is correct
5 Correct 5 ms 4224 KB Output is correct
6 Correct 5 ms 4352 KB Output is correct
7 Correct 5 ms 4352 KB Output is correct
8 Correct 5 ms 4224 KB Output is correct
9 Correct 5 ms 4352 KB Output is correct
10 Correct 6 ms 4352 KB Output is correct
11 Correct 62 ms 6652 KB Output is correct
12 Correct 66 ms 7544 KB Output is correct
13 Correct 45 ms 7416 KB Output is correct
14 Correct 15 ms 5880 KB Output is correct
15 Correct 8 ms 5760 KB Output is correct
16 Correct 32 ms 6652 KB Output is correct
17 Correct 15 ms 5760 KB Output is correct
18 Correct 11 ms 5760 KB Output is correct
19 Correct 19 ms 5888 KB Output is correct
20 Correct 50 ms 6208 KB Output is correct
21 Correct 7 ms 5760 KB Output is correct
22 Correct 12 ms 5760 KB Output is correct
23 Correct 12 ms 5760 KB Output is correct
24 Correct 27 ms 6336 KB Output is correct
25 Correct 10 ms 5760 KB Output is correct
26 Correct 12 ms 5760 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4352 KB Output is correct
2 Correct 4 ms 4352 KB Output is correct
3 Correct 5 ms 4224 KB Output is correct
4 Correct 5 ms 4352 KB Output is correct
5 Correct 5 ms 4224 KB Output is correct
6 Correct 5 ms 4352 KB Output is correct
7 Correct 5 ms 4352 KB Output is correct
8 Correct 5 ms 4224 KB Output is correct
9 Correct 5 ms 4352 KB Output is correct
10 Correct 6 ms 4352 KB Output is correct
11 Correct 62 ms 6652 KB Output is correct
12 Correct 66 ms 7544 KB Output is correct
13 Correct 45 ms 7416 KB Output is correct
14 Correct 15 ms 5880 KB Output is correct
15 Correct 8 ms 5760 KB Output is correct
16 Correct 32 ms 6652 KB Output is correct
17 Correct 15 ms 5760 KB Output is correct
18 Correct 11 ms 5760 KB Output is correct
19 Correct 19 ms 5888 KB Output is correct
20 Correct 50 ms 6208 KB Output is correct
21 Correct 7 ms 5760 KB Output is correct
22 Correct 12 ms 5760 KB Output is correct
23 Correct 12 ms 5760 KB Output is correct
24 Correct 27 ms 6336 KB Output is correct
25 Correct 10 ms 5760 KB Output is correct
26 Correct 12 ms 5760 KB Output is correct
27 Execution timed out 3097 ms 71424 KB Time limit exceeded
28 Halted 0 ms 0 KB -