답안 #230080

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
230080 2020-05-08T06:43:45 Z dolphingarlic 수열 (BOI14_sequence) C++14
67 / 100
1000 ms 1528 KB
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;
 
ll ans = 8e13, 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) {
            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(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;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 8 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 9 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 8 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 13 ms 384 KB Output is correct
12 Correct 9 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Correct 6 ms 384 KB Output is correct
18 Correct 6 ms 384 KB Output is correct
19 Correct 6 ms 384 KB Output is correct
20 Correct 15 ms 384 KB Output is correct
21 Correct 7 ms 384 KB Output is correct
22 Correct 15 ms 384 KB Output is correct
23 Correct 16 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 28 ms 384 KB Output is correct
3 Correct 29 ms 512 KB Output is correct
4 Correct 28 ms 384 KB Output is correct
5 Correct 37 ms 384 KB Output is correct
6 Correct 15 ms 384 KB Output is correct
7 Correct 98 ms 1024 KB Output is correct
8 Correct 71 ms 768 KB Output is correct
9 Correct 132 ms 1280 KB Output is correct
10 Correct 129 ms 1280 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 8 ms 396 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 200 ms 768 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 232 ms 1400 KB Output is correct
12 Correct 133 ms 1280 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 12 ms 384 KB Output is correct
15 Correct 9 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 6 ms 384 KB Output is correct
19 Correct 6 ms 384 KB Output is correct
20 Correct 6 ms 384 KB Output is correct
21 Correct 6 ms 384 KB Output is correct
22 Correct 6 ms 384 KB Output is correct
23 Correct 15 ms 384 KB Output is correct
24 Correct 8 ms 384 KB Output is correct
25 Correct 15 ms 432 KB Output is correct
26 Correct 16 ms 384 KB Output is correct
27 Correct 28 ms 384 KB Output is correct
28 Correct 29 ms 384 KB Output is correct
29 Correct 28 ms 384 KB Output is correct
30 Correct 37 ms 512 KB Output is correct
31 Correct 15 ms 384 KB Output is correct
32 Correct 104 ms 1144 KB Output is correct
33 Correct 71 ms 768 KB Output is correct
34 Correct 133 ms 1280 KB Output is correct
35 Correct 134 ms 1280 KB Output is correct
36 Correct 520 ms 1272 KB Output is correct
37 Correct 643 ms 1400 KB Output is correct
38 Correct 573 ms 896 KB Output is correct
39 Execution timed out 1027 ms 1528 KB Time limit exceeded
40 Halted 0 ms 0 KB -