제출 #1308136

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1308136		WeIlIaN	Nafta (COI15_nafta)	C++20	100 / 100	265 ms	155888 KiB

nafta

#include <bits/stdc++.h>
using namespace std;

#define MOD1 1000000007
#define MOD2 998244353
#define fir first
#define sec second

#define pushf push_front
#define pushb push_back
#define popf pop_front
#define popb pop_back
#define mp make_pair
#define all(a) a.begin(), a.end()
#define lbound(v, x) lower_bound(all(v), x) - v.begin()
#define ubound(v, x) upper_bound(all(v), x) - v.begin()
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)

#define FOR1(a) for (int _ = 0; _ < (a); ++_)
#define FOR2(i, a) for (int i = 0; i < (a); ++i)
#define FOR3(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR1(a) for (int _ = (a)-1; _ >= 0; --_)
#define RFOR2(i, a) for (int i = (a)-1; i >= 0; --i)
#define RFOR3(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define overload3(a, b, c, d, ...) d
// Always choose the fourth argument to call. Hence, which function to call is determined by the number of given arguments.
#define REP(...) overload3(__VA_ARGS__, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define RREP(...) overload3(__VA_ARGS__, RFOR3, RFOR2, RFOR1)(__VA_ARGS__)

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<vb> vvb;
typedef vector<vc> vvc;
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
typedef queue<int> qi;
typedef queue<ll> qll;
typedef queue<pii> qpii;
typedef queue<pll> qpll;
typedef deque<int> dqi;
typedef deque<ll> dqll;
typedef deque<pii> dqpii;
typedef deque<pll> dqpll;
typedef priority_queue<int> pqi;
typedef priority_queue<ll> pqll;
typedef priority_queue<pii> pqpii;
typedef priority_queue<pll> pqpll;
typedef priority_queue<int, vi, greater<int> > r_pqi;
typedef priority_queue<ll, vll, greater<ll> > r_pqll;
typedef priority_queue<pii, vpii, greater<pii> > r_pqpii;
typedef priority_queue<pll, vpll, greater<pll> > r_pqpll;

const ll inf = 1e18;

const int dir[5] = {-1, 0, 1, 0, -1};
ll sums[2010];
ll dp[2010][2010];
ll cost[2010][2010];


void compute(int g, int l, int r, int optL, int optR) {
    if (l > r) return;

    int mid = (l + r) / 2;
    ll best = 0;
    int bestOpt = -1;

    for (int k = optL; k <= min(mid - 1, optR); k++) {
        ll val = dp[g - 1][k] + cost[k + 1][mid];
        if (val > best) {
            best = val;
            bestOpt = k;
        }
    }

    dp[g][mid] = best;

    compute(g, l, mid - 1, optL, bestOpt);
    compute(g, mid + 1, r, bestOpt, optR);
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, m;
	cin>>n>>m;
	vvc grid(n+2, vc(m+2, '.'));
	REP(i, 1, n+1) {
		REP(j, 1, m+1) {
			cin>>grid[i][j];
		}
	}
	int L, R, C;
	function<void(int, int)> dfs = [&](int x, int y) {
		chmin(L, y);
		chmax(R, y);
		C += (grid[x][y] - '0');
		grid[x][y] = '.';
		REP(i, 4) {
			int nx = x + dir[i], ny = y + dir[i+1];
			if(grid[nx][ny] != '.') {
				dfs(nx, ny);
			}
		}
	};
	vvpii arr(m+2);
	REP(i, 1, n+1) {
		REP(j, 1, m+1) {
			if(grid[i][j] != '.') {
				L = m+2, R = 0, C = 0;
				dfs(i, j);
				// cerr<<L<<' '<<R<<' '<<C<<endl;
				arr[L].pushb(mp(R, C));
			}
		}
	}
	vll cnt(m+2, 0);
	for (int j = m; j >= 1; --j) {
      	for (auto &p: arr[j])
        	REP(i, j, p.first+1) cnt[i] += p.second;
      	REP(i, j, m+1) cost[j][i] = cnt[i];
    }
	// REP(i, 1, m+1) {
	// 	REP(j, 1, m+1) {
	// 		cerr<<cost[i][j]<<' ';
	// 	}
	// 	cerr<<endl;
	// }
	ll ans = 0;
	REP(i, 1, m+1) {
		dp[1][i] = cost[1][i];
		chmax(ans, dp[1][i]);
	}
	cout<<ans<<endl;
	REP(i, 2, m+1) {
		compute(i, 1, m, 1, m);
		ans = 0;
		REP(j, 1, m+1) {
			chmax(ans, dp[i][j]);
		}
		cout<<ans<<endl;
	}
}

• Subtask 1: 11 / 11
• Subtask 2: 23 / 23
• Subtask 3: 66 / 66