답안 #7345 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
7345	2014-08-02T03:33:46 Z	kriii	경비원 (GA8_guard)	C++	37 / 100	356 ms	1540 KB

guard

#include <stdio.h>
#include <vector>

const long long mod = 1000000007;
long long ans; int divs[2223],isp[2223],ind[48],cha[2223],p;
std::vector<int> gath[2223],sm;
int pr[1<<15],nx[1<<15];

int N;

int ch(int x)
{
	int r = 0;
	for (int i=2;i<48;i++) if (!isp[i] && x % i == 0) r |= 1 << ind[i];
	return r;
}

int main()
{
	scanf ("%d",&N);

	for (int i=2;i<=2222;i++) if (!isp[i]){
		for (int j=i;j<=2222;j+=i) divs[j] = i;
		for (int j=i*i;j<=2222;j+=i) isp[j] = 1;
	}
	for (int i=2;i<48;i++) if (!isp[i]){
		ind[i] = p++;
	}
	for (int i=2;i<=2222;i++) cha[i] = ch(i);
	for (int i=0,x;i<N;i++){
		scanf ("%d",&x);
		if (divs[x] >= 48){
			gath[divs[x]].push_back(cha[x/divs[x]]);
		}
		else sm.push_back(cha[x]);
	}

	pr[0] = 1;
	for (int i=48;i<=2222;i++) if (!gath[i].empty()){
		for (int j=0;j<(1<<15);j++) nx[j] = pr[j];
		for (int j=0;j<(1<<15);j++) for (int k=0;k<gath[i].size();k++) if ((j & gath[i][k]) == 0) nx[j|gath[i][k]] += pr[j];
		for (int j=0;j<(1<<15);j++) pr[j] = nx[j] % mod;
	}
	for (int k=0;k<sm.size();k++){
		for (int j=0;j<(1<<15);j++) nx[j] = pr[j];
		for (int j=0;j<(1<<15);j++) if ((j & sm[k]) == 0) nx[j|sm[k]] += pr[j];
		for (int j=0;j<(1<<15);j++) pr[j] = nx[j] % mod;
	}
	for (int i=0;i<(1<<15);i++) ans = (ans + pr[i]) % mod;
	ans = (ans - N - 1 + mod) % mod;
	printf ("%lld\n",ans);

	return 0;
}

Subtask #1
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	1540 KB	Output is correct
2	Correct	0 ms	1540 KB	Output is correct
3	Correct	0 ms	1540 KB	Output is correct
4	Correct	0 ms	1540 KB	Output is correct
5	Correct	0 ms	1540 KB	Output is correct
6	Correct	0 ms	1540 KB	Output is correct
7	Correct	0 ms	1540 KB	Output is correct
8	Correct	0 ms	1540 KB	Output is correct
9	Correct	4 ms	1540 KB	Output is correct
10	Correct	0 ms	1540 KB	Output is correct
11	Correct	4 ms	1540 KB	Output is correct
12	Correct	4 ms	1540 KB	Output is correct
13	Correct	0 ms	1540 KB	Output is correct
14	Correct	0 ms	1540 KB	Output is correct
15	Correct	0 ms	1540 KB	Output is correct
16	Correct	0 ms	1540 KB	Output is correct
17	Correct	0 ms	1540 KB	Output is correct
18	Correct	0 ms	1540 KB	Output is correct
19	Correct	0 ms	1540 KB	Output is correct
20	Correct	0 ms	1540 KB	Output is correct
21	Correct	0 ms	1540 KB	Output is correct
22	Correct	0 ms	1540 KB	Output is correct
23	Correct	0 ms	1540 KB	Output is correct
24	Correct	0 ms	1540 KB	Output is correct
25	Correct	0 ms	1540 KB	Output is correct
26	Correct	4 ms	1540 KB	Output is correct
27	Correct	4 ms	1540 KB	Output is correct
28	Correct	4 ms	1540 KB	Output is correct
29	Correct	0 ms	1540 KB	Output is correct
30	Correct	4 ms	1540 KB	Output is correct
31	Correct	0 ms	1540 KB	Output is correct
32	Correct	0 ms	1540 KB	Output is correct
33	Correct	0 ms	1540 KB	Output is correct
34	Correct	0 ms	1540 KB	Output is correct
35	Correct	4 ms	1540 KB	Output is correct
36	Correct	4 ms	1540 KB	Output is correct
37	Correct	0 ms	1540 KB	Output is correct
38	Correct	0 ms	1540 KB	Output is correct
39	Correct	0 ms	1540 KB	Output is correct
40	Correct	0 ms	1540 KB	Output is correct
41	Correct	4 ms	1540 KB	Output is correct
42	Correct	4 ms	1540 KB	Output is correct

Subtask #2
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	1540 KB	Output is correct
2	Correct	0 ms	1540 KB	Output is correct
3	Correct	0 ms	1540 KB	Output is correct
4	Correct	0 ms	1540 KB	Output is correct
5	Correct	0 ms	1540 KB	Output is correct
6	Correct	0 ms	1540 KB	Output is correct
7	Correct	0 ms	1540 KB	Output is correct
8	Correct	0 ms	1540 KB	Output is correct
9	Correct	0 ms	1540 KB	Output is correct
10	Correct	0 ms	1540 KB	Output is correct
11	Correct	0 ms	1540 KB	Output is correct
12	Correct	0 ms	1540 KB	Output is correct
13	Correct	0 ms	1540 KB	Output is correct
14	Correct	4 ms	1540 KB	Output is correct
15	Correct	4 ms	1540 KB	Output is correct
16	Correct	4 ms	1540 KB	Output is correct
17	Correct	4 ms	1540 KB	Output is correct
18	Correct	4 ms	1540 KB	Output is correct
19	Correct	4 ms	1540 KB	Output is correct
20	Correct	4 ms	1540 KB	Output is correct
21	Correct	4 ms	1540 KB	Output is correct
22	Correct	4 ms	1540 KB	Output is correct
23	Correct	4 ms	1540 KB	Output is correct
24	Correct	4 ms	1540 KB	Output is correct
25	Correct	4 ms	1540 KB	Output is correct
26	Correct	4 ms	1540 KB	Output is correct
27	Correct	0 ms	1540 KB	Output is correct
28	Correct	4 ms	1540 KB	Output is correct
29	Correct	4 ms	1540 KB	Output is correct
30	Correct	4 ms	1540 KB	Output is correct
31	Correct	4 ms	1540 KB	Output is correct
32	Correct	4 ms	1540 KB	Output is correct
33	Correct	4 ms	1540 KB	Output is correct
34	Correct	4 ms	1540 KB	Output is correct
35	Correct	4 ms	1540 KB	Output is correct
36	Correct	4 ms	1540 KB	Output is correct
37	Correct	4 ms	1540 KB	Output is correct
38	Correct	4 ms	1540 KB	Output is correct
39	Correct	0 ms	1540 KB	Output is correct
40	Correct	4 ms	1540 KB	Output is correct
41	Correct	4 ms	1540 KB	Output is correct
42	Correct	8 ms	1540 KB	Output is correct
43	Correct	8 ms	1540 KB	Output is correct

Subtask #3
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	340 ms	1540 KB	Output is correct
2	Correct	336 ms	1540 KB	Output is correct
3	Correct	352 ms	1540 KB	Output is correct
4	Correct	340 ms	1540 KB	Output is correct
5	Correct	336 ms	1540 KB	Output is correct
6	Correct	324 ms	1540 KB	Output is correct
7	Correct	340 ms	1540 KB	Output is correct
8	Correct	356 ms	1540 KB	Output is correct
9	Correct	320 ms	1540 KB	Output is correct
10	Correct	324 ms	1540 KB	Output is correct
11	Correct	340 ms	1540 KB	Output is correct
12	Correct	320 ms	1540 KB	Output is correct
13	Correct	324 ms	1540 KB	Output is correct
14	Correct	308 ms	1540 KB	Output is correct
15	Correct	332 ms	1540 KB	Output is correct
16	Correct	336 ms	1540 KB	Output is correct
17	Correct	292 ms	1540 KB	Output is correct
18	Correct	296 ms	1540 KB	Output is correct
19	Correct	312 ms	1540 KB	Output is correct
20	Correct	292 ms	1540 KB	Output is correct
21	Correct	296 ms	1540 KB	Output is correct
22	Correct	280 ms	1540 KB	Output is correct
23	Correct	304 ms	1540 KB	Output is correct
24	Correct	308 ms	1540 KB	Output is correct
25	Correct	252 ms	1540 KB	Output is correct
26	Correct	252 ms	1540 KB	Output is correct
27	Correct	284 ms	1540 KB	Output is correct
28	Correct	252 ms	1540 KB	Output is correct
29	Correct	260 ms	1540 KB	Output is correct
30	Correct	240 ms	1540 KB	Output is correct
31	Correct	260 ms	1540 KB	Output is correct
32	Correct	260 ms	1540 KB	Output is correct
33	Correct	196 ms	1540 KB	Output is correct
34	Correct	196 ms	1540 KB	Output is correct
35	Correct	204 ms	1540 KB	Output is correct
36	Correct	192 ms	1540 KB	Output is correct
37	Correct	192 ms	1540 KB	Output is correct
38	Correct	188 ms	1540 KB	Output is correct
39	Correct	200 ms	1540 KB	Output is correct
40	Correct	204 ms	1540 KB	Output is correct

Subtask #4
0.0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	280 ms	1540 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5
0.0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	256 ms	1540 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

답안 #7345

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 13.0 / 13.0

Subtask #3 16.0 / 16.0

Subtask #4 0.0 / 27.0

Subtask #5 0.0 / 36.0

Subtask #1
8.0 / 8.0

Subtask #2
13.0 / 13.0

Subtask #3
16.0 / 16.0

Subtask #4
0.0 / 27.0

Subtask #5
0.0 / 36.0