oj.uz

Submission #143780

# Submission time Handle Problem Language Result Execution time Memory
143780 2019-08-15T05:08:09 Z cheetose None (JOI16_skating) C++11
100 / 100
 988 ms 119720 KB 
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

int n,m;
char s[1000][1002];
inline int z(int x,int y){return x*m+y;}
VPi v[1000000];
int dist[1000000];
bool chk[1000000];
int main() {
	fill(dist,dist+1000000,INF);
	scanf("%d%d",&n,&m);
	fup(i,0,n-1,1)scanf("%s",s[i]);
	int x1,y1,x2,y2;
	scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
	x1--,y1--,x2--,y2--;
	fup(x,1,n-2,1)
	{
		fup(y,1,m-2,1)
		{
			fup(i,0,3,1)
			{
				int nx=x+dx[i],ny=y+dy[i];
				if(nx>=0 && nx<n && ny>=0 && ny<m && s[nx][ny]=='.')v[z(x,y)].pb(mp(z(nx,ny),2));
			}
		}
	}
	fup(i,1,n-2,1)
	{
		int t=0;
		fup(j,1,m-2,1)
		{
			if(s[i][j]=='#')t=j;
			else
			{
				v[z(i,j)].pb(mp(z(i,t+1),1));
			}
		}
		t=m-1;
		fdn(j,m-2,1,1)
		{
			if(s[i][j]=='#')t=j;
			else
			{
				v[z(i,j)].pb(mp(z(i,t-1),1));
			}
		}
	}
	fup(j,1,m-2,1)
	{
		int t=0;
		fup(i,1,n-2,1)
		{
			if(s[i][j]=='#')t=i;
			else
			{
				v[z(i,j)].pb(mp(z(t+1,j),1));
			}
		}
		t=n-1;
		fdn(i,n-2,1,1)
		{
			if(s[i][j]=='#')t=i;
			else
			{
				v[z(i,j)].pb(mp(z(t-1,j),1));
			}
		}
	}
	priority_queue<Pi> q;
	dist[z(x1,y1)] = 0;
	q.push({ 0,z(x1,y1) });
	while (!q.empty())
	{
		int x = q.top().Y;
		q.pop();
		if (chk[x])continue;
		chk[x] = 1;
		for (const auto& p : v[x])
		{
			int next = p.X, cost = p.Y;
			if (dist[next] > dist[x]+cost)
			{
				dist[next] = dist[x] + cost;
				q.push({ -dist[next],next });
			}
		}
	}
	int ans=dist[z(x2,y2)];
	if(ans==INF)ans=-1;
	printf("%d",ans);
}

Compilation message

skating.cpp: In function 'int main()':
skating.cpp:71: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:72:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  fup(i,0,n-1,1)scanf("%s",s[i]);
                ~~~~~^~~~~~~~~~~
skating.cpp:74:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 27768 KB Output is correct
2 Correct 27 ms 27768 KB Output is correct
3 Correct 27 ms 27768 KB Output is correct
4 Correct 27 ms 27768 KB Output is correct
5 Correct 27 ms 27896 KB Output is correct
6 Correct 27 ms 27768 KB Output is correct
7 Correct 27 ms 27768 KB Output is correct
8 Correct 28 ms 27768 KB Output is correct
9 Correct 27 ms 27768 KB Output is correct
10 Correct 27 ms 27768 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 27768 KB Output is correct
2 Correct 27 ms 27768 KB Output is correct
3 Correct 27 ms 27768 KB Output is correct
4 Correct 27 ms 27768 KB Output is correct
5 Correct 27 ms 27896 KB Output is correct
6 Correct 27 ms 27768 KB Output is correct
7 Correct 27 ms 27768 KB Output is correct
8 Correct 28 ms 27768 KB Output is correct
9 Correct 27 ms 27768 KB Output is correct
10 Correct 27 ms 27768 KB Output is correct
11 Correct 50 ms 31148 KB Output is correct
12 Correct 49 ms 31096 KB Output is correct
13 Correct 50 ms 31224 KB Output is correct
14 Correct 50 ms 31096 KB Output is correct
15 Correct 43 ms 30584 KB Output is correct
16 Correct 49 ms 31196 KB Output is correct
17 Correct 47 ms 30968 KB Output is correct
18 Correct 46 ms 30968 KB Output is correct
19 Correct 47 ms 30968 KB Output is correct
20 Correct 46 ms 30968 KB Output is correct
21 Correct 45 ms 31636 KB Output is correct
22 Correct 38 ms 29608 KB Output is correct
23 Correct 50 ms 30968 KB Output is correct
24 Correct 48 ms 31096 KB Output is correct
25 Correct 48 ms 30968 KB Output is correct
26 Correct 47 ms 30968 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 27768 KB Output is correct
2 Correct 27 ms 27768 KB Output is correct
3 Correct 27 ms 27768 KB Output is correct
4 Correct 27 ms 27768 KB Output is correct
5 Correct 27 ms 27896 KB Output is correct
6 Correct 27 ms 27768 KB Output is correct
7 Correct 27 ms 27768 KB Output is correct
8 Correct 28 ms 27768 KB Output is correct
9 Correct 27 ms 27768 KB Output is correct
10 Correct 27 ms 27768 KB Output is correct
11 Correct 50 ms 31148 KB Output is correct
12 Correct 49 ms 31096 KB Output is correct
13 Correct 50 ms 31224 KB Output is correct
14 Correct 50 ms 31096 KB Output is correct
15 Correct 43 ms 30584 KB Output is correct
16 Correct 49 ms 31196 KB Output is correct
17 Correct 47 ms 30968 KB Output is correct
18 Correct 46 ms 30968 KB Output is correct
19 Correct 47 ms 30968 KB Output is correct
20 Correct 46 ms 30968 KB Output is correct
21 Correct 45 ms 31636 KB Output is correct
22 Correct 38 ms 29608 KB Output is correct
23 Correct 50 ms 30968 KB Output is correct
24 Correct 48 ms 31096 KB Output is correct
25 Correct 48 ms 30968 KB Output is correct
26 Correct 47 ms 30968 KB Output is correct
27 Correct 880 ms 109236 KB Output is correct
28 Correct 940 ms 109476 KB Output is correct
29 Correct 988 ms 110448 KB Output is correct
30 Correct 898 ms 110836 KB Output is correct
31 Correct 551 ms 94712 KB Output is correct
32 Correct 822 ms 108792 KB Output is correct
33 Correct 212 ms 47684 KB Output is correct
34 Correct 636 ms 106476 KB Output is correct
35 Correct 952 ms 108664 KB Output is correct
36 Correct 758 ms 107996 KB Output is correct
37 Correct 631 ms 105208 KB Output is correct
38 Correct 981 ms 109476 KB Output is correct
39 Correct 695 ms 119720 KB Output is correct
40 Correct 311 ms 73268 KB Output is correct