NOI.AC
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #211965 | #3815. 种树 | huangyuhang | 100 | 0ms | 1192kb | C++ | 622b | 2024-10-13 09:14:53 | 2024-10-13 12:53:34 |
answer
#include<bits/stdc++.h>
using namespace std;
int n,m,k;
long long ans=0;
bool a[16+5][16+5];
void DFS(int x,int y,int step)
{
if(step==k)
{
ans+=1;
return;
}
if(x>n)
return;
if(a[x-1][y]&&a[x][y-1])
{
a[x][y]=false;
if(y==m)
{
DFS(x+1,1,step+1);
a[x][y]=true;
}
else
{
DFS(x,y+1,step+1);
a[x][y]=true;
}
}
if(y==m)
DFS(x+1,1,step);
else
DFS(x,y+1,step);
}
int main()
{
// freopen("A.in","r",stdin);
// freopen("A.out","w",stdout);
memset(a,true,sizeof(a));
scanf("%d %d %d",&n,&m,&k);
DFS(1,1,0);
printf("%lld",ans);
return 0;
}
Details
小提示：点击横条可展开更详细的信息
Test #1:
score: 10
Accepted
time: 0ms
memory: 1192kb
input:
2 2 1
output:
4
result:
ok 1 number(s): "4"
Test #2:
score: 10
Accepted
time: 0ms
memory: 1188kb
input:
2 3 2
output:
8
result:
ok 1 number(s): "8"
Test #3:
score: 10
Accepted
time: 0ms
memory: 1192kb
input:
4 4 2
output:
96
result:
ok 1 number(s): "96"
Test #4:
score: 10
Accepted
time: 0ms
memory: 1192kb
input:
4 4 5
output:
304
result:
ok 1 number(s): "304"
Test #5:
score: 10
Accepted
time: 0ms
memory: 1192kb
input:
3 4 3
output:
84
result:
ok 1 number(s): "84"
Test #6:
score: 10
Accepted
time: 0ms
memory: 1192kb
input:
3 5 2
output:
83
result:
ok 1 number(s): "83"
Test #7:
score: 10
Accepted
time: 0ms
memory: 1192kb
input:
3 5 3
output:
215
result:
ok 1 number(s): "215"
Test #8:
score: 10
Accepted
time: 0ms
memory: 1188kb
input:
3 5 4
output:
276
result:
ok 1 number(s): "276"
Test #9:
score: 10
Accepted
time: 0ms
memory: 1188kb
input:
3 5 5
output:
174
result:
ok 1 number(s): "174"
Test #10:
score: 10
Accepted
time: 0ms
memory: 1192kb
input:
4 3 5
output:
18
result:
ok 1 number(s): "18"
Extra Test:
score: 0
Extra Test Passed
