# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
259620 | dantoh000 | Fishing Game (RMI19_fishing) | C++14 | 263 ms | 524292 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mem[3][305][305][305][2];
const int mod = 1000000007;
ll dp(int turn, int n01, int n02, int n12, int mustdie){
if (n01 == 0 && n02 == 0 && n12 == 0) return 1;
else if (mem[turn][n01][n02][n12][mustdie] != -1) return mem[turn][n01][n02][n12][mustdie];
ll ret = 0;
if (turn == 0){
if (n01) ret += n01*dp(1, n01-1, n02, n12, 0);
if (n02) ret += n02*dp(1, n01, n02-1, n12+1, mustdie);
}
if (turn == 1){
if (n12) ret += n12*dp(2, n01 , n02, n12-1, 0);
if (n01) ret += n02*dp(2, n01-1, n02+1, n12, mustdie);
}
if (turn == 2){
if (mustdie){
if (n02 == 0) ret = 0;
else ret = n02*dp(0, n01, n02-1, n12, 1);
}
else{
if (n12) ret += n12*dp(0, n01+1, n02, n12-1, 1);
if (n02) ret += n02*dp(0, n01 , n02-1, n12, 1);
}
}
ret %= mod;
return mem[turn][n01][n02][n12][mustdie] = ret;
}
int a[305], b[305], c[305];
int main(){
int n,t;
scanf("%d%d",&n,&t);
memset(mem,-1,sizeof(mem));
while (t--){
for (int i = 1; i <= 3*n; i++){ a[i] = b[i] = c[i] = 0; }
int x;
for (int i = 0; i < 2*n; i++){
scanf("%d",&x);
a[x] = 1;
}
for (int i = 0; i < 2*n; i++){
scanf("%d",&x);
b[x] = 1;
}
for (int i = 0; i < 2*n; i++){
scanf("%d",&x);
c[x] = 1;
}
int n01 = 0, n02 = 0, n12 = 0;
for (int i = 1; i <= 3*n; i++){
if (a[i] && b[i]) n01++;
if (a[i] && c[i]) n02++;
if (b[i] && c[i]) n12++;
}
printf("%d\n",dp(0,n01,n02,n12,1));
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |