【无标题】

Problem - C - Codeforces

 

#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <climits>
#include <unordered_map>
using namespace std;
#define mst(x, y) memset(x, y, sizeof x)
#define X first
#define Y second
#define int long long
#define FAST ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
const int N = 200010, INF = 0x3f3f3f3f, MOD = 1e9 + 7;
const double EPS = 1e-6;
typedef pair<int, int> PII;
typedef unordered_map<int, int> Ump;
int T;
int n, p, k;
string s;
int a[N];
int res, ans;
int x, y;
void solve()
{
    res = 0, ans = INF;
    cin >> n >> p >> k;
    cin >> s;
    cin >> x >> y;
    s = " " + s;
    int len = s.size() - 1;
    for (int i = 1; i <= len; i++)
        a[i] = s[i] - '0';

    for (int i = len - k + 1; i <= len; i++)
    {
        res = 0;
        int t = INF;
        int st = i;
        while (st >= p)
        {
            if (a[st] == 0)
            {
                res += x;
            }
            t = min(t, res + (st - p) * y);
            // cout << "st: " << st << " res: " << res << endl;
            st -= k;
        }
        ans = min(ans, t);
    }
    cout << ans << endl;
}
signed main()
{
    FAST;
    cin >> T;
    while (T--)
    {
        solve();
    }
    return 0;
}
/*
1
2 2 1
10
11 1
*/