제출 #713966

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
713966		Spade1	Paint By Numbers (IOI16_paint)	C++14	100 / 100	208 ms	90752 KiB

paint

#include "paint.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;

const int maxN = 2e5 + 10;
const int maxK = 110;

bool dp[maxN][maxK][2], dp2[maxN][maxK][2];
int cntBlack[maxN], cntWhite[maxN];
int canBlack[maxN], canWhite[maxN];

string solve_puzzle(string s, vector<int> c) {
    int N = s.size(), K = c.size();
    for (int i = 1; i <= N; ++i) {
        cntBlack[i] = cntBlack[i-1] + (s[i-1] == 'X');
        cntWhite[i] = cntWhite[i-1] + (s[i-1] == '_');
    }
    dp[0][0][0] = 1;
    for (int i = 1; i <= N; ++i) dp[i][0][0] = (cntBlack[i] == 0);
    for (int i = 1; i <= N; ++i) {
        for (int j = 1; j <= K; ++j) {
            if (s[i-1] != 'X') dp[i][j][0] = dp[i-1][j][0] || dp[i-1][j][1];
            if (s[i-1] != '_') dp[i][j][1] = (i >= c[j-1]) && (cntWhite[i] - cntWhite[i-c[j-1]] == 0) && dp[i-c[j-1]][j-1][0];
        }
    }

    dp2[N+1][K+1][0] = 1;
    for (int i = N; i >= 1; --i) dp2[i][K+1][0] = (cntBlack[N] - cntBlack[i-1]) == 0;
    for (int i = N; i >= 1; --i) {
        for (int j = K; j >= 1; --j) {
            if (s[i-1] != 'X') dp2[i][j][0] = dp2[i+1][j][0] || dp2[i+1][j][1];
            if (s[i-1] != '_') dp2[i][j][1] = (N-i+1 >= c[j-1]) && (cntWhite[i+c[j-1]-1] - cntWhite[i-1]) == 0 && dp2[i+c[j-1]][j+1][0];
        }
    }

    for (int i = 1; i <= N; ++i) {
        for (int j = 0; j <= K; ++j) {
            if (dp[i][j][0] && (dp2[i+1][j+1][0] || dp2[i+1][j+1][1])) canWhite[i]++, canWhite[i+1]--;
            if (dp[i][j][1] && dp2[i+1][j+1][0]) canBlack[i-c[j-1]+1]++, canBlack[i+1]--;
        }
    }
    for (int i = 1; i <= N; ++i) canBlack[i] += canBlack[i-1], canWhite[i] += canWhite[i-1];

    string ans = "";
    for (int i = 1; i <= N; ++i) {
        if (canBlack[i] > 0 && canWhite[i] > 0) ans += "?";
        if (canBlack[i] > 0 && canWhite[i] == 0) ans += "X";
        if (canBlack[i] == 0 && canWhite[i] > 0) ans += "_";
    }
    return ans;
}

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