| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1304843 | neonglitch | Paint By Numbers (IOI16_paint) | C++20 | 4 ms | 576 KiB |
#include <iostream>
#include <vector>
using namespace std;
const int N=105,K=105;
int mx[N];
bool dp[N][K][2];
bool check(string& s,vector<int>& c)
{
int n=s.size(),k=c.size();
for(int i=0;i<=n;i++)
{
for(int j=0;j<=k;j++)
{
dp[i][j][0]=dp[i][j][1]=0;
}
}
for(int i=0;i<n;i++)
{
mx[i]=i;
while(mx[i]<n and s[mx[i]]!='_' )mx[i]++;
// exc
}
dp[0][0][0]=1;
for(int i=0;i<n;i++)
{
for(int j=0;j<=k;j++)
{
dp[i+1][j][0]|=((dp[i][j][0]|dp[i][j][1])&(s[i]!='X')); // cell is not black and we can fix before it ending in b or w
if(j<k and i+c[j] <= mx[i])
{
dp[i+c[j]][j+1][1]|=(dp[i][j][0]);
}
}
}
return dp[n][k][0]|dp[n][k][1];
}
string solve_puzzle(string s,vector<int> c)
{
int n=s.size();
string ans;
for(int i=0;i<n;i++)
{
if(s[i]!='.')
{
ans+=s[i];
}
else{
s[i]='_';
bool wh=check(s,c);
s[i]='X';
bool bk=check(s,c);
s[i]='.';
if(wh && bk)
{
ans+='?';
}
else if(wh){
ans+='_';
}
else{
ans+='X';
}
}
}
return ans;
}
컴파일 시 표준 에러 (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... | ||||
