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>
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
const int MAX_N = 2e5 + 5;
int cnt[MAX_N];
std::string solve_puzzle(std::string s, std::vector<int> c) {
int n = s.size();
int k = c.size();
for (int j = 0; j <= k; j++) {
int ind = 0;
for (int l = 0; l < j; l++) {
int d = c[l];
for (int i = ind; i < ind + d; i++) cnt[i]++;
ind += d + 1;
}
ind = n - 1;
for (int l = k - 1; l >= j; l--) {
int d = c[l];
for (int i = ind; i > ind - d; i--) cnt[i]++;
ind -= d + 1;
}
}
string ans(n, '?');
for (int i = 0; i < n; i++) {
if (!cnt[i]) ans[i] = '_';
else if (cnt[i] == k + 1) ans[i] = '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... |