-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathA_Round_Trip.cpp
More file actions
68 lines (50 loc) · 1.18 KB
/
A_Round_Trip.cpp
File metadata and controls
68 lines (50 loc) · 1.18 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
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(v) v.begin(), v.end()
#define forn(i, k, n) for(ll i = k; i < n; i++)
#define pyes cout<<"YES"<<endl;return
#define pno cout<<"NO"<<endl;return
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
const int INF = 1e9;
const ll mod = 1000000007;
//The only verdict is vengeance; a vendetta, held as a votive, not in vain, for the value and veracity of such shall one day vindicate the vigilant and the virtuous.
void solve(){
ll r, x, d , n;
cin>>r>>x>>d>>n;
string arr;
cin>>arr;
int del = abs(r-x);
int ans = 0;
for(char c:arr){
if(c=='1'){
ans++;
if(del>=0){
del-=d;
}else{
continue;
}
}else{
if(abs(r - x) < abs(del) || r < x) {
ans++;
}
}
}
cout<<ans<<endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t=1;
cin>>t;
while(t--)
{
solve();
}
return 0;
}