이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include "paint.h"
using namespace std;
const int mxn = 2e5 + 10;
int pfxW[mxn], pfxB[mxn];
int getW(int l, int r) {
return pfxW[r] - pfxW[l - 1];
}
int getB(int l, int n) {
return pfxB[n - 1] - pfxB[l - 1];
}
string solve(string s, vector<int> c) {
memset(pfxW, 0, sizeof(pfxW));
memset(pfxB, 0, sizeof(pfxB));
s = "." + s;
int n = s.size(), k = c.size();
for (int i = 1; i < n; i++) pfxW[i] = pfxW[i - 1] + (s[i] == '_');
for (int i = 1; i < n; i++) pfxB[i] = pfxB[i - 1] + (s[i] == 'X');
bool dp[n][k + 1];
int from[n][k + 1];
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
int pos = n;
for (int i = 1; i < n; i++) {
if (s[i] != 'X') dp[i][0] = dp[i - 1][0];
for (int j = 1; j <= k; j++) {
if (((j == 1 && i - c[j - 1] >= 0) || (j > 1 && i - c[j - 1] - 1 >= 0)) && getW(i - c[j - 1] + 1, i) == 0) {
if (j < k) {
int val = (j == 1 ? dp[i - c[j - 1]][j - 1] : dp[i - c[j - 1] - 1][j - 1]);
if (val) {
dp[i][j] = 1;
from[i][j] = i - c[j - 1] - 1;
}
}
else if (getB(i + 1, n) == 0) {
int val = (j == 1 ? dp[i - c[j - 1]][j - 1] : dp[i - c[j - 1] - 1][j - 1]);
if (val) {
dp[i][j] = 1;
from[i][j] = i - c[j - 1] - 1;
pos = min(pos, i);
}
}
}
}
}
string ans;
for (int i = 0; i < n; i++) ans += "_";
int cnt = k;
while (pos && cnt) {
if (dp[pos][cnt]) {
for (int i = pos; i > from[pos][cnt] + 1; i--) ans[i] = 'X';
pos = from[pos][cnt];
cnt--;
}
else pos--;
}
return ans.substr(1);
}
string solve_puzzle(string s, vector<int> c) {
string l = solve(s, c);
reverse(s.begin(), s.end());
reverse(c.begin(), c.end());
string r = solve(s, c);
reverse(r.begin(), r.end());
if (l == r) return l;
reverse(s.begin(), s.end());
string ans = "";
for (int i = 0; i < s.size(); i++) ans += "?";
int cntL = 0, cntR = 0;
for (int i = 0; i < s.size(); i++) {
if (l[i] != '_' || r[i] != '_') break;
ans[i] = '_';
}
for (int i = s.size() - 1; i >= 0; i--) {
if (l[i] != '_' || r[i] != '_') break;
ans[i] = '_';
}
for (int i = 0; i < s.size(); i++) {
if (s[i] == '_') ans[i] = '_';
if (l[i] == 'X' && r[i] == 'X' && cntL == cntR) ans[i] = 'X';
if (i && l[i] == '_' && l[i - 1] == 'X') cntL++;
if (i && r[i] == '_' && r[i - 1] == 'X') cntR++;
}
int cntEmpty = 0;
int smallest = c[0];
for (int i = 1; i < c.size(); i++) smallest = min(smallest, c[i]);
return ans;
}
컴파일 시 표준 에러 (stderr) 메시지
paint.cpp: In function 'std::string solve_puzzle(std::string, std::vector<int>)':
paint.cpp:75:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
75 | for (int i = 0; i < s.size(); i++) ans += "?";
| ~~^~~~~~~~~~
paint.cpp:77:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
77 | for (int i = 0; i < s.size(); i++) {
| ~~^~~~~~~~~~
paint.cpp:85:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
85 | for (int i = 0; i < s.size(); i++) {
| ~~^~~~~~~~~~
paint.cpp:93:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
93 | for (int i = 1; i < c.size(); i++) smallest = min(smallest, c[i]);
| ~~^~~~~~~~~~
paint.cpp:91:9: warning: unused variable 'cntEmpty' [-Wunused-variable]
91 | int cntEmpty = 0;
| ^~~~~~~~
# | 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... |