oj.uz

Submission #11199

# Submission time Handle Problem Language Result Execution time Memory
11199 2014-11-18T14:57:20 Z woqja125 Sequence (BOI14_sequence) C++
0 / 100
 12 ms 1596 KB 
#include<stdio.h>
int d[100001];
long long getAns(int data[], const int n, int depth, bool prevZero)
{
	//printf("%d %d %d \n", n, data[1], data[2]);
    int *arg;
    long long ans = 102345678900000000ll;
    int i;
    for(i=1; i<=n; i++) if(data[i] != 0) break;
    if(i==n+1 && !prevZero) return 0;
    if(n==1 || depth > 6)
    {
        for(i=2; i<=n; i++) data[1] |= data[i];
        ans = 0;
        int c = 0;
        if(data[1] == 0 && prevZero)
        {
        	return 1;
        }
        else if(data[1] == 0)
        {
        	return 0;
        }
        if(data[1] % 2 == 1)
        {
            if(data[1] == 1) return 10;
            else
            {
                int i;
                for(i=1; i<=9; i++)
                {
                    if(((data[1] >> i) & 1) == 1)
                    {
                        ans = i*10;
                        break;
                    }
                }
                for(i++; i<=9; i++) if(((data[1] >> i) & 1) == 1) ans = ans * 10 + i;
                return ans;
            }
        }
        else
        {
            for(int i=1; i<=9; i++) if(((data[1] >> i) & 1) == 1) ans = ans * 10 + i;
            return ans;
        }
    }
    arg = new int[n/10+100];
    int start = 0;
    for(start = 0; start<=9; start++)
    {
        int fd, N;
        fd = start;
        arg[N = 1] = 0;
        for(int i=1; i<=n; i++)
        {
            if(fd == 10)
            {
                fd = 0;
                arg[++N] = 0;
            }
            arg[N] = arg[N] | (data[i] & (~(1<<fd)) );
            fd++;
        }

        long long l;
        //printf("Call %d %d %d %d %d\n", N, depth+1, arg[1], arg[2], start);
        for(i=1; i<=N; i++) if(arg[i] != 0) break;
        if(i==N+1 && !prevZero) l = start;
        else if(start == 0) l = getAns(arg, N, depth + 1, true);
        else l = getAns(arg, N, depth+1, false);
        //printf("Log %d %d %d %d %lld %d\n", N, depth+1, arg[1], arg[2], l, start);
        if(ans > l*10 + start)
        {
            ans = l*10 + start;
            //printf("Ans %lld\n", ans);
        }
    }
    delete[] arg;
    return ans;
}
int main()
{
    int n, i;
    scanf("%d", &n);
    for(i=1; i<=n; i++)
    {
        scanf("%d", d+i);
    }
    for(i=1; i<=n; i++)
    {
        d[i] = 1<<d[i];
    }
    long long ans = getAns(d, n, 1, true);
    printf("%lld", ans);
    return 0;
}

Subtask #1
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

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

Subtask #4
0.0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1596 KB Output isn't correct
2 Halted 0 ms 0 KB -