oj.uz

Submission #12027

# Submission time Handle Problem Language Result Execution time Memory
12027 2014-12-18T08:12:29 Z dohyun0324 Sequence (BOI14_sequence) C++
0 / 100
 260 ms 1580 KB 
#include<stdio.h>
#include<vector>
using namespace std;
int r,n;
long long int dap=2147483647000000000000LL,c,p,arr[513];
void dfs(long long int num,vector<int>a,int n,long long int w)
{
    int i,j;
    if(num>=dap) return;
    if(n==-1)
    {
        if(num<w/10) num+=w*10;
        if(num==0) num=w*10;
        if(dap>num)
        {
            dap=num;
        }
        return;
    }
    if(n==1)
    {
        c=0; p=1;
        r=a[0];
        for(i=1;i<=9;i++)
        {
            if((1<<i)&a[0])
            {
                c=c*10+i;
                if(c<10 && 1&a[0]) c=c*10;
            }
        }
        if(c==0 && 1&a[0]) c=10;
        if(c>dap/w) return;
        c*=w; c+=num;
        if(c==0) c=w*10;
        if(dap>c)
        {
            dap=c;
        }
        return;
    }
    for(i=0;i<=9;i++)
    {
        vector<int>s((i+n-1)/10+1);
        int sw=0;
        for(j=0;j<n;j++)
        {
            r=a[j];
            s[(i+j)/10]|=a[j]&(1023-(1<<((i+j)%10)));
            if(s[(i+j)/10]) sw=1;
        }
        if(sw==0){dfs(i*w+num,s,-1,w); break;}
        dfs(i*w+num,s,(i+n-1)/10+1,w*10);
    }
}
int main()
{
    int i;
    scanf("%d",&n);
    vector<int>a(n);
    for(i=0;i<n;i++){
        scanf("%d",&a[i]);
        a[i]=(1<<a[i]);
    }
    dfs(0,a,n,1);
    printf("%lld",dap);
    return 0;
}

Subtask #1
0.0 / 9.0

# Verdict Execution time Memory 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 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 Incorrect 0 ms 1240 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0.0 / 33.0

# Verdict Execution time Memory 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 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 Incorrect 0 ms 1240 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

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

Subtask #4
0.0 / 33.0

# Verdict Execution time Memory 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 0 ms 1240 KB Output is correct
5 Correct 260 ms 1580 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 Incorrect 0 ms 1240 KB Output isn't correct
11 Halted 0 ms 0 KB -