Submission #788170

#	Time	Username	Problem	Language	Result	Execution time	Memory
788170		Ahmed57	Sequence (BOI14_sequence)	C++17	100 / 100	561 ms	1428 KiB

sequence

#include <bits/stdc++.h>

using namespace std;

long long ans = LLONG_MAX, pw[18];

void solve(vector<int> sections, long long curr = 0, int level = 0, bool had_zero = false) {
    if (curr > ans) return;
    int n = sections.size();

    if (n == 1) {
        int mask = sections[0];
        if (!mask) {
            if (!curr || had_zero) curr += pw[level];
        } else if (mask == 1) curr += pw[level + 1];
        else {
            if (mask & 1) {
                int mn = 10;
                for (int i = 9; i; i--) {
                    if (mask & (1 << i)) mn = i;
                }
                for (int i = 9; i; i--) {
                    if ((mask & (1 << i)) && i != mn) curr += i * pw[level++];
                }
                curr += mn * pw[++level];
            } else {
                for (int i = 9; i; i--) {
                    if (mask & (1 << i)) curr += i * pw[level++];
                }
            }
        }
        ans = min(ans, curr);
        return;
    }
    for(int i = 0;i<10;i++){
        vector<int> merged;
        int ins = 0;
        bool zero = false;

        int piv = i;
        for(int j = 0;j<n;j++){
            zero |= (piv == 0 && (sections[j] & 1));
            ins |= (sections[j] & (~(1 << piv)));
            piv++;
            if (piv == 10) {
                merged.push_back(ins);
                ins = piv = 0;
            }
        }
        if (piv) merged.push_back(ins);

        solve(merged, curr + pw[level] * i, level + 1, zero);
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    vector<int> sections(n);
    for(int i = 0;i<n;i++){
        int x;
        cin>>x;
        sections[i]=(1<<x);
    }
    pw[0] = 1;
    for(int i = 1;i<18;i++) pw[i] = 10 * pw[i - 1];
    solve(sections);
    cout << ans;
    return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 33 / 33
• Subtask 3: 25 / 25
• Subtask 4: 33 / 33