program_files/EDIST!.cpp at master · NishantRaj/program_files · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
#include <bits/stdc++.h>
using namespace std;
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		char s[100009],t[100009],ns[100009],nt[100009];
		scanf("%s",s);
		scanf("%s",t);
		int sizes = strlen(s),sizet = strlen(t),a,b,k;
		scanf("%d%d%d",&a,&b,&k);
		if(a==0)
		{
			printf("0\n");
			continue;
		}
		if(b==0)
		{
			if(abs(sizet - sizes)*a > k)
				printf("-1\n");
			else
				printf("%d\n",abs(sizet - sizes)*a);
			continue;
		}
		if(abs(sizet - sizes)*a > k)
		{
			printf("-1\n");
			continue;
		}
		int l,p=0;
		for(l=0;l<min(sizet,sizes);l++)
		{
			if(s[l] != t[l])
			{
				ns[p] = s[l];
				nt[p] = t[l];
				p++;
			}
		}
		if(sizet < sizes)
		{
			sizet = p;
			while(l<sizes)
				ns[p++] = s[l++];
			sizes = p;
		}
		else
		{
			sizes = p;
			while(l<sizet)
				nt[p++] = t[l++];
			sizet = p;
		}
		if(abs(sizet - sizes)*a > k)
		{
			printf("-1\n");
			continue;
		}
		vector<int> v1(sizet+9),v2(sizet+9);
		for(int i=0;i<=sizet;i++)
			v1[i] = i*a;
		int flag = 0,mi = INT_MAX;
		for(int i=0;i<sizes;i++)
		{
			v2[0] = (i+1)*a;
			for(int j=0;j<sizet;j++)
			{
				int add;
				if(ns[i] == nt[j])
					add = 0;
				else
					add = b;
				v2[j+1] = min(v2[j]+a,min(v1[j+1]+a,v1[j]+add));
			}
			for(int i=0;i<sizet;i++){
				mi = min(mi,v2[i]);
				v1[i] = v2[i];
			}
			if(mi > k){
				flag = 1;
				break;
			}
		}
		if(flag)
			printf("-1\n");
		else
			printf("%d\n",v2[sizet]);
	}
	return 0;
}