제출 #897989

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
897989		pan	과수원 (NOI14_orchard)	C++17	25 / 25	212 ms	23900 KiB

orchard

#include <bits/stdc++.h>
//#include "bits_stdc++.h"
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#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;
using namespace std;
typedef long long ll;
vector<vector<ll > > table;

int main()
{
	ll n, m;
	ll counter=0;
	ll ans = LLONG_MAX;
	bool gay;
	cin >> n >> m;
	table.assign(n+1, vector<ll> (m+1, 0));
	for (ll i=1; i<=n; ++i)
	{
		for (ll j=1; j<=m; ++j)
		{
			cin >> gay;
			if (gay) {counter++; table[i][j] = -1;}
			else {table[i][j] = 1;}
			table[i][j] += table[i-1][j] + table[i][j-1] - table[i-1][j-1];
		}
	}
	for (ll i=1; i<=n; ++i)
	{
		ll best[n+1];
		for (ll x=1; x<=n; ++x) best[x]=-LLONG_MAX;
		for (ll j=1; j<=m; ++j)
		{
			ll maxx = 0;
			for (ll k=1; k<=i; ++k)
			{
				if (j!=1) best[k]-=table[k-1][j-1] - table[k-1][j];
				best[k] = max(best[k],  table[k-1][j] + table[i][j-1]-table[k-1][j-1] );
				maxx=max(best[k],maxx);
			}
			ans = min(ans, table[i][j]-maxx);
		}
	}
	cout << counter + ans << endl;
	
	return 0;
}

• Subtask 1: 4 / 4
• Subtask 2: 4 / 4
• Subtask 3: 5 / 5
• Subtask 4: 3 / 3
• Subtask 5: 4 / 4
• Subtask 6: 5 / 5