oj.uz

Submission #11177

# Submission time Handle Problem Language Result Execution time Memory
11177 2014-11-18T13:31:12 Z gs13068 Sequence (BOI14_sequence) C++
25 / 100
 308 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(z>=a.size()*10)
    {
        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
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1236 KB Output is correct
2 Correct 0 ms 1236 KB Output is correct
3 Correct 0 ms 1236 KB Output is correct
4 Incorrect 0 ms 1236 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1236 KB Output is correct
2 Correct 0 ms 1236 KB Output is correct
3 Correct 0 ms 1236 KB Output is correct
4 Incorrect 0 ms 1236 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 224 ms 1236 KB Output is correct
5 Correct 216 ms 1236 KB Output is correct
6 Correct 24 ms 1236 KB Output is correct
7 Correct 272 ms 2020 KB Output is correct
8 Correct 244 ms 1672 KB Output is correct
9 Correct 308 ms 2140 KB Output is correct
10 Correct 308 ms 2140 KB Output is correct

Subtask #4
0.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1236 KB Output is correct
2 Correct 0 ms 1236 KB Output is correct
3 Correct 0 ms 1236 KB Output is correct
4 Incorrect 0 ms 1236 KB Output isn't correct
5 Halted 0 ms 0 KB -