-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path2082c.cpp
More file actions
57 lines (48 loc) · 1.17 KB
/
Copy path2082c.cpp
File metadata and controls
57 lines (48 loc) · 1.17 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
#pragma optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
const ll MOD = 1000000007;
ll pow_mod(ll x, ll n, ll m) {
if (n == 0)
return 1;
ll t = pow_mod(x, n / 2, m);
if (n % 2 == 0)
return (t * t) % m;
else
return (((t * t) % m) * x) % m;
}
int main() {
cin.tie(0)->sync_with_stdio(0);
int t;
cin >> t;
while (t--) {
int n;
string s;
cin >> n >> s;
ll one_half = pow_mod(2, MOD - 2, MOD);
vll dp(n + 1);
for (int i = 1; i <= n; i++) {
if (s[n - i] == '0') {
dp[i] = (one_half * dp[i-1]) % MOD;
} else {
dp[i] = (one_half * (1 - dp[i-1] + MOD) + dp[i-1]) % MOD;
}
}
// for (auto x : dp) {
// cout << x << " ";
// }
// cout << endl;
ll ans = n - 1 + dp[n - 1];
cout << ans << endl;
}
}