# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
619650 | Bench0310 | Paint By Numbers (IOI16_paint) | C++17 | 372 ms | 160592 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 <bits/stdc++.h>
#include "paint.h"
using namespace std;
typedef long long ll;
const int N=200000;
const int K=200;
bool one[N+1][K+1][2];
bool two[N+2][K+2][2];
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]);};
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);
}
two[n+1][k+1][1]=1;
for(int i=n;i>=1;i--)
# | 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... |