oj.uz

Submission #11175

# Submission time Handle Problem Language Result Execution time Memory
11175 2014-11-18T13:27:20 Z gs13068 Sequence (BOI14_sequence) C++
100 / 100
 292 ms 2140 KB 
#include<cstdio>
#include<vector>

std::vector<int> a;
long long min;

void f(int w,std::vector<int> x,int y,int z,int flag)
{
    if(w>5)
    {
        int i,j=0;
        long long k;
        for(i=0;i<x.size();i++)j|=x[i];
        if(j&1)
        {
            for(i=1;i<10;i++)if((j>>i)&1)break;
            if(i==10)i=1;
            k=i*10;
            while(++i<10)if((j>>i)&1)k=k*10+i;
        }
        else
        {
            k=0;
            for(i=1;i<10;i++)if((j>>i)&1)k=k*10+i;
        }
        if(flag&&!k)k=1;
        if(k*z+y<min)min=k*z+y;
        return;
    }
    int i,j,k;
    std::vector<int> t;
    for(i=0;i<x.size();i++)if(x[i])break;
    if(i==x.size())
    {
        if(flag)y+=z;
        if(y<min)min=y;
        return;
    }

    k=0;
    for(j=0;j<x.size();j++)
    {
        if(!j)k|=x[j];
        else k|=x[j]&~(1<<(j%10));
        if(j%10==9)
        {
            t.push_back(k);
            k=0;
        }
    }
    if(j%10)t.push_back(k);
    f(w+1,t,y,z*10,flag);

    for(i=0;i<10;i++)
    {
        t.clear();

        k=0;
        for(j=0;j<x.size();j++)
        {
            k|=x[j]&~(1<<((i+j)%10));
            if((i+j)%10==9)
            {
                t.push_back(k);
                k=0;
            }
        }
        if((i+j)%10)t.push_back(k);
        f(w+1,t,y+i*z,z*10,i==0);
    }
}

int main()
{
    int i,n,t;
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        scanf("%d",&t);
        a.push_back(1<<t);
    }
    min=1e18;
    f(0,a,0,1,0);
    printf("%lld",min);
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 1236 KB Output is correct
2 Correct 216 ms 1236 KB Output is correct
3 Correct 220 ms 1236 KB Output is correct
4 Correct 204 ms 1236 KB Output is correct
5 Correct 188 ms 1236 KB Output is correct
6 Correct 176 ms 1236 KB Output is correct
7 Correct 176 ms 1236 KB Output is correct
8 Correct 184 ms 1236 KB Output is correct
9 Correct 148 ms 1236 KB Output is correct
10 Correct 188 ms 1236 KB Output is correct
11 Correct 204 ms 1236 KB Output is correct
12 Correct 200 ms 1236 KB Output is correct
13 Correct 212 ms 1236 KB Output is correct
14 Correct 204 ms 1236 KB Output is correct
15 Correct 188 ms 1236 KB Output is correct

Subtask #2
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 180 ms 1236 KB Output is correct
2 Correct 204 ms 1236 KB Output is correct
3 Correct 212 ms 1236 KB Output is correct
4 Correct 204 ms 1236 KB Output is correct
5 Correct 188 ms 1236 KB Output is correct
6 Correct 184 ms 1236 KB Output is correct
7 Correct 172 ms 1236 KB Output is correct
8 Correct 188 ms 1236 KB Output is correct
9 Correct 192 ms 1236 KB Output is correct
10 Correct 120 ms 1236 KB Output is correct
11 Correct 192 ms 1236 KB Output is correct
12 Correct 204 ms 1236 KB Output is correct
13 Correct 204 ms 1236 KB Output is correct
14 Correct 208 ms 1236 KB Output is correct
15 Correct 196 ms 1236 KB Output is correct
16 Correct 184 ms 1236 KB Output is correct
17 Correct 212 ms 1236 KB Output is correct
18 Correct 200 ms 1236 KB Output is correct
19 Correct 204 ms 1236 KB Output is correct
20 Correct 188 ms 1236 KB Output is correct
21 Correct 204 ms 1236 KB Output is correct
22 Correct 192 ms 1236 KB Output is correct
23 Correct 184 ms 1236 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 1236 KB Output is correct
2 Correct 196 ms 1236 KB Output is correct
3 Correct 196 ms 1236 KB Output is correct
4 Correct 212 ms 1236 KB Output is correct
5 Correct 208 ms 1236 KB Output is correct
6 Correct 192 ms 1236 KB Output is correct
7 Correct 236 ms 2020 KB Output is correct
8 Correct 224 ms 1672 KB Output is correct
9 Correct 264 ms 2140 KB Output is correct
10 Correct 260 ms 2140 KB Output is correct

Subtask #4
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 1236 KB Output is correct
2 Correct 204 ms 1236 KB Output is correct
3 Correct 216 ms 1236 KB Output is correct
4 Correct 204 ms 1236 KB Output is correct
5 Correct 212 ms 1664 KB Output is correct
6 Correct 184 ms 1236 KB Output is correct
7 Correct 184 ms 1236 KB Output is correct
8 Correct 172 ms 1236 KB Output is correct
9 Correct 184 ms 1236 KB Output is correct
10 Correct 192 ms 1236 KB Output is correct
11 Correct 292 ms 2140 KB Output is correct
12 Correct 268 ms 2140 KB Output is correct
13 Correct 120 ms 1236 KB Output is correct
14 Correct 184 ms 1236 KB Output is correct
15 Correct 208 ms 1236 KB Output is correct
16 Correct 220 ms 1236 KB Output is correct
17 Correct 208 ms 1236 KB Output is correct
18 Correct 196 ms 1236 KB Output is correct
19 Correct 188 ms 1236 KB Output is correct
20 Correct 204 ms 1236 KB Output is correct
21 Correct 196 ms 1236 KB Output is correct
22 Correct 204 ms 1236 KB Output is correct
23 Correct 188 ms 1236 KB Output is correct
24 Correct 200 ms 1236 KB Output is correct
25 Correct 204 ms 1236 KB Output is correct
26 Correct 192 ms 1236 KB Output is correct
27 Correct 200 ms 1236 KB Output is correct
28 Correct 216 ms 1236 KB Output is correct
29 Correct 216 ms 1236 KB Output is correct
30 Correct 212 ms 1236 KB Output is correct
31 Correct 180 ms 1236 KB Output is correct
32 Correct 240 ms 2020 KB Output is correct
33 Correct 216 ms 1672 KB Output is correct
34 Correct 252 ms 2140 KB Output is correct
35 Correct 276 ms 2140 KB Output is correct
36 Correct 228 ms 2032 KB Output is correct
37 Correct 256 ms 2132 KB Output is correct
38 Correct 220 ms 1716 KB Output is correct
39 Correct 264 ms 2140 KB Output is correct
40 Correct 248 ms 2140 KB Output is correct