# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1224653 | LIA | Paint By Numbers (IOI16_paint) | C++17 | 0 ms | 324 KiB |
#include "paint.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string solve_puzzle(string s, vector<int> c) {
int n = s.size(), k = c.size();
vector<ll> vis(n, 0), l(k), r(k);
ll sum = 0;
for (int i = 0; i < k; ++i) {
l[i] = sum;
sum += c[i] + 1;
}
sum = n;
for (int i = k - 1; i >= 0; --i) {
r[i] = sum - c[i];
sum -= c[i] + 1;
}
for (int i = 0; i < k; ++i) {
for (int x = l[i]; x < l[i] + c[i]; ++x)
vis[x]++;
for (int x = r[i]; x < r[i] + c[i]; ++x)
vis[x]++;
}
string ans(n, '?');
for (int i = 0; i < n; ++i)
if (s[i] == '_')
ans[i] = '_';
for (int i = 0; i < n; ++i) {
if (vis[i] == 2)
ans[i] = 'X';
else if (vis[i] == 0)
ans[i] = '_';
}
return ans;
}
Compilation message (stderr)
# | 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... |