제출 #1010209

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

paint

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "paint.h"

string solve_puzzle(string s, VI c) {
    int n = s.size();
    int k = c.size();
    int sum = k-1;
    for (int x : c) sum += x;
    string ans;
    if (sum == n) ans = string(n, '_');
    else ans = string(n, '?');
    rep(i, k) {
        int l = 0;
        int r = n-1;
        replr(j, 0, i-1) l += c[j]+1;
        replr(j, i+1, k-1) r -= c[j]+1;
        replr(j, r-c[i]+1, l+c[i]-1) ans[j] = 'X';
    }
    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