답안 #9740 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
9740	2014-09-28T08:35:22 Z	corea	The last wizard (kriii2_T)	C++14	1 / 4	448 ms	87456 KB

#include <stdio.h>
long long T;
int N;
int A;
int ps[10010] = {0, };
int manas[10010][10] = {0,};

long long MOD = 1000000007LL;

int next[1000010][10] = {0,};
int nextp[1000010] = {0,};
int now[1000010][10] = {0,};
int nowp[1000010] = {0,};
int nown = 1;

int main(){
	scanf("%lld%d%d", &T, &N, &A);
	int i, j, k;
	int psum = 0;
	for(i = 0; i < N; i++){
		scanf("%d", &ps[i]);
		for(j = 0; j < 10; j++) scanf("%d", &manas[i][j]);
		psum += ps[i];
	}
	ps[N] = A - psum; // N + 1th situation

	nowp[0] = 1;
	for(i = 0; i < 10; i++) now[0][i] = 1;

	int t;
	for(t = 1; t <= T; t++){
		int nextn = 0;
		for(i = 0; i < nown; i++){
			for(j = 0; j <= N; j++){
				nextp[nextn] = (long long)nowp[i] * ps[j] % MOD;
				for(k = 0; k < 10; k++) next[nextn][k] = (now[i][k] + manas[j][k]) % MOD;
				nextn++;
			}
		}
		
		nown = nextn;
		for(i = 0; i < nown; i++){
			nowp[i] = nextp[i];
			for(j = 0; j < 10; j++) now[i][j] = next[i][j];
		}
	}

	int sum = 0;
	for(i = 0; i < nown; i++){
		int mult = 1;
		for(j = 0; j < 10; j++) mult = (long long)mult * now[i][j] % MOD;
		mult = (long long)mult * nowp[i] % MOD;
		sum += mult;
		sum %= MOD;
	}
	printf("%d\n", sum);
	
	return 0;
}

Subtask #1
1.0 / 1.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	87456 KB	Output is correct
2	Correct	0 ms	87456 KB	Output is correct
3	Correct	0 ms	87456 KB	Output is correct
4	Correct	0 ms	87456 KB	Output is correct
5	Correct	0 ms	87456 KB	Output is correct
6	Correct	0 ms	87456 KB	Output is correct
7	Correct	0 ms	87456 KB	Output is correct
8	Correct	0 ms	87456 KB	Output is correct
9	Correct	0 ms	87456 KB	Output is correct
10	Correct	0 ms	87456 KB	Output is correct
11	Correct	0 ms	87456 KB	Output is correct
12	Correct	0 ms	87456 KB	Output is correct
13	Correct	4 ms	87456 KB	Output is correct
14	Correct	8 ms	87456 KB	Output is correct
15	Correct	20 ms	87456 KB	Output is correct
16	Correct	40 ms	87456 KB	Output is correct
17	Correct	76 ms	87456 KB	Output is correct
18	Correct	152 ms	87456 KB	Output is correct
19	Correct	308 ms	87456 KB	Output is correct
20	Correct	0 ms	87456 KB	Output is correct
21	Correct	0 ms	87456 KB	Output is correct
22	Correct	0 ms	87456 KB	Output is correct
23	Correct	0 ms	87456 KB	Output is correct
24	Correct	0 ms	87456 KB	Output is correct
25	Correct	0 ms	87456 KB	Output is correct
26	Correct	0 ms	87456 KB	Output is correct
27	Correct	0 ms	87456 KB	Output is correct
28	Correct	8 ms	87456 KB	Output is correct
29	Correct	28 ms	87456 KB	Output is correct
30	Correct	92 ms	87456 KB	Output is correct
31	Correct	268 ms	87456 KB	Output is correct
32	Correct	0 ms	87456 KB	Output is correct
33	Correct	0 ms	87456 KB	Output is correct
34	Correct	0 ms	87456 KB	Output is correct
35	Correct	0 ms	87456 KB	Output is correct
36	Correct	0 ms	87456 KB	Output is correct
37	Correct	0 ms	87456 KB	Output is correct
38	Correct	8 ms	87456 KB	Output is correct
39	Correct	32 ms	87456 KB	Output is correct
40	Correct	128 ms	87456 KB	Output is correct
41	Correct	0 ms	87456 KB	Output is correct
42	Correct	0 ms	87456 KB	Output is correct
43	Correct	0 ms	87456 KB	Output is correct
44	Correct	0 ms	87456 KB	Output is correct
45	Correct	0 ms	87456 KB	Output is correct
46	Correct	4 ms	87456 KB	Output is correct
47	Correct	36 ms	87456 KB	Output is correct
48	Correct	184 ms	87456 KB	Output is correct
49	Correct	0 ms	87456 KB	Output is correct
50	Correct	0 ms	87456 KB	Output is correct
51	Correct	0 ms	87456 KB	Output is correct
52	Correct	0 ms	87456 KB	Output is correct
53	Correct	4 ms	87456 KB	Output is correct
54	Correct	16 ms	87456 KB	Output is correct
55	Correct	116 ms	87456 KB	Output is correct
56	Correct	0 ms	87456 KB	Output is correct
57	Correct	0 ms	87456 KB	Output is correct
58	Correct	0 ms	87456 KB	Output is correct
59	Correct	0 ms	87456 KB	Output is correct
60	Correct	8 ms	87456 KB	Output is correct
61	Correct	48 ms	87456 KB	Output is correct
62	Correct	368 ms	87456 KB	Output is correct
63	Correct	0 ms	87456 KB	Output is correct
64	Correct	0 ms	87456 KB	Output is correct
65	Correct	0 ms	87456 KB	Output is correct
66	Correct	0 ms	87456 KB	Output is correct
67	Correct	16 ms	87456 KB	Output is correct
68	Correct	120 ms	87456 KB	Output is correct
69	Correct	0 ms	87456 KB	Output is correct
70	Correct	0 ms	87456 KB	Output is correct
71	Correct	0 ms	87456 KB	Output is correct
72	Correct	0 ms	87456 KB	Output is correct
73	Correct	28 ms	87456 KB	Output is correct
74	Correct	240 ms	87456 KB	Output is correct
75	Correct	0 ms	87456 KB	Output is correct
76	Correct	0 ms	87456 KB	Output is correct
77	Correct	0 ms	87456 KB	Output is correct
78	Correct	4 ms	87456 KB	Output is correct
79	Correct	44 ms	87456 KB	Output is correct
80	Correct	448 ms	87456 KB	Output is correct
81	Correct	0 ms	87456 KB	Output is correct
82	Correct	0 ms	87456 KB	Output is correct
83	Correct	0 ms	87456 KB	Output is correct
84	Correct	0 ms	87456 KB	Output is correct
85	Correct	76 ms	87456 KB	Output is correct
86	Correct	0 ms	87456 KB	Output is correct
87	Correct	0 ms	87456 KB	Output is correct
88	Correct	0 ms	87456 KB	Output is correct
89	Correct	4 ms	87456 KB	Output is correct
90	Correct	104 ms	87456 KB	Output is correct
91	Correct	0 ms	87456 KB	Output is correct
92	Correct	0 ms	87456 KB	Output is correct
93	Correct	0 ms	87456 KB	Output is correct
94	Correct	8 ms	87456 KB	Output is correct
95	Correct	164 ms	87456 KB	Output is correct
96	Correct	0 ms	87456 KB	Output is correct
97	Correct	0 ms	87456 KB	Output is correct
98	Correct	0 ms	87456 KB	Output is correct
99	Correct	8 ms	87456 KB	Output is correct
100	Correct	236 ms	87456 KB	Output is correct

Subtask #2
0.0 / 3.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	192 ms	87452 KB	Program hung waiting for input
2	Halted	0 ms	0 KB	-

답안 #9740

Compilation message

Subtask #1 1.0 / 1.0

Subtask #2 0.0 / 3.0

Subtask #1
1.0 / 1.0

Subtask #2
0.0 / 3.0