oj.uz

답안 #125846

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
125846 2019-07-06T12:59:55 Z tutis 조교 (CEOI16_popeala) C++17
17 / 100
 2000 ms 1528 KB 
/*input
2 3 3
4 3 5
101
110
*/
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll modulo = 1000000007;
int main()
{
	ll N, T, S;
	cin >> N >> T >> S;
	ll p[T + 1];
	for (ll i = 1; i <= T; i++)
		cin >> p[i];
	string res[N];
	for (ll i = 0; i < N; i++)
		cin >> res[i];
	ll dp[S + 1][T + 1];
	for (ll a = 0; a <= S; a++)
	{
		for (ll b = 0; b <= T; b++)
		{
			dp[a][b] = 1e15;
		}
	}
	dp[0][0] = 0;
	for (ll c = 1; c <= S; c++)
	{
		for (ll b = 1; b <= T; b++)
		{
			vector<bool>ok(N, true);
			ll kiek = N;
			ll suma = 0;
			for (ll a = b; a > 0; a--)
			{
				suma += p[a];
				for (ll i = 0; i < N; i++)
				{
					if (res[i][a - 1] == '0')
					{
						if (ok[i])
						{
							ok[i] = false;
							kiek--;
						}
					}
				}
				dp[c][b] = min(dp[c][b], dp[c - 1][a - 1] + kiek * suma);
			}
		}
	}
	for (ll c = 1; c <= S; c++)
	{
		cout << dp[c][T] << "\n";
	}
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 466 ms 644 KB Output is correct
2 Correct 431 ms 636 KB Output is correct
3 Correct 464 ms 632 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2066 ms 1528 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 74.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 466 ms 644 KB Output is correct
4 Correct 431 ms 636 KB Output is correct
5 Correct 464 ms 632 KB Output is correct
6 Execution timed out 2066 ms 1528 KB Time limit exceeded
7 Halted 0 ms 0 KB -