Submission #1214601

#TimeUsernameProblemLanguageResultExecution timeMemory
1214601dostsPaint By Numbers (IOI16_paint)C++20
32 / 100
1 ms328 KiB
#include "paint.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
//#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9;

std::string solve_puzzle(std::string s, std::vector<int> c) {
    int n = s.size(),k = c.size();
    s+='_';
    int dp[n+2][k+1]{};
    dp[0][0] = 1;
    vi pr(n+2,0);
    for (int i=1;i<=n;i++) pr[i] = pr[i-1]+(s[i-1]=='_');
    int dp2[n+2][k+1]{};
    dp2[n+1][0] = 1;
    for (int i = 0;i<=n;i++) {
        for (int j = 0;j<=k;j++) {
            if (i == n) continue;
            if (s[i] != 'X') dp[i+1][j] |= dp[i][j];
            if (j == k) continue;
            int z = c[j];
            if (j < k && i+z <= n && pr[i+z]==pr[i] && s[i+z]!='X') {
                dp[i+z+1][j+1]|=dp[i][j];
            }
        }
    }
    for (int i = n+1;i>=1;i--) {
        for (int j = 0;j<=k;j++) {
            if (s[i-2] != 'X') dp2[i-1][j] |= dp2[i][j];
            if (j == k) continue;
            int z = c[k-j-1];
            if (i-z >= 1 && pr[i]==pr[i-z] && (!(i-z-1) || s[i-z-2]!='X')) {
                dp2[i-z-1][j+1]|=dp2[i][j];
            }
        }
    }
    vi nul(n+1,0),one(n+1,0);
    for (int i=0;i<=n;i++) {
        for (int j = 1;j<=k;j++) {
            if (dp[i][j-1] && i+c[j-1]<=n && pr[i+c[j-1]] == pr[i] && dp2[i+c[j-1]+1][k-j]) {
                one[i+1]++;
                one[i+c[j-1]+1]--;
            }
        }
    }
    for (int i=1;i<=n;i++) one[i]+=one[i-1];
    for (int i=1;i<=n;i++) {
        if (s[i-1] == 'X') one[i] |= 1,nul[i] = 0;
        else if (s[i-1] == '_') nul[i] = 1,one[i] = 0;
        else {
            nul[i] = 0;
            for (int j = 0;j<=k;j++) nul[i]|=(dp[i][j]&&dp2[i][k-j]);
        }
    }
    string ans;
    for (int i=1;i<=n;i++) {
        if (nul[i] && one[i]) ans+='?';
        else if (nul[i]) ans+='_';
        else ans+='X';
    }
    return ans;
}

Compilation message (stderr)

paint.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
paint_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...