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<cstdlib>
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define xx first
#define yy second
using namespace std;
string solve_puzzle(string s, vector<int> c) {
string s_orig = s;
int n = s.length();
int cn = c.size();
for (int ci = 0; ci < cn; ci++){
int l = 0;
int r = n - 1;
for (int cii = 0; cii < ci; cii++){
l += c[cii] + 1;
}
for (int cii = cn - 1; cii > ci; cii--){
r -= c[cii] + 1;
}
for (int i = l; i <= r; i++){
s[i] = '?';
}
int sz = r - l + 1;
int davhtsal = 2*c[ci] - sz;
if (davhtsal > 0){
for (int i = r - c[ci] + 1; i <= r - c[ci] + davhtsal; i++){
s[i] = 'X';
}
}
// cout << r - c[ci] + 1 << '\n';
// cout << s;
// cout << l << ' ' << r << '\n';
}
for(int i = 0; i < n; i++) if(s[i] == '.') s[i] = '_';
// cout << s;
return s;
}
# | 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... |