oj.uz

Submission #425533

# Submission time Handle Problem Language Result Execution time Memory
425533 2021-06-13T06:35:02 Z songc Vim (BOI13_vim) C++14
100 / 100
 47 ms 34076 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{
						for (int l=2; l<=10; l++) D[i+1][l][k] = min(D[i+1][l][k], D[i][j][k]+3);
						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);
      |   ~~~~~^~~~~~~~~~~

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 33740 KB Output is correct
2 Correct 15 ms 33796 KB Output is correct
3 Correct 15 ms 33740 KB Output is correct
4 Correct 14 ms 33728 KB Output is correct
5 Correct 18 ms 33732 KB Output is correct
6 Correct 17 ms 33740 KB Output is correct
7 Correct 17 ms 33800 KB Output is correct
8 Correct 17 ms 33732 KB Output is correct
9 Correct 15 ms 33740 KB Output is correct
10 Correct 18 ms 33736 KB Output is correct
11 Correct 17 ms 33740 KB Output is correct
12 Correct 19 ms 33768 KB Output is correct
13 Correct 19 ms 33680 KB Output is correct
14 Correct 17 ms 33740 KB Output is correct
15 Correct 17 ms 33764 KB Output is correct
16 Correct 15 ms 33712 KB Output is correct
17 Correct 16 ms 33796 KB Output is correct
18 Correct 17 ms 33768 KB Output is correct
19 Correct 15 ms 33780 KB Output is correct
20 Correct 15 ms 33764 KB Output is correct
21 Correct 17 ms 33768 KB Output is correct
22 Correct 17 ms 33768 KB Output is correct
23 Correct 19 ms 33740 KB Output is correct
24 Correct 17 ms 33764 KB Output is correct
25 Correct 17 ms 33704 KB Output is correct
26 Correct 15 ms 33740 KB Output is correct
27 Correct 17 ms 33744 KB Output is correct
28 Correct 17 ms 33752 KB Output is correct
29 Correct 17 ms 33740 KB Output is correct
30 Correct 19 ms 33740 KB Output is correct
31 Correct 17 ms 33756 KB Output is correct
32 Correct 18 ms 33740 KB Output is correct
33 Correct 17 ms 33800 KB Output is correct
34 Correct 17 ms 33740 KB Output is correct
35 Correct 17 ms 33696 KB Output is correct
36 Correct 15 ms 33740 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 33776 KB Output is correct
2 Correct 18 ms 33744 KB Output is correct
3 Correct 18 ms 33716 KB Output is correct
4 Correct 18 ms 33792 KB Output is correct
5 Correct 16 ms 33740 KB Output is correct
6 Correct 17 ms 33800 KB Output is correct
7 Correct 16 ms 33684 KB Output is correct
8 Correct 16 ms 33796 KB Output is correct
9 Correct 18 ms 33720 KB Output is correct
10 Correct 19 ms 33768 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 34048 KB Output is correct
2 Correct 36 ms 33932 KB Output is correct
3 Correct 39 ms 34060 KB Output is correct
4 Correct 41 ms 33996 KB Output is correct
5 Correct 40 ms 33996 KB Output is correct
6 Correct 29 ms 33868 KB Output is correct
7 Correct 34 ms 34000 KB Output is correct
8 Correct 38 ms 34064 KB Output is correct
9 Correct 31 ms 33996 KB Output is correct
10 Correct 31 ms 33996 KB Output is correct
11 Correct 46 ms 33980 KB Output is correct
12 Correct 38 ms 34076 KB Output is correct
13 Correct 40 ms 33980 KB Output is correct
14 Correct 37 ms 33988 KB Output is correct
15 Correct 38 ms 33996 KB Output is correct
16 Correct 37 ms 34068 KB Output is correct
17 Correct 47 ms 34048 KB Output is correct
18 Correct 45 ms 33996 KB Output is correct
19 Correct 34 ms 33996 KB Output is correct
20 Correct 35 ms 33996 KB Output is correct