oj.uz

Submission #7588

# Submission time Handle Problem Language Result Execution time Memory
7588 2014-08-11T13:56:57 Z dohyun0324 경비원 (GA8_guard) C++
21 / 100
 372 ms 14388 KB 
#include<stdio.h>
int cnt,n,a[2510],m,ch[30],w,b[2510],cnt2;
long long int dap,d[100][17000];
int p[20]={0,2,3,5,7,11,13,17,19,23,29,31,37,41,43};
int gcd(int x,int y)
{
    if(x%y==0) return y;
    return gcd(y,x%y);
}
void dfs(int x)
{
    int i;
    if(x==n)
    {
        if(w>=2)
        {
            cnt++;
        }
        return;
    }
    dfs(x+1);
    for(i=1;i<=w;i++)
    {
        if(gcd(ch[i],a[x+1])!=1) break;
    }
    if(i!=w+1) return;
    ch[++w]=a[x+1];
    dfs(x+1);
    ch[w--]=0;
}
int main()
{
    int i,j,s;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
        if(m<a[i]) m=a[i];
        if(a[i]==1) cnt2++;
    }
    //subtask 1,2
    if(n<=44)
    {
        dfs(1);
        ch[++w]=a[1];
        dfs(1);
        printf("%d",cnt);
    }
    //subtask 3
    else
    {
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=14;j++)
            {
                if(a[i]%p[j]==0) b[i]+=(1<<(j-1));
            }
        }
        d[1][b[1]]=1;
        for(i=2;i<=n;i++)
        {
            d[i][b[i]]++;
            for(j=0;j<=1<<14;j++)
            {
                d[i][j]+=d[i-1][j];
            }
            for(j=0;j<=1<<14;j++)
            {
                if((j&b[i])!=0) continue;
                d[i][j|b[i]]+=d[i-1][j];
                d[i][j|b[i]]%=1000000007;
            }
        }
        for(i=0;i<=1<<14;i++)
        {
            dap+=d[n][i];
            dap%=1000000007;
        }
        printf("%lld",dap-n);
    }
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 14388 KB Output is correct
2 Correct 0 ms 14388 KB Output is correct
3 Correct 0 ms 14388 KB Output is correct
4 Correct 0 ms 14388 KB Output is correct
5 Correct 0 ms 14388 KB Output is correct
6 Correct 0 ms 14388 KB Output is correct
7 Correct 0 ms 14388 KB Output is correct
8 Correct 0 ms 14388 KB Output is correct
9 Correct 0 ms 14388 KB Output is correct
10 Correct 0 ms 14388 KB Output is correct
11 Correct 0 ms 14388 KB Output is correct
12 Correct 0 ms 14388 KB Output is correct
13 Correct 0 ms 14388 KB Output is correct
14 Correct 0 ms 14388 KB Output is correct
15 Correct 0 ms 14388 KB Output is correct
16 Correct 0 ms 14388 KB Output is correct
17 Correct 0 ms 14388 KB Output is correct
18 Correct 0 ms 14388 KB Output is correct
19 Correct 0 ms 14388 KB Output is correct
20 Correct 0 ms 14388 KB Output is correct
21 Correct 0 ms 14388 KB Output is correct
22 Correct 0 ms 14388 KB Output is correct
23 Correct 0 ms 14388 KB Output is correct
24 Correct 0 ms 14388 KB Output is correct
25 Correct 0 ms 14388 KB Output is correct
26 Correct 0 ms 14388 KB Output is correct
27 Correct 0 ms 14388 KB Output is correct
28 Correct 0 ms 14388 KB Output is correct
29 Correct 0 ms 14388 KB Output is correct
30 Correct 60 ms 14388 KB Output is correct
31 Correct 0 ms 14388 KB Output is correct
32 Correct 0 ms 14388 KB Output is correct
33 Correct 0 ms 14388 KB Output is correct
34 Correct 0 ms 14388 KB Output is correct
35 Correct 0 ms 14388 KB Output is correct
36 Correct 0 ms 14388 KB Output is correct
37 Correct 0 ms 14388 KB Output is correct
38 Correct 0 ms 14388 KB Output is correct
39 Correct 0 ms 14388 KB Output is correct
40 Correct 0 ms 14388 KB Output is correct
41 Correct 0 ms 14388 KB Output is correct
42 Correct 24 ms 14388 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 14388 KB Output is correct
2 Correct 0 ms 14388 KB Output is correct
3 Correct 0 ms 14388 KB Output is correct
4 Correct 0 ms 14388 KB Output is correct
5 Correct 0 ms 14388 KB Output is correct
6 Correct 0 ms 14388 KB Output is correct
7 Correct 0 ms 14388 KB Output is correct
8 Correct 0 ms 14388 KB Output is correct
9 Correct 0 ms 14388 KB Output is correct
10 Correct 0 ms 14388 KB Output is correct
11 Correct 0 ms 14388 KB Output is correct
12 Correct 0 ms 14388 KB Output is correct
13 Correct 0 ms 14388 KB Output is correct
14 Correct 0 ms 14388 KB Output is correct
15 Correct 0 ms 14388 KB Output is correct
16 Correct 0 ms 14388 KB Output is correct
17 Correct 0 ms 14388 KB Output is correct
18 Correct 0 ms 14388 KB Output is correct
19 Correct 0 ms 14388 KB Output is correct
20 Correct 0 ms 14388 KB Output is correct
21 Correct 0 ms 14388 KB Output is correct
22 Correct 0 ms 14388 KB Output is correct
23 Correct 0 ms 14388 KB Output is correct
24 Correct 0 ms 14388 KB Output is correct
25 Correct 4 ms 14388 KB Output is correct
26 Correct 4 ms 14388 KB Output is correct
27 Correct 4 ms 14388 KB Output is correct
28 Correct 8 ms 14388 KB Output is correct
29 Correct 8 ms 14388 KB Output is correct
30 Correct 16 ms 14388 KB Output is correct
31 Correct 24 ms 14388 KB Output is correct
32 Correct 28 ms 14388 KB Output is correct
33 Correct 36 ms 14388 KB Output is correct
34 Correct 40 ms 14388 KB Output is correct
35 Correct 44 ms 14388 KB Output is correct
36 Correct 68 ms 14388 KB Output is correct
37 Correct 84 ms 14388 KB Output is correct
38 Correct 100 ms 14388 KB Output is correct
39 Correct 112 ms 14388 KB Output is correct
40 Correct 172 ms 14388 KB Output is correct
41 Correct 192 ms 14388 KB Output is correct
42 Correct 312 ms 14388 KB Output is correct
43 Correct 372 ms 14388 KB Output is correct

Subtask #3
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 8 ms 14384 KB SIGSEGV Segmentation fault
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 27.0

# Verdict Execution time Memory Grader output
1 Runtime error 8 ms 14384 KB SIGSEGV Segmentation fault
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 36.0

# Verdict Execution time Memory Grader output
1 Runtime error 0 ms 14384 KB SIGSEGV Segmentation fault
2 Halted 0 ms 0 KB -