Submission #9742

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
9742	2014-09-28 08:36:30	myungwoo	The last wizard (kriii2_T)	C++14	1 / 4	144 ms	262144 KiB

T

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#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()
{
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 1 / 1
• Subtask 2: 0 / 3