제출 #1158522

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1158522		pan	Zemljište (COCI22_zemljiste)	C++20	30 / 70	2091 ms	2444 KiB

Main

#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")
//#pragma GCC target("popcnt")
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<pi, ll> pii;
typedef pair<pi, pi> piii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

ll dp[505][505];

inline ll cal(ll x1, ll y1, ll x2, ll y2)
{
	return dp[x2][y2] - dp[x1-1][y2] - dp[x2][y1-1] + dp[x1-1][y1-1];
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	ll r, c, a, b;
	cin >> r >> c >> a >> b;
	for (ll i=1; i<=r; ++i) for (ll j=1; j<=c; ++j) 
	{
		cin >> dp[i][j];
		dp[i][j] += dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1];
	}
	ll ans = LLONG_MAX;
	for (ll i=1; i<=r; ++i) for (ll j=1; j<=c; ++j) for (ll k=1; k<=j; ++k)
	{
		ll lo = 1, hi = r;
		while (lo!=hi)
		{
			ll mid = (lo + hi + 1) >> 1;
			if (cal(mid, k, i, j) >= a) lo = mid;
			else hi = mid-1;
		}
		ll v = cal(lo, k, i, j);
		ans = min(ans, abs(v-a) + abs(v-b));
		lo = 1, hi = r;
		while (lo!=hi)
		{
			ll mid = (lo + hi) >> 1;
			if (cal(mid, k, i, j) <= b) hi = mid;
			else lo = mid + 1;
		}
		v = cal(lo, k, i, j);
		ans = min(ans, abs(v-a) + abs(v-b));
	}
	cout << ans << endl;//
	return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 0 / 40