-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1996C.cpp
More file actions
81 lines (60 loc) · 1.26 KB
/
1996C.cpp
File metadata and controls
81 lines (60 loc) · 1.26 KB
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
//============================================================================
// Name : 1996C.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define test int t; cin>>t; while(t--)
#define input(a) for(auto& x:a) cin>>x
#define output(a) for(auto p:a) cout<<p<<" "
#define el cout<<endl
const int N = 1e5 + 10;
char a[N];
char b[N];
ll power(ll x, ll y) {
if (y == 0)
return 1;
return x * power(x, y - 1);
}
void solve() {
int n, q;
cin >> n >> q;
string a, b;
cin >> a >> b;
while (q--) {
int l, r;
cin >> l >> r;
string tempA, tempB;
tempA = a;
tempB = b;
int minOp = 0;
vector<int> fa(26, 0), fb(26, 0);
for (int i = l - 1; i < r; i++)
fa[tempA[i] - 97]++, fb[tempB[i] - 97]++;
for(int i=0; i<26; i++) {
minOp += max(0, fa[i]-fb[i]);
}
cout << minOp << endl;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
while (t--) {
// cout << "t: " << t; el;
solve();
}
}
//zzde
//azbe
//1 3
//1 4
//a=0, b=0, z=2, d=1
//a=1, b=1, z=1, d=0