제출 #562764

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

paint

#include "paint.h"
#include <bits/stdc++.h>
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vii;

const int MAX_N = 2e5 + 5;

int cnt[MAX_N];

std::string solve_puzzle(std::string s, std::vector<int> c) {
    int n = s.size();
    int k = c.size();
    int sum = k - 1;
    for (int d : c) sum += d;
    for (int j = 0; j <= n - sum; j++) {
        int ind = j;
        for (int l = 0; l < k; l++) {
            int d = c[l];
            for (int i = ind; i < ind + d; i++) cnt[i]++;
            ind += d + 1;
        }
//        ind = n - 1;
//        for (int l = k - 1; l >= j; l--) {
//            int d = c[l];
//            for (int i = ind; i > ind - d; i--) cnt[i]++;
//            ind -= d + 1;
//        }
    }
    string ans(n, '?');
    for (int i = 0; i < n; i++) {
        if (cnt[i] == n - sum + 1) ans[i] = 'X';
        else if (!cnt[i]) ans[i] = '_';
    }
    return ans;
}

• 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