oj.uz

답안 #604384

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
604384 2022-07-25T05:22:47 Z SeDunion 조교 (CEOI16_popeala) C++17
0 / 100
 9 ms 3668 KB 
#include<iostream>

using namespace std;
using ll = long long;

const ll inf = 1e18;

const int T = 1e3 + 123;
const int N = 52;
const int S = 52;

ll pref[T];
int cs[N][T];
ll val[T][T];
ll dp[T][S];

void upd(ll &a, ll b) {
	a = min(a, b);
}

void solve(int l, int r, int opl, int opr, int x) {
	if (l > r) return;
	int m = (l + r) >> 1;
	int opm = -1;
	for (int i = max(opl, 0) ; i <= min(m - 1, opr) ; ++ i) {
		if (dp[m][x] > dp[i][x-1] + val[i][m]) {
			dp[m][x] = dp[i][x-1] + val[i][m];
			opm = i;
		}
	}
	solve(l, m - 1, opl, opm, x);
	solve(m + 1, r, opm, opr, x);
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n, t, s;
	cin >> n >> t >> s;
	for (int i = 1 ; i <= t ; ++ i) {
		cin >> pref[i];
		pref[i] += pref[i - 1];
	}
	for (int i = 1 ; i <= n ; ++ i) {
		for (int j = 1 ; j <= t ; ++ j) {
			char c; cin >> c;
			cs[i][j] = cs[i][j - 1] + (c == '1');
		}
	}
	for (int l = 0 ; l <= t ; ++ l) {
		for (int r = l + 1 ; r <= t ; ++ r) {
			int cnt = 0;
			for (int i = 1 ; i <= n ; ++ i) {
				cnt += (cs[i][r] - cs[i][l] == r - l);
			}
			val[l][r] = cnt * (pref[r] - pref[l]);
		}
	}
	for (int i = 0 ; i <= t ; ++ i) {
		for (int x = 0 ; x <= s ; ++ x) {
			dp[i][x] = inf;
		}
	}
	dp[0][0] = 0;
	for (int x = 1 ; x <= s ; ++ x) {
		solve(1, t, 0, t, x);
		/*for (int i = 1 ; i <= t ; ++ i) {
			for (int j = 0 ; j < i ; ++ j) {
				upd(dp[i][x], dp[j][x-1] + val[j][i]);
			}
		}*/
	}
	for (int i = 1 ; i <= s ; ++ i) {
		cout << dp[t][i] << "\n";
	}
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 1 ms 596 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 3668 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 74.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 1 ms 596 KB Output isn't correct
3 Halted 0 ms 0 KB -