답안 #9742

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
9742 2014-09-28T08:36:30 Z myungwoo The last wizard (kriii2_T) C++14
1 / 4
144 ms 262144 KB
#include <stdio.h>
#include <vector>
using namespace std;

#define MAXN 10004
typedef long long lld;

const int MOD = 1e9 + 7;
int T, N, A, none, ans;
int P[MAXN][10], Q[MAXN];

void dfs(int t, vector <int> &v, int p)
{
	int i, j;
	if (t == T){
		int x = 1;
		for (i=0;i<10;i++) x = (lld)x*v[i]%MOD;
		ans = (ans+(lld)x*p%MOD)%MOD;
		return;
	}
	for (i=1;i<=N;i++){
		for (j=0;j<10;j++) v[j] = (v[j]+P[i][j])%MOD;
		dfs(t+1, v, (lld)p*Q[i]%MOD);
		for (j=0;j<10;j++) v[j] = (v[j]-P[i][j]+MOD)%MOD;
	}
	dfs(t+1, v, (lld)p*none%MOD);
}

int main()
{
	int i, j, k;
	scanf("%d%d%d", &T, &N, &A);
	none = A;
	for (i=1;i<=N;i++){
		scanf("%d", Q+i);
		for (j=0;j<10;j++){
			scanf("%d", P[i]+j);
		}
		none -= Q[i];
	}
	vector <int> arr(10,1);
	dfs(0, arr, 1);
	printf("%d\n", ans);
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1636 KB Output is correct
2 Correct 0 ms 1636 KB Output is correct
3 Correct 0 ms 1636 KB Output is correct
4 Correct 0 ms 1636 KB Output is correct
5 Correct 0 ms 1636 KB Output is correct
6 Correct 0 ms 1636 KB Output is correct
7 Correct 0 ms 1636 KB Output is correct
8 Correct 0 ms 1636 KB Output is correct
9 Correct 0 ms 1636 KB Output is correct
10 Correct 0 ms 1636 KB Output is correct
11 Correct 0 ms 1636 KB Output is correct
12 Correct 0 ms 1636 KB Output is correct
13 Correct 0 ms 1636 KB Output is correct
14 Correct 0 ms 1636 KB Output is correct
15 Correct 4 ms 1636 KB Output is correct
16 Correct 8 ms 1636 KB Output is correct
17 Correct 20 ms 1636 KB Output is correct
18 Correct 36 ms 1636 KB Output is correct
19 Correct 76 ms 1636 KB Output is correct
20 Correct 0 ms 1636 KB Output is correct
21 Correct 0 ms 1636 KB Output is correct
22 Correct 0 ms 1636 KB Output is correct
23 Correct 0 ms 1636 KB Output is correct
24 Correct 0 ms 1636 KB Output is correct
25 Correct 0 ms 1636 KB Output is correct
26 Correct 0 ms 1636 KB Output is correct
27 Correct 0 ms 1636 KB Output is correct
28 Correct 0 ms 1636 KB Output is correct
29 Correct 8 ms 1636 KB Output is correct
30 Correct 24 ms 1636 KB Output is correct
31 Correct 76 ms 1636 KB Output is correct
32 Correct 0 ms 1636 KB Output is correct
33 Correct 0 ms 1636 KB Output is correct
34 Correct 0 ms 1636 KB Output is correct
35 Correct 0 ms 1636 KB Output is correct
36 Correct 0 ms 1636 KB Output is correct
37 Correct 0 ms 1636 KB Output is correct
38 Correct 0 ms 1636 KB Output is correct
39 Correct 8 ms 1636 KB Output is correct
40 Correct 36 ms 1636 KB Output is correct
41 Correct 0 ms 1636 KB Output is correct
42 Correct 0 ms 1636 KB Output is correct
43 Correct 0 ms 1636 KB Output is correct
44 Correct 0 ms 1636 KB Output is correct
45 Correct 0 ms 1636 KB Output is correct
46 Correct 0 ms 1636 KB Output is correct
47 Correct 8 ms 1636 KB Output is correct
48 Correct 56 ms 1636 KB Output is correct
49 Correct 0 ms 1636 KB Output is correct
50 Correct 0 ms 1636 KB Output is correct
51 Correct 0 ms 1636 KB Output is correct
52 Correct 0 ms 1636 KB Output is correct
53 Correct 0 ms 1636 KB Output is correct
54 Correct 4 ms 1636 KB Output is correct
55 Correct 40 ms 1636 KB Output is correct
56 Correct 0 ms 1636 KB Output is correct
57 Correct 0 ms 1636 KB Output is correct
58 Correct 0 ms 1636 KB Output is correct
59 Correct 0 ms 1636 KB Output is correct
60 Correct 0 ms 1636 KB Output is correct
61 Correct 16 ms 1636 KB Output is correct
62 Correct 120 ms 1636 KB Output is correct
63 Correct 0 ms 1636 KB Output is correct
64 Correct 0 ms 1636 KB Output is correct
65 Correct 0 ms 1636 KB Output is correct
66 Correct 0 ms 1636 KB Output is correct
67 Correct 4 ms 1636 KB Output is correct
68 Correct 36 ms 1636 KB Output is correct
69 Correct 0 ms 1636 KB Output is correct
70 Correct 0 ms 1636 KB Output is correct
71 Correct 0 ms 1636 KB Output is correct
72 Correct 0 ms 1636 KB Output is correct
73 Correct 8 ms 1636 KB Output is correct
74 Correct 72 ms 1636 KB Output is correct
75 Correct 0 ms 1636 KB Output is correct
76 Correct 0 ms 1636 KB Output is correct
77 Correct 0 ms 1636 KB Output is correct
78 Correct 0 ms 1636 KB Output is correct
79 Correct 12 ms 1636 KB Output is correct
80 Correct 144 ms 1636 KB Output is correct
81 Correct 0 ms 1636 KB Output is correct
82 Correct 0 ms 1636 KB Output is correct
83 Correct 0 ms 1636 KB Output is correct
84 Correct 0 ms 1636 KB Output is correct
85 Correct 20 ms 1636 KB Output is correct
86 Correct 0 ms 1636 KB Output is correct
87 Correct 0 ms 1636 KB Output is correct
88 Correct 0 ms 1636 KB Output is correct
89 Correct 0 ms 1636 KB Output is correct
90 Correct 36 ms 1636 KB Output is correct
91 Correct 0 ms 1636 KB Output is correct
92 Correct 0 ms 1636 KB Output is correct
93 Correct 0 ms 1636 KB Output is correct
94 Correct 4 ms 1636 KB Output is correct
95 Correct 52 ms 1636 KB Output is correct
96 Correct 0 ms 1636 KB Output is correct
97 Correct 0 ms 1636 KB Output is correct
98 Correct 0 ms 1636 KB Output is correct
99 Correct 4 ms 1636 KB Output is correct
100 Correct 76 ms 1636 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Memory limit exceeded 120 ms 262144 KB Memory limit exceeded
2 Halted 0 ms 0 KB -