oj.uz

Submission #11174

# Submission time Handle Problem Language Result Execution time Memory
11174 2014-11-18T13:22:59 Z gs13068 Sequence (BOI14_sequence) C++
42 / 100
 260 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)||flag)
        {
            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(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 172 ms 1236 KB Output is correct
2 Correct 196 ms 1236 KB Output is correct
3 Correct 200 ms 1236 KB Output is correct
4 Correct 192 ms 1236 KB Output is correct
5 Correct 192 ms 1236 KB Output is correct
6 Correct 184 ms 1236 KB Output is correct
7 Correct 168 ms 1236 KB Output is correct
8 Correct 188 ms 1236 KB Output is correct
9 Correct 128 ms 1236 KB Output is correct
10 Correct 184 ms 1236 KB Output is correct
11 Correct 196 ms 1236 KB Output is correct
12 Correct 208 ms 1236 KB Output is correct
13 Correct 204 ms 1236 KB Output is correct
14 Correct 200 ms 1236 KB Output is correct
15 Correct 180 ms 1236 KB Output is correct

Subtask #2
33.0 / 33.0

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

Subtask #3
0.0 / 25.0

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

Subtask #4
0.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 1236 KB Output is correct
2 Correct 208 ms 1236 KB Output is correct
3 Correct 208 ms 1236 KB Output is correct
4 Correct 224 ms 1236 KB Output is correct
5 Correct 220 ms 1664 KB Output is correct
6 Correct 180 ms 1236 KB Output is correct
7 Correct 180 ms 1236 KB Output is correct
8 Correct 184 ms 1236 KB Output is correct
9 Correct 172 ms 1236 KB Output is correct
10 Correct 180 ms 1236 KB Output is correct
11 Correct 256 ms 2140 KB Output is correct
12 Correct 260 ms 2140 KB Output is correct
13 Correct 120 ms 1236 KB Output is correct
14 Correct 204 ms 1236 KB Output is correct
15 Correct 192 ms 1236 KB Output is correct
16 Correct 188 ms 1236 KB Output is correct
17 Correct 204 ms 1236 KB Output is correct
18 Correct 200 ms 1236 KB Output is correct
19 Correct 184 ms 1236 KB Output is correct
20 Correct 196 ms 1236 KB Output is correct
21 Correct 216 ms 1236 KB Output is correct
22 Correct 196 ms 1236 KB Output is correct
23 Correct 176 ms 1236 KB Output is correct
24 Correct 204 ms 1236 KB Output is correct
25 Correct 196 ms 1236 KB Output is correct
26 Correct 192 ms 1236 KB Output is correct
27 Correct 176 ms 1236 KB Output is correct
28 Correct 176 ms 1236 KB Output is correct
29 Correct 216 ms 1236 KB Output is correct
30 Incorrect 232 ms 1236 KB Output isn't correct
31 Halted 0 ms 0 KB -