oj.uz

답안 #11574

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
11574 2014-12-02T13:57:46 Z gs14004 수열 (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{
            vector<int> v;
            for (int i=9; i>=0; i--) {
                if((r>>i)&1) v.push_back(i);
            }
            if(v.back() == 0){
                swap(v[v.size() - 2],v.back());
            }
            for (int i=0; i<v.size(); i++) {
                cb += p[depth] * v[i];
                depth++;
            }
        }
        res = min(res,cb);
        return;
    }
    for (int i=0; i<10; i++) {
        int gz = 0;
        vector<int> v2;
        int piv = i;
        v2.push_back(0);
        for (int j=0; j<bit.size(); j++) {
            if(bit[j]&1 && piv == 0) gz = 1;
            v2.back() |= (bit[j] & (~(1<<piv)));
            if(piv == 9 && j != bit.size() - 1){
                v2.push_back(0);
                piv = -1;
            }
            piv++;
        }
        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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1240 KB Output is correct
2 Correct 4 ms 1240 KB Output is correct
3 Correct 0 ms 1240 KB Output is correct
4 Correct 4 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 16 ms 1240 KB Output is correct
11 Correct 4 ms 1240 KB Output is correct
12 Correct 0 ms 1240 KB Output is correct
13 Correct 4 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1240 KB Output is correct
2 Correct 12 ms 1240 KB Output is correct
3 Correct 0 ms 1240 KB Output is correct
4 Correct 4 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 24 ms 1240 KB Output is correct
12 Correct 16 ms 1240 KB Output is correct
13 Correct 4 ms 1240 KB Output is correct
14 Correct 0 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 4 ms 1240 KB Output is correct
19 Correct 4 ms 1240 KB Output is correct
20 Correct 36 ms 1240 KB Output is correct
21 Correct 12 ms 1240 KB Output is correct
22 Correct 40 ms 1240 KB Output is correct
23 Correct 40 ms 1240 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1240 KB Output is correct
2 Correct 44 ms 1240 KB Output is correct
3 Correct 44 ms 1240 KB Output is correct
4 Correct 28 ms 1240 KB Output is correct
5 Correct 44 ms 1240 KB Output is correct
6 Correct 8 ms 1240 KB Output is correct
7 Correct 136 ms 2024 KB Output is correct
8 Correct 120 ms 1676 KB Output is correct
9 Correct 212 ms 2144 KB Output is correct
10 Correct 228 ms 2144 KB Output is correct

Subtask #4
0.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1240 KB Output is correct
2 Correct 8 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 684 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 452 ms 2144 KB Output is correct
12 Correct 268 ms 2144 KB Output is correct
13 Correct 0 ms 1240 KB Output is correct
14 Correct 24 ms 1240 KB Output is correct
15 Correct 16 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 4 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 4 ms 1240 KB Output is correct
22 Correct 4 ms 1240 KB Output is correct
23 Correct 32 ms 1240 KB Output is correct
24 Correct 12 ms 1240 KB Output is correct
25 Correct 40 ms 1240 KB Output is correct
26 Correct 40 ms 1240 KB Output is correct
27 Correct 44 ms 1240 KB Output is correct
28 Correct 44 ms 1240 KB Output is correct
29 Correct 28 ms 1240 KB Output is correct
30 Correct 44 ms 1240 KB Output is correct
31 Correct 16 ms 1240 KB Output is correct
32 Correct 132 ms 2024 KB Output is correct
33 Correct 120 ms 1676 KB Output is correct
34 Correct 208 ms 2144 KB Output is correct
35 Correct 228 ms 2144 KB Output is correct
36 Execution timed out 1000 ms 2036 KB Program timed out
37 Halted 0 ms 0 KB -