| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1142560 | redimberoc | Mutating DNA (IOI21_dna) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "/Library/debug/debug.h"
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
#define MAX 2e9
#define MIN -2e9
#define PI acos(-1.0)
#define mid(s, e) ((s) + ((e) - (s)) / 2)
#define clz(n) __builtin_clzll(n)
#define nbOfBits(n) __builtin_popcountll(n)
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define pb push_back
#define sz(a) static_cast<int>((a).size())
#define double long double
#define fi first
#define fill(n,arr) for(int i=1;i<=n;i++){ll x;cin>>x;arr.pb(x);}
#define se second
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define getlower(s) transform(s.begin(), s.end(), s.begin(), ::tolower)
#define getupper(s) transform(s.begin(), s.end(), s.begin(), ::toupper)
#define reverse(s) reverse(s.begin(), s.end())
#define getmax(ans) *max_element(all(ans));
#define getmin(ans) *min_element(all(ans));
using ll = long long;
using vi = vector<int>;
using vc = vector<char>;
using vvc = vector<vc>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vs = vector<string>;
using pii = pair<int, int>;
using pdd = pair<double, double>;
using vpii = vector<pii>;
using vpdd = vector<pdd>;
using si = set<int>;
using ssi = set<si>;
using sb = set<bool>;
using ssb = set<sb>;
using sd = set<double>;
using ssd = set<sd>;
using ss = set<string>;
using sc = set<char>;
const int N = 1e5 + 7;
const int INF = 1e9 + 18;
string a,b;
void init(std::string n, std::string m) {
a = n;
b = m;
}
int get_distance(int x, int y) {
int count = 0;
int r = 0,l = 0;
for(int i=x;i<=y;i++){
r += a[i] - '0';
l += b[i] - '0';
if(a[i] != b[i]){
count++;
}
}
if(r != l){
return -1;
}else{
if(count % 2 == 0){
return count/2;
}else{
return (count/2) + 1;
}
}
}
void solve(){
int n,q;
cin>>n>>q;
cin>>a>>b;
init(a,b);
while(q--){
int x,y;
cin>>x>>y;
cout<<get_distance(x,y)<<endl;
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
//int t;cin>>t;while(t--)
solve();
}