提出 #60749137

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
#define fastio cin.tie(0)->sync_with_stdio(0)
#define fi first
#define se second
#define nm (nl + nr >> 1)
#define xm (xl + xr >> 1)
#define pb(x) push_back(x)
#define all(v) (v).begin(), (v).end()
#define zip(v) (v).erase(unique(all(v)), (v).end())
#define dem_plc(x) cout << fixed << setprecision(x)
#define ox(t) cout << ((t) ? "YES" : "NO") << '\n'
#define continue(x) { cout << (x) << '\n'; continue; }
#define _exit(x) return cout << x, 0
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<pii, int> ppi;
typedef pair<int, pii> pip;
typedef pair<pll, ll> ppl;
typedef pair<ll, pll> plp;
const ll mod = 1e9 + 7; // 998244353
const ll INF = 2e9;
const ll LINF = 4e18;
const db PI = acos(-1);
const int N = 502;

int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};

// templete end

ll a[N][N];

int main()
{
	fastio;
	int n, m; ll xx; cin >> n >> m >> xx;
	int sx, sy; cin >> sx >> sy;
	for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) cin >> a[i][j];
	
	ll val = a[sx][sy]; a[sx][sy] = 0;
	priority_queue<pair<ll, pair<int, int>>> pq;
	for (int d = 0; d < 4; d++) {
		int x = sx + dx[d], y = sy + dy[d];
		if (a[x][y]) pq.push({-a[x][y], {x, y}}), a[x][y] = 0;
	}
	while (pq.size()) {
		auto [w, xy] = pq.top(); auto [x, y] = xy; pq.pop();
		w *= -1;
		if (w >= (val + xx - 1) / xx) break;
		val += w;
		for (int d = 0; d < 4; d++) {
			int nx = x + dx[d], ny = y + dy[d];
			if (a[nx][ny]) pq.push({-a[nx][ny], {nx, ny}}), a[nx][ny] = 0;
		}
	}
	cout << val << '\n';
}

提出情報

ジャッジ結果