제출 #1079337

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1079337		ALeonidou	Paint By Numbers (IOI16_paint)	C++17	32 / 100	1 ms	668 KiB

paint

#include "paint.h"
#include <bits/stdc++.h>

using namespace std;

#define ll int
#define F first
#define S second
#define sz(x) (ll)x.size()
#define pb push_back

typedef vector <ll> vi;
typedef pair <ll,ll> ii;
typedef vector <ii> vii;

#define dbg(x) cout<<#x<<": "<<x<<endl;
#define dbg2(x,y) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<endl;
#define dbg3(x,y,z) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<endl;

void printVct(vi &v){
    for (ll i= 0; i<sz(v); i++){
        cout<<v[i]<<" ";
    }
    cout<<endl;
}

vi c;
ll fill_in(ll k, ll init_x, ll s, ll e, ll u = -1){
    // dbg3(init_x, s, e);
    ll p = s;   //posisition of last black
    ll x = init_x;   //block index
    if (u == -1){   //just fill in
        while (x < k && p + c[x] + 1 < e){
            p += c[x] + 1;
            x++;
        }
    }
    else{       //include black u
        while (x < k-1 && p + 1 + c[x] < u-1){
            p += c[x] + 1;
            x++;
        }
        // dbg(p);
        p = max(p + c[x] + 1, u);
        // dbg(p);
        if (p >= e){
            return x;
        }
        else{
            x++;
            while (x < k && p + c[x] + 1 < e){
                p += c[x] + 1;
                x++;
            }
        }
    }
    // dbg(x);
    return x;
}

bool checkWhite(ll n, ll k, ll i, vi &whitePoints){
    ll x = 0;
    bool done_i = false;
    ll prev = -1;
    for (ll j =0; j<sz(whitePoints); j++){
        if (!done_i && i < whitePoints[j]){
            x = fill_in(k, x, prev-1, i);
            prev = i;
            done_i = true;
        }
        x = fill_in(k, x, prev-1, whitePoints[j]);
        prev = whitePoints[j];
    }
    return (x >= k);
}

ll checkBlack(ll n, ll k, ll i, vi &whitePoints){
    // dbg(i);
    ll x = 0;
    bool done_i = false;
    ll prev = -1;
    for (ll j =0; j<sz(whitePoints); j++){
        if (!done_i && i < whitePoints[j]){
            ll prevX = x;
            x = fill_in(k, x, prev-1, whitePoints[j], i);
            if (x == prevX) return false;
            done_i = true;
        }
        else{
            x = fill_in(k-(!done_i), x, prev-1, whitePoints[j]);
        }
        prev = whitePoints[j];
    }
    // dbg(x);
    return (x >= k);
}

string solve_puzzle(string s, vi v) {
    c = v;
    ll n = sz(s);
    ll k = sz(c);

    vi whitePoints;
    for (ll i =0; i<n; i++){
        if (s[i] == '_') whitePoints.pb(i);
    }
    whitePoints.pb(n);

    string ans;
    ans.resize(n);
    for (ll i =0; i<n; i++){
        if (s[i] == '_'){
            // dbg(i);
            ans[i] = '_';
            continue;
        }
        bool w = checkWhite(n,k,i,whitePoints);
        bool b = checkBlack(n,k,i,whitePoints);
        if (w && b) ans[i] = '?';
        else if (w) ans[i] = '_';
        else ans[i] = 'X';

        // cout<<endl<<endl;
    }

    return ans;
}

/*
....._.
2 2 2

..........
3 1 3 2
*/

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