oj.uz

Submission #199589

# Submission time Handle Problem Language Result Execution time Memory
199589 2020-02-02T05:54:57 Z arnold518 None (JOI16_skating) C++14
100 / 100
 796 ms 30308 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1000;
const int INF = 987654321;

struct Queue
{
	int y, x, p, d;
	bool operator < (const Queue &p) const { return d>p.d; }
};

int N, M, SY, SX, EY, EX;
char S[MAXN+10][MAXN+10];
int dist[MAXN+10][MAXN+10][2];
int U[MAXN+10][MAXN+10], D[MAXN+10][MAXN+10], L[MAXN+10][MAXN+10], R[MAXN+10][MAXN+10];

priority_queue<Queue> PQ;
void push(int y, int x, int p, int d)
{
	if(dist[y][x][p]>d) PQ.push({y, x, p, d}), dist[y][x][p]=d;
}

int main()
{
	int i, j;

	scanf("%d%d", &N, &M);
	for(i=1; i<=N; i++) scanf("%s", S[i]+1);
	scanf("%d%d%d%d", &SY, &SX, &EY, &EX);

	for(i=1; i<=N; i++) for(j=1; j<=M; j++)
	{
		if(S[i][j]=='#') U[i][j]=i, L[i][j]=j;
		else U[i][j]=U[i-1][j], L[i][j]=L[i][j-1];
	}
	for(i=N; i>=1; i--) for(j=M; j>=1; j--)
	{
		if(S[i][j]=='#') D[i][j]=i, R[i][j]=j;
		else D[i][j]=D[i+1][j], R[i][j]=R[i][j+1];
	}

	for(i=1; i<=N; i++) for(j=1; j<=M; j++) dist[i][j][0]=dist[i][j][1]=INF;

	push(SY, SX, 0, 0);
	push(SY, SX, 1, 0);
	while(!PQ.empty())
	{
		Queue T=PQ.top(); PQ.pop();
		if(dist[T.y][T.x][T.p]<T.d) continue;
		dist[T.y][T.x][T.p]=T.d;

		if(T.p==0)
		{
			int l, r;
			l=L[T.y][T.x]+1, r=R[T.y][T.x]-1;
			push(T.y, l, 0, T.d+1);
			push(T.y, r, 0, T.d+1);
			if(l<=T.x-1) push(T.y, T.x-1, 0, T.d+2);
			if(T.x+1<=r) push(T.y, T.x+1, 0, T.d+2);
			push(T.y, T.x, 1, T.d);
		}
		else
		{
			int l, r;
			l=U[T.y][T.x]+1, r=D[T.y][T.x]-1;
			push(l, T.x, 1, T.d+1);
			push(r, T.x, 1, T.d+1);
			if(l<=T.y-1) push(T.y-1, T.x, 1, T.d+2);
			if(T.y+1<=r) push(T.y+1, T.x, 1, T.d+2);
			push(T.y, T.x, 0, T.d);
		}
	}
	int ans=min(dist[EY][EX][1], dist[EY][EX][0]);
	if(ans==INF) printf("-1\n");
	else printf("%d\n", ans);
}

Compilation message

skating.cpp: In function 'int main()':
skating.cpp:32:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &M);
  ~~~~~^~~~~~~~~~~~~~~~
skating.cpp:33:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=1; i<=N; i++) scanf("%s", S[i]+1);
                      ~~~~~^~~~~~~~~~~~~~
skating.cpp:34:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d%d", &SY, &SX, &EY, &EX);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 760 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 6 ms 584 KB Output is correct
6 Correct 5 ms 632 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 6 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 6 ms 504 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 760 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 6 ms 584 KB Output is correct
6 Correct 5 ms 632 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 6 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 6 ms 504 KB Output is correct
11 Correct 17 ms 4856 KB Output is correct
12 Correct 20 ms 5160 KB Output is correct
13 Correct 22 ms 5240 KB Output is correct
14 Correct 16 ms 4856 KB Output is correct
15 Correct 9 ms 4728 KB Output is correct
16 Correct 20 ms 5240 KB Output is correct
17 Correct 16 ms 4856 KB Output is correct
18 Correct 13 ms 4856 KB Output is correct
19 Correct 16 ms 4856 KB Output is correct
20 Correct 21 ms 4600 KB Output is correct
21 Correct 11 ms 4856 KB Output is correct
22 Correct 8 ms 4856 KB Output is correct
23 Correct 15 ms 4856 KB Output is correct
24 Correct 17 ms 4904 KB Output is correct
25 Correct 13 ms 4756 KB Output is correct
26 Correct 14 ms 4856 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 760 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 6 ms 584 KB Output is correct
6 Correct 5 ms 632 KB Output is correct
7 Correct 5 ms 632 KB Output is correct
8 Correct 6 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 6 ms 504 KB Output is correct
11 Correct 17 ms 4856 KB Output is correct
12 Correct 20 ms 5160 KB Output is correct
13 Correct 22 ms 5240 KB Output is correct
14 Correct 16 ms 4856 KB Output is correct
15 Correct 9 ms 4728 KB Output is correct
16 Correct 20 ms 5240 KB Output is correct
17 Correct 16 ms 4856 KB Output is correct
18 Correct 13 ms 4856 KB Output is correct
19 Correct 16 ms 4856 KB Output is correct
20 Correct 21 ms 4600 KB Output is correct
21 Correct 11 ms 4856 KB Output is correct
22 Correct 8 ms 4856 KB Output is correct
23 Correct 15 ms 4856 KB Output is correct
24 Correct 17 ms 4904 KB Output is correct
25 Correct 13 ms 4756 KB Output is correct
26 Correct 14 ms 4856 KB Output is correct
27 Correct 633 ms 25716 KB Output is correct
28 Correct 691 ms 28268 KB Output is correct
29 Correct 796 ms 30308 KB Output is correct
30 Correct 417 ms 27248 KB Output is correct
31 Correct 37 ms 25976 KB Output is correct
32 Correct 363 ms 26104 KB Output is correct
33 Correct 81 ms 13048 KB Output is correct
34 Correct 118 ms 26104 KB Output is correct
35 Correct 380 ms 26740 KB Output is correct
36 Correct 232 ms 26360 KB Output is correct
37 Correct 80 ms 26104 KB Output is correct
38 Correct 744 ms 28264 KB Output is correct
39 Correct 83 ms 25976 KB Output is correct
40 Correct 49 ms 25976 KB Output is correct