Submission #1224664

#	Time	Username	Problem	Language	Result	Execution time	Memory
1224664		LIA	Paint By Numbers (IOI16_paint)	C++17	32 / 100	0 ms	328 KiB

paint

#include "paint.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef tuple <ll,ll,ll> plll;
typedef vector <plll> vplll;
typedef pair <ll,ll> pll;
typedef vector <ll> vll;
typedef vector <pll> vpll;
typedef vector <vector <pll>> vvpll;
typedef vector <vector <ll>> vvll;
typedef vector <bool> vb;
typedef vector <vector <bool>> vvb;
#define loop(i, s, e) for (ll i = (s); i < (e); ++i)
#define loopr(i, e, s) for (ll i = (e)-1; i >= (s); --i)
#define all(a) a.begin(), a.end()
const ll inf = 1e9 + 7;

string solve_puzzle(string s, vector<int> c) {
    int n = s.size(), k = c.size();
    vector<ll> vis(n, 0), l(k), r(k);
    ll sum = 0;
    for (int i = 0; i < k; ++i) {
        l[i] = sum;
        sum += c[i] + 1;
    }
    sum = n;
    for (int i = k - 1; i >= 0; --i) {
        r[i] = sum - c[i];
        sum -= c[i] + 1;
    }
    string ans(n, '?');
    vector<int> vis2(n);
    for (int i = 0; i < k; ++i) {
        for (int x = l[i]; x < l[i] + c[i]; ++x) {
            vis[x]++;
            vis2[x]++;
        }
        for (int x = r[i]; x < r[i] + c[i]; ++x){
            vis[x]++;
            vis2[x]++;
        }
        for (int x = 0 ; x<n ; ++x) {
            if (vis[x] == 2) {
                ans[x] = 'X';
            }
            vis[x] = 0;
        }
    }
    loop(x,0,n) {
        bool coverable = false;
        for (int i = 0; i < k; ++i) {
            if (x >= l[i] && x <= r[i] + c[i] - 1) {
                coverable = true;
                break;
            }
        }
        if (!coverable)
            ans[x] = '_';
    }

    return ans;
}

Compilation message (stderr)

paint.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
paint_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

• 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