# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
239824 | nicolaalexandra | Paint By Numbers (IOI16_paint) | C++14 | 6 ms | 384 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 DIM 100010
using namespace std;
int sp[DIM],Left[DIM],Right[DIM];
int get_sum (int x, int y){
int sol = sp[y];
if (x)
sol -= sp[x-1];
return sol;
}
string solve_puzzle (string s, vector <int> c){
int n = s.length(), i, j;
for (i=0;i<n;i++){
sp[i] = i ? sp[i-1] : 0;
if (s[i] == '_')
sp[i]++;
}
/// left[i] - cea mai din stanga pozitie pe care poate sa inceapa blocul i
int pos = 0;
for (i=0;i<c.size();i++){
int lg = c[i];
while (get_sum(pos, pos+lg-1))
pos++;
Left[i] = pos;
pos += lg + 1;
}
pos = n-1;
for (i=c.size()-1;i>=0;i--){
int lg = c[i];
while (get_sum(pos-lg+1,pos))
pos--;
Right[i] = pos - lg + 1;
pos -= lg + 1;
}
for (i=0;i<c.size();i++){
int lg = c[i];
for (j=Right[i];j<=Left[i]+lg-1;j++)
s[j] = 'X';
for (j=Left[i];j<Right[i];j++){
if (s[j] == '.')
s[j] = '?';
}
for (j=Left[i]+lg;j<=Right[i]+lg-1;j++){
if (s[j] == '.')
s[j] = '?';
}
}
for (i=0;i<n;i++)
if (s[i] == '.')
s[i] = '_';
return s;
}
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... |