oj.uz

Submission #11577

# Submission time Handle Problem Language Result Execution time Memory
11577 2014-12-02T14:19:29 Z gs14004 Sequence (BOI14_sequence) C++
67 / 100
 1000 ms 2144 KB 
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

int n;
long long res = 1e16, p[17];

void solve(vector<int> bit, long long cb, int depth, int had_zero){
    if(cb >= res) return;
    if(bit.size() == 1){
        int r = bit[0];
        if(r == 0){
            if(cb == 0 || had_zero) cb += p[depth];
        }
        else if(r == 1){
            cb += p[depth] * 10;
        }
        else{
            if(r&1){
                int minima = 1e9;
                for (int i=9; i; i--) {
                    if((r>>i)&1) minima = i;
                }
                for (int i=9; i; i--) {
                    if((r>>i)&1 && i != minima){
                        cb += p[depth] * i;
                        depth++;
                    }
                }
                depth++;
                cb += p[depth] * minima;
            }
            else{
                for (int i=9; i; i--) {
                    if((r>>i)&1){
                        cb += p[depth] * i;
                        depth++;
                    }
                }
            }
        }
        res = min(res,cb);
        return;
    }
    vector<int> v2;
    for (int i=0; i<10; i++) {
        int gz = 0;
        int piv = i;
        v2.clear();
        v2.push_back(0);
        for (int j=0; j<bit.size(); j++) {
            if(piv == 0 && (bit[j]&1)) gz = 1;
            v2.back() |= (bit[j] & (~(1<<piv)));
            piv++;
            if(piv == 10 && j != bit.size() - 1){
                v2.push_back(0);
                piv = 0;
            }
        }
        solve(v2,cb + p[depth] * i,depth+1,gz);
    }
}

int main(){
    vector<int> v;
    scanf("%d",&n);
    p[0] = 1;
    for (int i=1; i<17; i++) {
        p[i] = p[i-1] * 10;
    }
    for (int i=0; i<n; i++) {
        int t;
        scanf("%d",&t);
        v.push_back(1<<t);
    }
    solve(v,0,0,0);
    printf("%lld",res);
}

Subtask #1
9.0 / 9.0

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

Subtask #2
33.0 / 33.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1240 KB Output is correct
2 Correct 20 ms 1240 KB Output is correct
3 Correct 24 ms 1240 KB Output is correct
4 Correct 20 ms 1240 KB Output is correct
5 Correct 28 ms 1240 KB Output is correct
6 Correct 8 ms 1240 KB Output is correct
7 Correct 80 ms 2024 KB Output is correct
8 Correct 64 ms 1676 KB Output is correct
9 Correct 124 ms 2144 KB Output is correct
10 Correct 128 ms 2144 KB Output is correct

Subtask #4
0.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1240 KB Output is correct
2 Correct 0 ms 1240 KB Output is correct
3 Correct 0 ms 1240 KB Output is correct
4 Correct 0 ms 1240 KB Output is correct
5 Correct 184 ms 1668 KB Output is correct
6 Correct 0 ms 1240 KB Output is correct
7 Correct 0 ms 1240 KB Output is correct
8 Correct 0 ms 1240 KB Output is correct
9 Correct 0 ms 1240 KB Output is correct
10 Correct 0 ms 1240 KB Output is correct
11 Correct 212 ms 2144 KB Output is correct
12 Correct 124 ms 2144 KB Output is correct
13 Correct 0 ms 1240 KB Output is correct
14 Correct 4 ms 1240 KB Output is correct
15 Correct 4 ms 1240 KB Output is correct
16 Correct 0 ms 1240 KB Output is correct
17 Correct 0 ms 1240 KB Output is correct
18 Correct 0 ms 1240 KB Output is correct
19 Correct 0 ms 1240 KB Output is correct
20 Correct 0 ms 1240 KB Output is correct
21 Correct 0 ms 1240 KB Output is correct
22 Correct 0 ms 1240 KB Output is correct
23 Correct 8 ms 1240 KB Output is correct
24 Correct 0 ms 1240 KB Output is correct
25 Correct 8 ms 1240 KB Output is correct
26 Correct 8 ms 1240 KB Output is correct
27 Correct 24 ms 1240 KB Output is correct
28 Correct 24 ms 1240 KB Output is correct
29 Correct 16 ms 1240 KB Output is correct
30 Correct 28 ms 1240 KB Output is correct
31 Correct 8 ms 1240 KB Output is correct
32 Correct 84 ms 2024 KB Output is correct
33 Correct 60 ms 1676 KB Output is correct
34 Correct 124 ms 2144 KB Output is correct
35 Correct 128 ms 2144 KB Output is correct
36 Correct 476 ms 2036 KB Output is correct
37 Correct 604 ms 2136 KB Output is correct
38 Correct 584 ms 1720 KB Output is correct
39 Execution timed out 1000 ms 2144 KB Program timed out
40 Halted 0 ms 0 KB -