Educational Codeforces Round 94 (Rated for Div. 2) C. Binary String Reconstruction

Title

CodeForces 1400 C. Binary String Reconstruction

Time Limit

2 seconds

Memory Limit

256 megabytes

Problem Description

Consider the following process. You have a binary string (a string where each character is either 0 or 1) $w$ of length $n$ and an integer $x$. You build a new binary string $s$ consisting of $n$ characters. The $i$-th character of $s$ is chosen as follows:

• if the character$w_{i-x}$exists and is equal to 1, then $s_i$ is 1 (formally, if $i>x$ and$w_{i-x}$= 1, then $s_i$= 1);
• if the character $w_{i+x}$ exists and is equal to 1, then $s_i$ is 1 (formally, if$i+x\le n$ and $w_{i+x}$= 1, then $s_i$= 1);
• if both of the aforementioned conditions are false, then $s_i$ is 0.

You are given the integer $x$ and the resulting string $s$. Reconstruct the original string $w$.

Input

The first line contains one integer $t$ ($1\le t\le 1000$) — the number of test cases.

Each test case consists of two lines. The first line contains the resulting string $s$ ($2\le |s|\le 10^5$, each character of $s$ is either 0 or 1). The second line contains one integer $x$ ($1\le x\le |s|-1$).

The total length of all strings $s$ in the input does not exceed $10^5$.

Output

For each test case, print the answer on a separate line as follows:

Sample Input

3
101110
2
01
1
110
1

Sample Onput

111011
10
-1

Source

CodeForces 1400 C. Binary String Reconstruction

题意

给出一个字符串$s$和一个整数$k$，要求构造一个字符串$t$使得

若有一个$t_{i-x}$或者$t_{i+x}$（均不能越界）为1，则$s_i==1$；否则$s_i$为0.

若无则输出-1

思路

很明显零的要求更苛刻，所以我一开始均是特殊字符,表示未做要求，当s[i]为1时，若有未做要求的字符则替换成1，当s[i]为0时，无论是什么，都将相关位置替换成0.这样有可能导致1被覆盖。则最后再check即可。

AC代码:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int maxn = 3e5 + 5;
const ll inf = 0x3f3f3f3f;
const ll mod = 1e9 + 7;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int T;
    cin >> T;
    while (T--) {
        string s;
        int x;
        cin >> s >> x;
        string ans(s.length(), '*');
        for (int i = 0; i < s.length(); ++i) {
            if (s[i] == '1') {
                if (i + x < s.length() && ans[i + x] == '*') ans[i + x] = '1';
                if (i - x >= 0 && ans[i - x] == '*') ans[i - x] = '1';
            } else {
                if (i + x < s.length()) ans[i + x] = '0';
                if (i - x >= 0) ans[i - x] = '0';
            }
        }
        for (auto &it : ans) {
            if (it == '*') it = '0';
        }
        int ok = 1;
        for (int i = 0; i < ans.length() && ok; ++i) {
            if (s[i] == '1') {
                int l = 0, r = 0;
                if (i + x < s.length()) l = ans[i + x] == '1';
                if (i - x >= 0) r = ans[i - x] == '1';
                if (l + r == 0) ok = 0;
            } else {
                int l = 1, r = 1;
                if (i + x < s.length()) l = ans[i + x] == '0';
                if (i - x >= 0) r = ans[i - x] == '0';
                if (l + r != 2) ok = 0;
            }
        }
        cout << (ok ? ans : "-1") << endl;
    }
    return 0;
}