| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 102836 | daniel920712 | Paint By Numbers (IOI16_paint) | C++14 | 0 ms | 0 KiB |
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 <iostream>
#include <stdio.h>
#include <vector>
#include <utility>
#include "paint.h"
using namespace std;
bool Can[2][200005]={0};
int N,M,ans=0;
bool have[200005][105][2]={0};
bool can[200005][105][2]={0};
int How[200005]={0};
int now=1;
int Big[200005];
string a;
vector < int > c;
int F(int here,int what,int x)
{
int A,b,i;
if(have[here][what][x]) return can[here][what][x];
else if(here==N) return what==M;
else
{
if(x==0&&a[here]=='_'||x==1&&a[here]=='X') return 0;
if(x==0)
{
t=here+c[what];
have[here][what][x]=1;
if(t>N) return 0;
if(what==M) return 0;
if(How[t-1]-How[here]||a[here]=='_') return 0;
A=F(t,what+1,1);
can[here][what][x]=A;
if(A)
{
//printf("%d %d %d\n",here,what,A);
Big[here]=max(Big[here],t-1);
}
}
else
{
have[here][what][x]=1;
A=F(here+1,what,0);
b=F(here+1,what,1);
can[here][what][x]=A||b;
//printf("%d %d %d %d\n",here,what,A,b);
Can[x][here]=can[here][what][x]||Can[x][here];
}
}
return can[here][what][x];
}
string solve_puzzle(string s, vector < int > c)
{
int i,j,big=-1;
a=s;
::c=c;
N=s.length(),M=c.size();
for(i=0;i<N;i++)
{
if(i) How[i]=How[i-1];
How[i]+=(s[i]=='_');
Big[i]=-1;
}
F(0,0,0);
F(0,0,1);
for(i=0;i<N;i++)
{
//printf("%d ",Big[i]);
for(j=max(big,i);j<=max(big,Big[i]);j++) Can[0][j]=1;
big=max(big,Big[i]);
}
//printf("\n");
for(i=0;i<N;i++)
{
if(Can[0][i]==0) s[i]='_';
else if(Can[1][i]==0) s[i]='X';
else s[i]='?';
}
return s;
}