oj.uz

답안 #159159

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
159159 2019-10-21T10:00:20 Z TadijaSebez Dangerous Skating (JOI16_skating) C++11
100 / 100
 1402 ms 209908 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int inf=1e9+7;
const int N=1050;
const int H=N*N*4;
int n,m;
int ID(int x, int y){ return (x-1)*m+y;}
vector<pair<int,int>> E[H];
int dist[H];
bool was[H];
char base[N][N];
int main()
{
	scanf("%i %i",&n,&m);
	for(int i=1;i<=n;i++) scanf("%s",base[i]+1);
	for(int i=1;i<=n;i++)
	{
		for(int j=1,k=1;j<=m;j++)
		{
			if(base[i][j]=='#') k=j+1;
			else E[ID(i,j)].pb({ID(i,k),1});
		}
		for(int j=m,k=m;j>=1;j--)
		{
			if(base[i][j]=='#') k=j-1;
			else E[ID(i,j)].pb({ID(i,k),1});
		}
	}
	for(int i=1;i<=m;i++)
	{
		for(int j=1,k=1;j<=n;j++)
		{
			if(base[j][i]=='#') k=j+1;
			else E[ID(j,i)].pb({ID(k,i),1});
		}
		for(int j=n,k=n;j>=1;j--)
		{
			if(base[j][i]=='#') k=j-1;
			else E[ID(j,i)].pb({ID(k,i),1});
		}
	}
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) if(base[i][j]=='.')
	{
		if(base[i][j-1]=='.') E[ID(i,j)].pb({ID(i,j-1),2});
		if(base[i][j+1]=='.') E[ID(i,j)].pb({ID(i,j+1),2});
		if(base[i-1][j]=='.') E[ID(i,j)].pb({ID(i-1,j),2});
		if(base[i+1][j]=='.') E[ID(i,j)].pb({ID(i+1,j),2});
	}
	int x,y,a,b;
	scanf("%i %i %i %i",&x,&y,&a,&b);
	if(x==a && y==b) return 0*printf("0\n");
	for(int i=0;i<H;i++) dist[i]=inf;
	priority_queue<pair<int,int>> pq;
	pq.push({0,ID(x,y)});
	dist[ID(x,y)]=0;
	while(pq.size())
	{
		int u,d;tie(d,u)=pq.top();d=-d;pq.pop();
		if(d!=dist[u]) continue;
		for(auto e:E[u])
		{
			int v,w;tie(v,w)=e;
			if(dist[v]>dist[u]+w)
			{
				dist[v]=dist[u]+w;
				pq.push({-dist[v],v});
			}
		}
	}
	int ans=dist[ID(a,b)];
	if(ans==inf) printf("-1\n");
	else printf("%i\n",ans);
	return 0;
}

Compilation message

skating.cpp: In function 'int main()':
skating.cpp:15:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i %i",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~
skating.cpp:16:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n;i++) scanf("%s",base[i]+1);
                        ~~~~~^~~~~~~~~~~~~~~~
skating.cpp:51:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i %i %i %i",&x,&y,&a,&b);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 112 ms 121080 KB Output is correct
2 Correct 112 ms 121192 KB Output is correct
3 Correct 112 ms 121204 KB Output is correct
4 Correct 112 ms 121208 KB Output is correct
5 Correct 112 ms 121212 KB Output is correct
6 Correct 112 ms 121288 KB Output is correct
7 Correct 112 ms 121128 KB Output is correct
8 Correct 111 ms 121240 KB Output is correct
9 Correct 95 ms 103928 KB Output is correct
10 Correct 112 ms 121080 KB Output is correct

Subtask #2
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 112 ms 121080 KB Output is correct
2 Correct 112 ms 121192 KB Output is correct
3 Correct 112 ms 121204 KB Output is correct
4 Correct 112 ms 121208 KB Output is correct
5 Correct 112 ms 121212 KB Output is correct
6 Correct 112 ms 121288 KB Output is correct
7 Correct 112 ms 121128 KB Output is correct
8 Correct 111 ms 121240 KB Output is correct
9 Correct 95 ms 103928 KB Output is correct
10 Correct 112 ms 121080 KB Output is correct
11 Correct 140 ms 124804 KB Output is correct
12 Correct 140 ms 124604 KB Output is correct
13 Correct 138 ms 124708 KB Output is correct
14 Correct 145 ms 123976 KB Output is correct
15 Correct 122 ms 123000 KB Output is correct
16 Correct 140 ms 124528 KB Output is correct
17 Correct 134 ms 123936 KB Output is correct
18 Correct 131 ms 123640 KB Output is correct
19 Correct 135 ms 124024 KB Output is correct
20 Correct 136 ms 124380 KB Output is correct
21 Correct 125 ms 123512 KB Output is correct
22 Correct 118 ms 122488 KB Output is correct
23 Correct 133 ms 123648 KB Output is correct
24 Correct 138 ms 124448 KB Output is correct
25 Correct 130 ms 123548 KB Output is correct
26 Correct 131 ms 123532 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 112 ms 121080 KB Output is correct
2 Correct 112 ms 121192 KB Output is correct
3 Correct 112 ms 121204 KB Output is correct
4 Correct 112 ms 121208 KB Output is correct
5 Correct 112 ms 121212 KB Output is correct
6 Correct 112 ms 121288 KB Output is correct
7 Correct 112 ms 121128 KB Output is correct
8 Correct 111 ms 121240 KB Output is correct
9 Correct 95 ms 103928 KB Output is correct
10 Correct 112 ms 121080 KB Output is correct
11 Correct 140 ms 124804 KB Output is correct
12 Correct 140 ms 124604 KB Output is correct
13 Correct 138 ms 124708 KB Output is correct
14 Correct 145 ms 123976 KB Output is correct
15 Correct 122 ms 123000 KB Output is correct
16 Correct 140 ms 124528 KB Output is correct
17 Correct 134 ms 123936 KB Output is correct
18 Correct 131 ms 123640 KB Output is correct
19 Correct 135 ms 124024 KB Output is correct
20 Correct 136 ms 124380 KB Output is correct
21 Correct 125 ms 123512 KB Output is correct
22 Correct 118 ms 122488 KB Output is correct
23 Correct 133 ms 123648 KB Output is correct
24 Correct 138 ms 124448 KB Output is correct
25 Correct 130 ms 123548 KB Output is correct
26 Correct 131 ms 123532 KB Output is correct
27 Correct 1108 ms 209184 KB Output is correct
28 Correct 1241 ms 209908 KB Output is correct
29 Correct 1402 ms 209216 KB Output is correct
30 Correct 1054 ms 199544 KB Output is correct
31 Correct 473 ms 164344 KB Output is correct
32 Correct 1100 ms 209324 KB Output is correct
33 Correct 268 ms 139256 KB Output is correct
34 Correct 770 ms 195724 KB Output is correct
35 Correct 985 ms 207500 KB Output is correct
36 Correct 872 ms 196224 KB Output is correct
37 Correct 644 ms 182412 KB Output is correct
38 Correct 1159 ms 208932 KB Output is correct
39 Correct 681 ms 179704 KB Output is correct
40 Correct 315 ms 150684 KB Output is correct