This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "paint.h"
#include <bits/stdc++.h>
using namespace std;
string solve_puzzle(string s, vector<int> c1) {
int n = s.size(), k = c1.size();
vector <int> c(k+5, 0);
for (int i = 1; i <= k; i++) c[i] = c1[i-1];
string ans = "";
for (int i = 0; i < n; i++) ans += '?';
vector <int> pre(k+5, 1), suf(k + 5, n);
pre[1] = 1, suf[k] = n;
for (int i = 2; i <= k; i++) pre[i] = pre[i-1] + c[i-1]+1;
for (int i = k - 1; i > 0; i--) suf[i] = suf[i+1] - c[i+1] - 1;
for (int i = 1; i <= k; i++) {
// cout << i << ": " << pre[i] << ' ' << suf[i] << '\n';
int len = suf[i] - pre[i] + 1;
if (len >= c[i] * 2) continue;
if (len == c[i]) {
for (int j = pre[i]; j <= suf[i]; j++) ans[j-1] = 'X';
if (pre[i]-2 >= 0) ans[pre[i]-2] = '_';
if (suf[i] <= n) suf[i] = '_';
}
int len1 = c[i] * 2 - len;
// cout << len1 << ' ' << c[i] - len1 + pre[i] << '\n';
for (int j = 0; j < len1; j++) {
// int st =
ans[j + c[i] - len1 + pre[i]-1] = 'X';
}
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |