답안 #425489

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
425489 2021-06-13T05:46:59 Z songc Vim (BOI13_vim) C++14
48.0556 / 100
41 ms 34104 KB
#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define Mup(a,x) a=max(a, x)
#define mup(a,x) a=min(a, x)
#define all(v) v.begin(),v.end()
#define lb lower_bound
#define INF (1ll<<60)
#define MOD 1'000'000'007 
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;

int M, N, X, sum, ans=MOD;
int A[70707], D[70707][11][11];
bool E[70707];

int main(){
	char c;
	bool tf = false;
	scanf("%d", &M);
	for (int i=0; i<M; i++){
		scanf(" %c", &c);
		if (c != 'e'){
			A[++N] = c-'a'+1+(c<'e'?1:0);
			if (tf) X = N;
			E[N] = tf, tf = false;
		}
		else tf = true, sum += 2;
	}
	if (!X){puts("0"); return 0;}
	memset(D, 1, sizeof D);
	for (int i=2; i<=10; i++) D[1][i][0] = 2;
	for (int i=1; i<N; i++){
		for (int j=2; j<=10; j++){
			if (A[i+1] == j){
				if (i+1>=X) ans = min(ans, min(D[i][j][0], D[i][j][1]));
				for (int k=2; k<=10; k++){
					D[i+1][k][0] = min(D[i+1][k][0], D[i][j][0]+2);
					D[i+1][k][1] = min(D[i+1][k][1], D[i][j][1]+3);
				}
			}
			else{
				if (!E[i+1]) D[i+1][j][0] = min(D[i+1][j][0], D[i][j][0]);
				D[i+1][j][1] = min(D[i+1][j][1], min(D[i][j][0], D[i][j][1])+1);
				for (int k=2; k<=10; k++) D[i+1][j][k] = min(D[i+1][j][k], D[i][j][0]+3);
			}
			for (int k=2; k<=10; k++){
				if (A[i+1] == j){
					if (j == k) for (int l=2; l<=10; l++) D[i+1][l][0] = min(D[i+1][l][0], D[i][j][k]+2);
					else D[i+1][k][0] = min(D[i+1][k][0], D[i][j][k]);
				}
				else if (A[i+1] != k) D[i+1][j][k] = min(D[i+1][j][k], D[i][j][k]+1);
			}
		}
	}
	printf("%d\n", ans+sum);
	return 0;
}

Compilation message

vim.cpp: In function 'int main()':
vim.cpp:22:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |  scanf("%d", &M);
      |  ~~~~~^~~~~~~~~~
vim.cpp:24:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |   scanf(" %c", &c);
      |   ~~~~~^~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 33740 KB Output is correct
2 Correct 15 ms 33740 KB Output is correct
3 Incorrect 16 ms 33740 KB Output isn't correct
4 Correct 15 ms 33712 KB Output is correct
5 Correct 17 ms 33728 KB Output is correct
6 Correct 15 ms 33688 KB Output is correct
7 Correct 17 ms 33740 KB Output is correct
8 Correct 17 ms 33740 KB Output is correct
9 Correct 17 ms 33804 KB Output is correct
10 Correct 17 ms 33720 KB Output is correct
11 Correct 18 ms 33708 KB Output is correct
12 Correct 19 ms 33756 KB Output is correct
13 Correct 16 ms 33740 KB Output is correct
14 Correct 16 ms 33740 KB Output is correct
15 Incorrect 17 ms 33780 KB Output isn't correct
16 Incorrect 18 ms 33760 KB Output isn't correct
17 Correct 19 ms 33728 KB Output is correct
18 Correct 15 ms 33708 KB Output is correct
19 Correct 18 ms 33748 KB Output is correct
20 Correct 15 ms 33740 KB Output is correct
21 Correct 17 ms 33684 KB Output is correct
22 Correct 18 ms 33788 KB Output is correct
23 Correct 18 ms 33760 KB Output is correct
24 Correct 16 ms 33732 KB Output is correct
25 Correct 15 ms 33740 KB Output is correct
26 Correct 15 ms 33748 KB Output is correct
27 Correct 18 ms 33756 KB Output is correct
28 Correct 19 ms 33704 KB Output is correct
29 Correct 16 ms 33728 KB Output is correct
30 Incorrect 16 ms 33724 KB Output isn't correct
31 Correct 15 ms 33732 KB Output is correct
32 Incorrect 18 ms 33728 KB Output isn't correct
33 Correct 15 ms 33740 KB Output is correct
34 Correct 18 ms 33704 KB Output is correct
35 Correct 18 ms 33744 KB Output is correct
36 Correct 15 ms 33740 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 33696 KB Output is correct
2 Correct 17 ms 33740 KB Output is correct
3 Correct 16 ms 33740 KB Output is correct
4 Correct 19 ms 33740 KB Output is correct
5 Incorrect 18 ms 33716 KB Output isn't correct
6 Incorrect 18 ms 33820 KB Output isn't correct
7 Incorrect 17 ms 33764 KB Output isn't correct
8 Incorrect 16 ms 33792 KB Output isn't correct
9 Correct 20 ms 33692 KB Output is correct
10 Incorrect 22 ms 33728 KB Output isn't correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 35 ms 33996 KB Output isn't correct
2 Incorrect 32 ms 33996 KB Output isn't correct
3 Incorrect 31 ms 34068 KB Output isn't correct
4 Incorrect 33 ms 34076 KB Output isn't correct
5 Incorrect 35 ms 34104 KB Output isn't correct
6 Incorrect 27 ms 33868 KB Output isn't correct
7 Incorrect 32 ms 34072 KB Output isn't correct
8 Incorrect 31 ms 33932 KB Output isn't correct
9 Incorrect 31 ms 33940 KB Output isn't correct
10 Incorrect 29 ms 34096 KB Output isn't correct
11 Incorrect 33 ms 34064 KB Output isn't correct
12 Incorrect 41 ms 33996 KB Output isn't correct
13 Incorrect 33 ms 33996 KB Output isn't correct
14 Incorrect 35 ms 33976 KB Output isn't correct
15 Incorrect 32 ms 33996 KB Output isn't correct
16 Incorrect 32 ms 34048 KB Output isn't correct
17 Incorrect 33 ms 34016 KB Output isn't correct
18 Incorrect 41 ms 34048 KB Output isn't correct
19 Incorrect 32 ms 33920 KB Output isn't correct
20 Incorrect 31 ms 33996 KB Output isn't correct