제출 #618093

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
618093		A_D	Paint By Numbers (IOI16_paint)	C++14	59 / 100	5 ms	380 KiB

paint

#include "paint.h"

#include <bits/stdc++.h>

using namespace std;

const int N=2e2+10;
int dp[N][N];
string ss;
vector<int> cc;
int n,k,m;
string tr;


int okx()
{
    dp[0][0]=1;
    bool f=1;
    for(int i=1;i<=n;i++){
        if(f&&(ss[i-1]!='X')){
            dp[i][0]=1;
        }
        else{
            f=0;
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            dp[i][j]=0;
            if(((ss[i-1]!='X')&&((tr[j-1]!='X')||(j==m)))){
                dp[i][j]|=dp[i-1][j];
            }
            if((ss[i-1]!='_')&&(tr[j-1]=='X')){
                dp[i][j]|=dp[i-1][j-1];
            }
            if((ss[i-1]!='X')&&(tr[j-1]=='_')){
                dp[i][j]|=dp[i-1][j-1];
            }
        }
    }
    return dp[n][m];
}

string solve_puzzle(string s,vector<int> c){

    string ans=s;

    cc=c;
    ss=s;
    n=s.size();
    k=c.size();
    for(int i=0;i<k;i++){
        for(int j=0;j<c[i];j++){
            tr+='X';
        }
        tr+='_';
    }
    tr.pop_back();
    m=tr.size();
    for(int i=0;i<n;i++){
        if(s[i]!='.')continue;
        int ok=0;
        ss[i]='X';
        ok+=okx();
        ss[i]='_';
        ok+=2*okx();
        ss[i]='.';
        if(ok==1)ans[i]='X';
        if(ok==2)ans[i]='_';
        if(ok==3)ans[i]='?';
    }
    return ans;
}

• Subtask 1: 7 / 7
• Subtask 2: 3 / 3
• Subtask 3: 22 / 22
• Subtask 4: 27 / 27
• Subtask 5: 0 / 21
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10