Submission #313064

#	Time	Username	Problem	Language	Result	Execution time	Memory
313064		anakib1	Paint By Numbers (IOI16_paint)	C++17	100 / 100	906 ms	93196 KiB

paint

//나는 가상 소녀들에게 큰 호감이 있습니다.

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <chrono>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <deque>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <stdarg.h>
#include <utility>

using namespace std;

#define pb push_back
#define mp make_pair
#define ll long long
#define ull unisgned long long
#define ld long double
#define all(a) a.begin(), a.end()
#define SORT(a) sort(all(a))
#define pii pair<int, int>
#define tii triple<int, int, int>
#define e 1e-7
#define PI acos(-1)
#define sz(a) (int)(a.size())
#define inf 1e17
#define vi vector<int>
#define F first
#define S second
#define rng(x) for(int _ = 0; _ < (x); _++)
#define rngi(i, x) for(int i = 0; i < (x); i++)
#define rngsi(s, i, x) for(int i = (s); i <(x); i++)
#define problem "a"

template<typename A, typename B, typename C>
struct triple {
    A X;
    B Y;
    C Z;
    triple(A a = 0, B b = 0, C c = 0) :X(a), Y(b), Z(c) {}
};
template<typename A, typename B, typename C>
triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0) {
    return triple<A, B, C>(a, b, c);
}
template<typename A, typename B, typename C>
bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b) {
    if (a.X != b.X)
        return a.X < b.X;
    if (a.Y != b.Y)
        return a.Y < b.Y;
    return a.Z < b.Z;
}
template<typename T, typename SS>
ostream& operator<<(ostream& ofs, const pair<T, SS>& p) {
    ofs << "( " << p.F << " , " << p.S << " )";
    return ofs;
}
template<typename T>
void print(T a) {
    for (auto i : a)
        cout << i << ' ';
    cout << '\n';
}
template<typename T>
T max(T a, T b, T c) {
    return max(a, max(b, c));
}
template<typename T>
T min(T a, T b, T c) {
    return min(a, min(b, c));
}
template<typename T, typename D>
D min(T a) {
    return *min_element(all(a));
}
template<typename T, typename D>
D max(T a) {
    return *max_element(all(a));
}
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
#define mxn (int)(2e5+2)
#define mxk (int)(1e2+2)

bool dpl[mxn][mxk][2], dpr[mxn][mxk][2];

string solve_puzzle(std::string s, std::vector<int> c) {
    int n = sz(s), k = sz(c);
    vector<vi> sum(n + 1, vi(2));
    rngi(i, n) {
        sum[i + 1][0] = sum[i][0] + (s[i] == '_');
        sum[i + 1][1] = sum[i][1] + (s[i] == 'X');
    }
    dpl[0][0][0] = 1;
    rngi(i, n) dpl[i + 1][0][0] = dpl[i][0][0] && (s[i] != 'X');
    for (int j = 1; j <= k; j++)
        for (int i = 1; i <= n; i++) {
            if (i >= c[j - 1]) dpl[i][j][1] = dpl[i - c[j - 1]][j - 1][0] && (sum[i][0] - sum[i - c[j - 1]][0] == 0);
            dpl[i][j][0] = (dpl[i - 1][j][0] || dpl[i - 1][j][1]) && (s[i - 1] != 'X');
        }
    dpr[n + 1][0][0] = 1;
    for (int i = n; i >= 1; i--) dpr[i][0][0] = dpr[i + 1][0][0] && (s[i - 1] != 'X');
    for (int j = 1; j <= k; j++)
        for (int i = n; i >= 1; i--) {
            if (i + c[k - j] - 1 <= n) dpr[i][j][1] = dpr[i + c[k - j]][j - 1][0] && (sum[i + c[k - j] - 1][0] - sum[i - 1][0] == 0);
            dpr[i][j][0] = (dpr[i + 1][j][0] || dpr[i + 1][j][1]) && (s[i - 1] != 'X');
        }
    vi cnt(n + 2);
    for (int i = 1; i <= n; i++) for (int j = 1; j <= k; j++) if (dpl[i][j][1] && dpr[i + 1][k - j][0]) cnt[i + 1] --, cnt[i - c[j - 1] + 1]++;
    rngi(i, n) cnt[i + 1] += cnt[i];
    string r = "";
    for (int i = 1; i <= n; i++){
        if (cnt[i] > 0) {
            bool w = 0;
            rngi(j, k + 1)
                w |= (dpl[i][j][0] && dpr[i][k - j][0]);
            r += "X?"[w];
        }
        else r += '_';
    }
    return r;
}

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