제출 #1148197

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1148197		monkey133	Soccer (JOI17_soccer)	C++20	100 / 100	329 ms	23812 KiB

soccer

#include <bits/stdc++.h>
//#include "includeall.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i) 
#define RFOR(i, x, n) for (ll i =x; i>=n; --i) 
#pragma GCC optimize("O3","unroll-loops")
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
typedef pair<pi, pi> piii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

ll const INF = 1e15;
ll n, h, w, a, b, c;
ll posx[100005], posy[100005];
ll dx[4] = {1, -1, 0, 0};
ll dy[4] = {0, 0, 1, -1};
ll dist[505][505], ans[505][505][5];

void solve()
{
	cin >> h >> w >> a >> b >> c >> n;
	for (ll i=0; i<=h; ++i) for (ll j=0; j<=w; ++j) dist[i][j] = INF;
	for (ll i=0; i<=h; ++i) for (ll j=0; j<=w; ++j) for (ll k=0; k<3; ++k) ans[i][j][k] = INF;
	queue<pi> q;
	for (ll i=1; i<=n; ++i) 
	{
		cin >> posx[i] >> posy[i]; 
		dist[posx[i]][posy[i]] = 0;
		q.push(mp(posx[i], posy[i]));
	}
	while (q.size())
	{
		ll x = q.front().f, y = q.front().s;
		q.pop();
		for (ll i=0; i<4; ++i)
		{
			ll newx = x + dx[i], newy = y + dy[i];
			if (newx < 0 || newx > h || newy < 0 || newy > w) continue;
			if (dist[newx][newy] > dist[x][y] + 1)
			{
				dist[newx][newy] = dist[x][y] + 1;
				q.push(mp(newx, newy));
			}
		}
	}
	ans[posx[1]][posy[1]][0] = 0;
	priority_queue<piii, vector<piii> , greater<piii> > pq;
	pq.push(mp(mp(0, 0), mp(posx[1], posy[1])));
	while (pq.size())
	{
		ll x = pq.top().s.f, y = pq.top().s.s, t = pq.top().f.s, d = pq.top().f.f;
		pq.pop();
		if (ans[x][y][t] < d) continue;
		//show3(x, y, t);
		//show(ans[x][y][t]);
		if (ans[x][y][0] > ans[x][y][t] + dist[x][y]*c)
		{
			ans[x][y][0] = ans[x][y][t] + dist[x][y]*c;
			pq.push(mp(mp(ans[x][y][0], 0), mp(x, y)));
		}
		for (ll i=0; i<4; ++i)
		{
			ll newx = x + dx[i], newy = y + dy[i];
			if (newx < 0 || newx > h || newy < 0 || newy > w) continue;
			// 0 - ppl
			if (t==0)
			{
				ll v = c;
				if (ans[newx][newy][0] > d + v) 
				{
					ans[newx][newy][0] = d + v;
					pq.push(mp(mp(d + v, 0), mp(newx, newy)));
				}
			}
			if (i < 2 && t!=2) // 1
			{
				ll v = a;
				if (t == 0) v += b;
				if (ans[newx][newy][1] > d + v) 
				{
					ans[newx][newy][1] = d + v;
					pq.push(mp(mp(d + v, 1), mp(newx, newy)));
				}
			}
			else if (i >= 2 && t!=1) // 2
			{
				ll v = a;
				if (t == 0) v += b;
				if (ans[newx][newy][2] > d + v) 
				{
					ans[newx][newy][2] = d + v;
					pq.push(mp(mp(d + v, 2), mp(newx, newy)));
				}
			}
		}
	}
	cout << *min_element(ans[posx[n]][posy[n]], ans[posx[n]][posy[n]] + 3) << endl;
}

int main()
{
	ll t = 1;
	while (t--) solve();
	return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 30 / 30
• Subtask 3: 65 / 65