oj.uz

Submission #190162

# Submission time Handle Problem Language Result Execution time Memory
190162 2020-01-14T06:58:04 Z dolphingarlic Sequence (BOI14_sequence) C++14
67 / 100
 1000 ms 1528 KB 
#include <bits/stdc++.h>
#pragma GCC Optimize("unroll-loops")
#pragma GCC Optimize("O3")
#pragma GCC target("sse4,avx2,fma,avx")
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

ll ans = LLONG_MAX, pw[18];

void solve(vector<int> sections, ll 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 == 0) {
            if (curr == 0 || 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(i, 0, 10) {
        vector<int> merged;
        int ins = 0;
        bool zero = false;

        int piv = i;
        FOR(j, 0, n) {
            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(i, 0, n) {
        int x;
        cin >> x;
        sections[i] = 1 << x;
    }
    pw[0] = 1;
    FOR(i, 1, 18) pw[i] = 10 * pw[i - 1];

    solve(sections);
    cout << ans;
    return 0;
}

Compilation message

sequence.cpp:2:0: warning: ignoring #pragma GCC Optimize [-Wunknown-pragmas]
 #pragma GCC Optimize("unroll-loops")
 
sequence.cpp:3:0: warning: ignoring #pragma GCC Optimize [-Wunknown-pragmas]
 #pragma GCC Optimize("O3")

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 292 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 7 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 1 ms 376 KB Output is correct
15 Correct 4 ms 412 KB Output is correct

Subtask #2
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 420 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 11 ms 476 KB Output is correct
12 Correct 8 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 4 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 4 ms 376 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 13 ms 504 KB Output is correct
21 Correct 5 ms 380 KB Output is correct
22 Correct 13 ms 396 KB Output is correct
23 Correct 14 ms 400 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 28 ms 524 KB Output is correct
3 Correct 28 ms 512 KB Output is correct
4 Correct 26 ms 500 KB Output is correct
5 Correct 37 ms 516 KB Output is correct
6 Correct 13 ms 464 KB Output is correct
7 Correct 100 ms 1144 KB Output is correct
8 Correct 75 ms 904 KB Output is correct
9 Correct 140 ms 1424 KB Output is correct
10 Correct 140 ms 1400 KB Output is correct

Subtask #4
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 292 KB Output is correct
2 Correct 5 ms 380 KB Output is correct
3 Correct 2 ms 404 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 221 ms 888 KB Output is correct
6 Correct 0 ms 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 404 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 0 ms 376 KB Output is correct
11 Correct 246 ms 1484 KB Output is correct
12 Correct 142 ms 1500 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 11 ms 480 KB Output is correct
15 Correct 7 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 4 ms 380 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 4 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 5 ms 348 KB Output is correct
23 Correct 13 ms 376 KB Output is correct
24 Correct 5 ms 416 KB Output is correct
25 Correct 15 ms 376 KB Output is correct
26 Correct 15 ms 376 KB Output is correct
27 Correct 28 ms 504 KB Output is correct
28 Correct 28 ms 604 KB Output is correct
29 Correct 25 ms 504 KB Output is correct
30 Correct 37 ms 504 KB Output is correct
31 Correct 14 ms 504 KB Output is correct
32 Correct 103 ms 1144 KB Output is correct
33 Correct 64 ms 900 KB Output is correct
34 Correct 140 ms 1528 KB Output is correct
35 Correct 140 ms 1496 KB Output is correct
36 Correct 558 ms 1180 KB Output is correct
37 Correct 707 ms 1468 KB Output is correct
38 Correct 666 ms 892 KB Output is correct
39 Execution timed out 1002 ms 1496 KB Time limit exceeded
40 Halted 0 ms 0 KB -