# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
619648 | Bench0310 | Paint By Numbers (IOI16_paint) | C++17 | 568 ms | 524288 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include "paint.h"
using namespace std;
typedef long long ll;
string solve_puzzle(string s,vector<int> c)
{
int n=s.size();
int k=c.size();
c.insert(c.begin(),0);
s="$"+s;
vector<int> wsum(n+1,0);
for(int i=1;i<=n;i++) wsum[i]=wsum[i-1]+(s[i]=='_');
auto ws=[&](int l,int r)->int{return (wsum[r]-wsum[l-1]);};
vector one(n+1,vector(k+1,vector(2,bool(0))));
one[0][0][1]=1;
for(int i=1;i<=n;i++)
{
//extend
for(int j=0;j<=k;j++) one[i][j][1]=((one[i-1][j][0]||one[i-1][j][1])&&(s[i]!='X'));
//new block
for(int j=1;j<=k;j++) if(i-c[j]>=0) one[i][j][0]=(one[i-c[j]][j-1][1]&&ws(i-c[j]+1,i)==0);
}
vector two(n+2,vector(k+2,vector(2,bool(0))));
two[n+1][k+1][1]=1;
for(int i=n;i>=1;i--)
{
//extend
for(int j=1;j<=k+1;j++) two[i][j][1]=((two[i+1][j][0]||two[i+1][j][1])&&(s[i]!='X'));
# | 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... |