oj.uz

Submission #118422

# Submission time Handle Problem Language Result Execution time Memory
118422 2019-06-19T02:52:59 Z kig9981 None (JOI16_skating) C++17
100 / 100
 236 ms 22264 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;

const int dx[]={-1,1,0,0}, dy[]={0,0,-1,1};
int N, M, D[1000][1000][4], dist[1000][1000];
vector<string> F;

bool valid_coord(int x, int y)
{
	return 0<=x && x<N && 0<=y && y<M && F[x][y]=='.';
}

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 x, y;
	queue<pair<int,int>> Q[4];
	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[0].emplace(x,y);
	for(int t=0;Q[t&3].size();t++) while(!Q[t&3].empty()) {
		auto[x,y]=Q[t&3].front();
		Q[t&3].pop();
		if(t!=dist[x][y]) continue;
		for(int k=0;k<4;k++) if(valid_coord(x+dx[k],y+dy[k]) && dist[x+dx[k]][y+dy[k]]>dist[x][y]+2) {
			dist[x+dx[k]][y+dy[k]]=dist[x][y]+2;
			Q[(t+2)&3].emplace(x+dx[k],y+dy[k]);
		}
		if(dist[x][D[x][y][0]]>dist[x][y]+1) {
			dist[x][D[x][y][0]]=dist[x][y]+1;
			Q[(t+1)&3].emplace(x,D[x][y][0]);
		}
		if(dist[x][D[x][y][1]]>dist[x][y]+1) {
			dist[x][D[x][y][1]]=dist[x][y]+1;
			Q[(t+1)&3].emplace(x,D[x][y][1]);
		}
		if(dist[D[x][y][2]][y]>dist[x][y]+1) {
			dist[D[x][y][2]][y]=dist[x][y]+1;
			Q[(t+1)&3].emplace(D[x][y][2],y);
		}
		if(dist[D[x][y][3]][y]>dist[x][y]+1) {
			dist[D[x][y][3]][y]=dist[x][y]+1;
			Q[(t+1)&3].emplace(D[x][y][3],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 4224 KB Output is correct
2 Correct 6 ms 4352 KB Output is correct
3 Correct 5 ms 4352 KB Output is correct
4 Correct 5 ms 4352 KB Output is correct
5 Correct 5 ms 4352 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 4224 KB Output is correct
10 Correct 5 ms 4352 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4224 KB Output is correct
2 Correct 6 ms 4352 KB Output is correct
3 Correct 5 ms 4352 KB Output is correct
4 Correct 5 ms 4352 KB Output is correct
5 Correct 5 ms 4352 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 4224 KB Output is correct
10 Correct 5 ms 4352 KB Output is correct
11 Correct 8 ms 5744 KB Output is correct
12 Correct 9 ms 5760 KB Output is correct
13 Correct 9 ms 5760 KB Output is correct
14 Correct 9 ms 5760 KB Output is correct
15 Correct 7 ms 5760 KB Output is correct
16 Correct 9 ms 5760 KB Output is correct
17 Correct 9 ms 5760 KB Output is correct
18 Correct 9 ms 5760 KB Output is correct
19 Correct 9 ms 5760 KB Output is correct
20 Correct 8 ms 5632 KB Output is correct
21 Correct 8 ms 5760 KB Output is correct
22 Correct 9 ms 5632 KB Output is correct
23 Correct 9 ms 5760 KB Output is correct
24 Correct 9 ms 5760 KB Output is correct
25 Correct 8 ms 5760 KB Output is correct
26 Correct 9 ms 5760 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4224 KB Output is correct
2 Correct 6 ms 4352 KB Output is correct
3 Correct 5 ms 4352 KB Output is correct
4 Correct 5 ms 4352 KB Output is correct
5 Correct 5 ms 4352 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 4224 KB Output is correct
10 Correct 5 ms 4352 KB Output is correct
11 Correct 8 ms 5744 KB Output is correct
12 Correct 9 ms 5760 KB Output is correct
13 Correct 9 ms 5760 KB Output is correct
14 Correct 9 ms 5760 KB Output is correct
15 Correct 7 ms 5760 KB Output is correct
16 Correct 9 ms 5760 KB Output is correct
17 Correct 9 ms 5760 KB Output is correct
18 Correct 9 ms 5760 KB Output is correct
19 Correct 9 ms 5760 KB Output is correct
20 Correct 8 ms 5632 KB Output is correct
21 Correct 8 ms 5760 KB Output is correct
22 Correct 9 ms 5632 KB Output is correct
23 Correct 9 ms 5760 KB Output is correct
24 Correct 9 ms 5760 KB Output is correct
25 Correct 8 ms 5760 KB Output is correct
26 Correct 9 ms 5760 KB Output is correct
27 Correct 123 ms 21140 KB Output is correct
28 Correct 165 ms 21372 KB Output is correct
29 Correct 236 ms 22264 KB Output is correct
30 Correct 121 ms 21368 KB Output is correct
31 Correct 50 ms 21112 KB Output is correct
32 Correct 132 ms 21212 KB Output is correct
33 Correct 27 ms 10624 KB Output is correct
34 Correct 59 ms 21112 KB Output is correct
35 Correct 101 ms 21180 KB Output is correct
36 Correct 94 ms 21240 KB Output is correct
37 Correct 62 ms 21140 KB Output is correct
38 Correct 206 ms 21624 KB Output is correct
39 Correct 89 ms 21240 KB Output is correct
40 Correct 48 ms 21024 KB Output is correct