답안 #256394

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
256394 2020-08-02T16:06:46 Z Saboon Vim (BOI13_vim) C++14
55 / 100
629 ms 98936 KB
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;

const int maxn = 5000 + 10;

int nex[maxn][12];
int dp[maxn][maxn];
int pd[maxn];

int main(){
	ios_base::sync_with_stdio(false);
	int n;
	string s;
	cin >> n >> s;
	for (int i = 0; i < 10; i++){
		int last = -1;
		for (int j = n-1; j >= 0; j--){
			if (last == -1)
				nex[j][i] = j;
			else
				nex[j][i] = last;
			if ((int)(s[j] - 'a') == i and s[j] != 'e')
				last = j;
		}
	}
	vector<int> e;
	for (int i = 0; i < n; i++)
		if (s[i] == 'e')
			e.push_back(i);
	if (e.empty())
		return cout << 0 << endl, 0;
	int m = e.size();
	memset(dp, 63, sizeof dp);
	dp[0][0] = 0;
	for (int i = 0; i < m; i++){
		memset(pd, 63, sizeof pd);
		for (int j = 0; j <= i; j++){
			if (j > 0)
				pd[e[j-1]+1] = dp[i][j];
			else
				pd[0] = dp[i][j];
		}
		for (int j = 0; j < n; j++)
			for (int c = 0; c < 10; c++)
				if (nex[j][c] != j)
					pd[nex[j][c]] = min(pd[nex[j][c]], pd[j] + 2);
		int it = 0;
		for (int idx = 0; idx < n; idx ++){
			if (s[idx] == 'e')
				continue;
			while (it < m and e[it] < idx)
				it ++;
			if (it <= i)
				continue;
			dp[it][i+1] = min(dp[it][i+1], pd[idx] + (idx-e[i]) + (it-i));
		}
	}
	int answer = 4*n;
	for (int i = 1; i <= m; i++)
		answer = min(answer, dp[m][i]);
	cout << answer << endl;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 98552 KB Output is correct
2 Correct 54 ms 98552 KB Output is correct
3 Correct 57 ms 98680 KB Output is correct
4 Correct 59 ms 98588 KB Output is correct
5 Correct 54 ms 98552 KB Output is correct
6 Correct 53 ms 98596 KB Output is correct
7 Correct 55 ms 98552 KB Output is correct
8 Correct 51 ms 98552 KB Output is correct
9 Correct 51 ms 98552 KB Output is correct
10 Correct 51 ms 98552 KB Output is correct
11 Correct 51 ms 98552 KB Output is correct
12 Correct 55 ms 98552 KB Output is correct
13 Correct 61 ms 98552 KB Output is correct
14 Correct 58 ms 98552 KB Output is correct
15 Correct 52 ms 98552 KB Output is correct
16 Correct 53 ms 98552 KB Output is correct
17 Correct 52 ms 98552 KB Output is correct
18 Correct 51 ms 98556 KB Output is correct
19 Correct 55 ms 98552 KB Output is correct
20 Correct 55 ms 98568 KB Output is correct
21 Correct 55 ms 98552 KB Output is correct
22 Correct 58 ms 98668 KB Output is correct
23 Correct 56 ms 98552 KB Output is correct
24 Correct 58 ms 98680 KB Output is correct
25 Correct 57 ms 98552 KB Output is correct
26 Correct 57 ms 98680 KB Output is correct
27 Correct 60 ms 98552 KB Output is correct
28 Correct 66 ms 98552 KB Output is correct
29 Correct 67 ms 98552 KB Output is correct
30 Correct 52 ms 98552 KB Output is correct
31 Correct 51 ms 98552 KB Output is correct
32 Correct 58 ms 98556 KB Output is correct
33 Correct 55 ms 98600 KB Output is correct
34 Correct 54 ms 98552 KB Output is correct
35 Correct 59 ms 98552 KB Output is correct
36 Correct 62 ms 98552 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 629 ms 98912 KB Output isn't correct
2 Correct 481 ms 98912 KB Output is correct
3 Incorrect 203 ms 98680 KB Output isn't correct
4 Incorrect 614 ms 98936 KB Output isn't correct
5 Correct 426 ms 98808 KB Output is correct
6 Correct 284 ms 98936 KB Output is correct
7 Incorrect 538 ms 98936 KB Output isn't correct
8 Incorrect 414 ms 98936 KB Output isn't correct
9 Correct 486 ms 98916 KB Output is correct
10 Correct 424 ms 98812 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Runtime error 7 ms 768 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Runtime error 5 ms 768 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Runtime error 6 ms 768 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Runtime error 7 ms 896 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Runtime error 6 ms 872 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Runtime error 5 ms 768 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Runtime error 7 ms 768 KB Execution killed with signal 11 (could be triggered by violating memory limits)
8 Runtime error 6 ms 768 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Runtime error 5 ms 768 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Runtime error 6 ms 768 KB Execution killed with signal 11 (could be triggered by violating memory limits)
11 Runtime error 8 ms 896 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Runtime error 5 ms 896 KB Execution killed with signal 11 (could be triggered by violating memory limits)
13 Runtime error 8 ms 896 KB Execution killed with signal 11 (could be triggered by violating memory limits)
14 Runtime error 6 ms 896 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Runtime error 5 ms 896 KB Execution killed with signal 11 (could be triggered by violating memory limits)
16 Runtime error 6 ms 768 KB Execution killed with signal 11 (could be triggered by violating memory limits)
17 Runtime error 6 ms 768 KB Execution killed with signal 11 (could be triggered by violating memory limits)
18 Runtime error 8 ms 768 KB Execution killed with signal 11 (could be triggered by violating memory limits)
19 Runtime error 6 ms 768 KB Execution killed with signal 11 (could be triggered by violating memory limits)
20 Runtime error 7 ms 768 KB Execution killed with signal 11 (could be triggered by violating memory limits)