fork download
copy 
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. #define endl '\n'
  4. #define int long long int
  5. const int MOD = 1000000007;
  6. const int MOD2 = 998244353;
  7. const int INF = LLONG_MAX / 2;
  8. const int MAXN = 100000;
  9. int primes[1000000];
  10.  
  11. /*void seive() {
  12.     fill(primes, primes + 1000000, 1);
  13.     primes[0] = primes[1] = 0;
  14.     for (int i = 2; i * i < 1000000; i++) {
  15.         if (primes[i]) {
  16.             for (int j = i * i; j < 1000000; j += i) {
  17.                 primes[j] = 0;
  18.             }
  19.         }
  20.     }
  21. }
  22.  
  23. bool isPrime(int n) {
  24.     if (n <= 1) return false;
  25.     for (int i = 2; i * i <= n; i++) {
  26.         if (n % i == 0) return false;
  27.     }
  28.     return true;
  29. }
  30.  
  31. int gcd(int a, int b) {
  32.     if (a == 0) return b;
  33.     return gcd(b % a, a);
  34. }*/
  35.  
  36. int power(int a, int b, int mod) {
  37.     int res = 1;
  38.     a %= mod;
  39.     while (b > 0) {
  40.         if (b & 1) res = res * a % mod;
  41.         a = a * a % mod;
  42.         b >>= 1;
  43.     }
  44.     return res;
  45. }
  46.  
  47. // nCr % MOD for n < MOD
  48. int nCrModP(int n, int r) {
  49.     if (r > n) return 0;
  50.     if (r == 0 || r == n) return 1;
  51.  
  52.     int numerator = 1, denominator = 1;
  53.     for (int i = 0; i < r; i++) {
  54.         numerator = (numerator * (n - i)) % MOD;
  55.         denominator = (denominator * (i + 1)) % MOD;
  56.     }
  57.     return (numerator * power(denominator, MOD - 2, MOD)) % MOD;
  58. }
  59.  
  60. // Lucas's Theorem
  61. int lucas(int n, int r) {
  62.     if (r == 0) return 1;
  63.     return (lucas(n / MOD, r / MOD) * nCrModP(n % MOD, r % MOD)) % MOD;
  64. }
  65. void solve() {
  66.     int n,q;
  67.     cin>>n>>q;
  68.     string str1,str2;
  69.     cin>>str1>>str2;
  70.     vector<int>a,b;
  71.     for(int i = 0 ; i<n ; i++){
  72.        a.push_back(str1[i]-'0');
  73.     }
  74.     for(int i = 0 ; i<n ; i++){
  75.        b.push_back(str2[i]-'0');
  76.     }
  77.     vector<int>prefixones(n,-1),suffones(n,-1);
  78.     int j = 0;
  79.     int cnt = 0;
  80.     for(int i = 0 ; i<n ; i++){
  81.         if(a[i]==1){
  82.            cnt += (i-j);
  83.            prefixones[j] = cnt;
  84.            j++;
  85.         }
  86.     }
  87.     j = n-1;
  88.     cnt = 0;
  89.     for(int i = n-1 ; i>=0 ; i--){
  90.         if(b[i]==1){
  91.            cnt += (j-i);
  92.            suffones[j] = cnt;
  93.            j--;
  94.         }
  95.     }
  96.     int mini = INF;
  97.     for(int i = 0 ; i<n ; i++){
  98.         if(prefixones[i]!=-1 && suffones[i]!=-1){
  99.             mini = min(mini,(prefixones[i]+suffones[i]));
  100.         }
  101.     }
  102.     cout<<((mini!=INF)?mini:-1)<<endl;
  103. }
  104.  
  105. signed main() {
  106.     ios::sync_with_stdio(false); cin.tie(NULL);
  107.     int t;
  108.     cin >> t;
  109.     while (t--) {
  110.         solve();
  111.     }
  112.     return 0;
  113. }
  114.  
Success #stdin #stdout 0.01s 5324KB
comments (?)
stdin
copy 
5
3 0
011 
110 
3 0
011
010 
6 0
110010 
010001
6 0
110010 
111101 
6 0
110010
110101
stdout
copy 
4
-1
-1
4
7
https://ideone.com/snKYtk
language:
C++14 (gcc 8.3)
created:
7 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!