# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
43089 | MatheusLealV | Paint By Numbers (IOI16_paint) | C++14 | 0 ms | 0 KiB |
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 <bits/stdc++.h>
#include "paint.h"
#define K 120
#define N 200050
using namespace std;
int ini[K], fim[K], n, sz[K], cnt[N], global[N];
char v[N];
string solve_puzzle(string s, int k, int c[])
{
n = s.size();
string ans = s;
for(int i = 0; i < n ; i++) v[i + 1] = s[i];
for(int i = 1; i <= k; i++) sz[i] = c[i - 1];
ini[1] = 1, fim[k] = n - sz[k] + 1;
for(int i = 2; i <= k; i++) ini[i] = ini[i - 1] + sz[i - 1] + 1;
for(int i = k - 1; i >= 1; i--) fim[i] = fim[i + 1] - sz[i] - 1;
for(int i = 1; i <= k; i++)
{
memset(cnt, 0, sizeof cnt);
for(int p = ini[i]; p <= fim[i]; p++)
for(int j = p; j < p + sz[i]; j++) global[j] ++, cnt[j] ++;
for(int j = 1; j <= n; j++) if(cnt[j] == fim[i] - ini[i] + 1) ans[j - 1] = 'X';
}
for(int i = 1; i <= n; i++)
{
if(!global[i] && ans[i - 1] != 'X') ans[i - 1] = '_';
else if(ans[i - 1] == '.') ans[i - 1] = '?';
}
return ans;
}