제출 #375047

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

paint

#include "paint.h"
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define repa(i,a,b) for(int i = (a); i >= (b); i--)
#define lli long long int
#define debug(a) cout << #a << " = " << a<< endl
#define nl "\n";

lli cont,mayor,sobrantes,n,a;
lli arr[1002];
string res;

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

    cont = 0;
    for(auto act : c){
        if (cont > 0) arr[cont++] = 0;
        rep(i,1,act) arr[cont++] = i;
    }
    n = s.size();
    sobrantes = n-cont;
    res.resize(n);

    if (sobrantes == 0){
        rep(i,0,n-1) {
            if (arr[i] == 0) res[i] = '_';
            else res[i] = 'X';
        }
        return res;
    }

    mayor = 0;
    repa(i,n-1,0) {
        if(arr[i] > mayor) {
            mayor = arr[i];
            if (mayor < sobrantes){
                a = sobrantes - mayor;
                rep(j,1,a) {
                    res[i+j] = '?';
                    res[i+j+mayor] = '?';
                }
            }
        }
        else if (arr[i] == 0) {
            mayor = 0;
            continue;
        }

        if (arr[i] <= sobrantes) {
            res[i] = '?';
            res[i+mayor] = '?';
        }
    }

    rep(i,0,n-1) if (res[i] != '?') res[i] = 'X';
    return res;
}

• 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