제출 #386370

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
386370		ACmachine	Paint By Numbers (IOI16_paint)	C++17	80 / 100	2060 ms	492 KiB

paint

#include "paint.h"
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)

const double EPS = 1e-9;
const int MOD = 1e9+7;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

void DBG(){cout << "]" << endl;}
template<typename T, typename ...U> void DBG(const T& head, const U... args){ cout << head << "; "; DBG(args...); }
#define dbg(...) cout << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__);
#define chk() cout << "Check at line(" << __LINE__ << ") hit." << endl;

template<class T, unsigned int U>
ostream& operator<<(ostream& out, const array<T, U> &v){out << "[";  REP(i, U) out << v[i] << ", ";  out << "]"; return out;}
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}

template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }


std::string solve_puzzle(std::string s, std::vector<int> c) {
    int k = c.size();
    int n = (int)s.length();
    vector<vector<int>> dp(k, vector<int>(n + 1, 0));
    vector<vector<int>> new_dp(k, vector<int>(n + 1, 0));
    auto solve_dp = [&](string ts) -> bool{
        REP(i, k) fill(all(dp[i]), 0);
        REP(i, k) fill(all(new_dp[i]), 0);
        int max_suf = n;
        REPD(i, n - 1){
            if(ts[i] == 'X')
                break;
            max_suf = i;
        }
        dp[0][0] = 1;
        bool can = false;
        REP(i, n){
            REP(j, k){
                REP(g, c[j] + 1){
                    if(dp[j][g] != 1)
                        continue;
                    if(ts[i] == 'X' || ts[i] == '.'){
                        if(g != c[j])
                            new_dp[j][g + 1] = 1;
                    }
                    if(ts[i] == '_' || ts[i] == '.'){
                        if(g == c[j] && j != k - 1)
                            new_dp[j + 1][0] = 1;
                        if(g == 0)
                            new_dp[j][0] = 1;
                    }
                }
            }
            if(new_dp[k - 1][c[k - 1]] && i + 1 >= max_suf)
                can = true;
            dp.swap(new_dp);
            REP(j, k){
                REP(g, c[j] + 1){
                    new_dp[j][g] = 0;
                }
            }
        }
        return can;
    };
    string ns = s;
    string ans(n, '?');

    REP(i, n){
        if(s[i] == 'X')
            ans[i] = 'X';
        else if(s[i] == '_')
            ans[i] = '_';
        else{
            ns[i] = 'X';
            bool canx = solve_dp(ns);
            ns[i] = '_';
            bool cany = solve_dp(ns);
            ns[i] = s[i];
            if(canx && !cany)
                ans[i] = 'X';
            else if(cany && !canx)
                ans[i] = '_';
        }
    }

    return ans;
}

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