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>
using namespace std;
#include "paint.h"
#define ll long long
#define pb push_back
const int N = 2e5 + 2;
//const int S_MAX_LEN = 200 * 1000;
//char buf[S_MAX_LEN + 1];
int M[N][201],nex[N],t[N],zer[N],one,n,k;
string s,ans;
vector < int > a;
int f(int i, int j){
//cout << i << " " << j << " " << h << " aa\n";
if(i >= n) return j==k;
int &r = M[i][j];
if(r != -1) return r;
r = 0;
if(j < k && i+a[j] <= nex[i] && s[ i+a[j] ] != 'X') {
r |= f(i+a[j]+1,j+1);
//cout << i << " " << j << " " << r << " zz\n";
if(r){
zer[ i+a[j] ] = 1;
t[i]++; t[ i+a[j] ]--; }
}
if(s[i] != 'X'){
int t = f(i+1,j);
r |= t;
if(t) zer[i]=1;
}
return r;
}
string solve_puzzle(string ss, vector <int> aa){
s = ss;
a = aa;
n = s.size();
s.pb('.');
k = a.size();
nex[n] = n;
int i,j;
for(i=n-1; i>=0; i--){
nex[i] = nex[i+1];
if(s[i] == '_') nex[i] = i;
}
memset(M , -1 , sizeof M);
f(0,0);
ll x = 0;
for(i=0;i<n;i++){
x += t[i];
one = x>0;
if(s[i] != '.'){
ans.pb(s[i]);
continue;
}
if(zer[i] && one){
ans.pb('?');
}
else if(zer[i]) ans.pb('_');
else ans.pb('X');
}
return ans;
}
Compilation message (stderr)
paint.cpp: In function 'std::__cxx11::string solve_puzzle(std::__cxx11::string, std::vector<int>)':
paint.cpp:43:11: warning: unused variable 'j' [-Wunused-variable]
int i,j;
^
# | 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... |