제출 #599695

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

paint

#include "paint.h"

#include <bits/stdc++.h>

using namespace std;

string solve_puzzle(string s, vector<int> c) {
    int n = c.size();
    int m = s.size();
    vector <int> beg(n+1);
    int cnt = 0, pos = 0;
    for (int i = 0; i < m and pos < n; i ++) {
        if (s[i] == '.') cnt ++;
        else cnt = 0;
        if (cnt == c[pos]) {
            beg[pos ++] = i - cnt + 1;
            cnt = 0;
            i ++;
        }
    }
    string res = s;
    beg[n] = m + 1;
    for (int i = n - 1; i >= 0; i --) {
        int last = beg[i];
        for (int j = beg[i] + 1; j + c[i] < beg[i+1]; j ++) {
            int flag = 0;
            for (int k = j; k < j + c[i]; k ++) {
                if (s[k] == '_') flag = 1;
            }
            if (!flag) {
                for (int k = last; k < min(last + c[i], j); k ++) {
                    res[k] = '?';
                }
                last = j;
            }
        }
        for (int j = last; j < last + c[i]; j ++) {
            res[j] = '?';
        }
        if (last < beg[i] + c[i]) {
            for (int j = last; j < beg[i] + c[i]; j ++) {
                res[j] = 'X';
            }
        }
        beg[i] = last;
    }
    for (int i = 0; i < m; i ++) {
        if (res[i] == '.') res[i] = '_';
    }
    return res;
}

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