ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#211926 | #3815. 种树 | liujiahe0409 | 100 | 1ms | 1200kb | C++ | 497b | 2024-10-13 08:39:21 | 2024-10-13 12:51:12 |
answer
#include<bits/stdc++.h>
using namespace std;
int n,m,k;
int ans=0;
bool vis[20][20];
void dfs(int x,int y,int cnt){
if(cnt==k){
ans++;
//cout<<":\n";
return;
}
if(y>m) return;
if(x+1<=n) dfs(x+1,y,cnt);
else dfs(1,y+1,cnt);
if(!vis[x-1][y]&&!vis[x][y-1]&&cnt+1<=k){
vis[x][y]=1;
//cout<<"("<<x<<","<<y<<")"<<"\n";
if(x+1<=n) dfs(x+1,y,cnt+1);
else dfs(1,y+1,cnt+1);
vis[x][y]=0;
}
}
int main(){
cin>>n>>m>>k;
dfs(1,1,0);
cout<<ans;
return 0;
}
详细
小提示:点击横条可展开更详细的信息
Test #1:
score: 10
Accepted
time: 0ms
memory: 1196kb
input:
2 2 1
output:
4
result:
ok 1 number(s): "4"
Test #2:
score: 10
Accepted
time: 0ms
memory: 1196kb
input:
2 3 2
output:
8
result:
ok 1 number(s): "8"
Test #3:
score: 10
Accepted
time: 1ms
memory: 1200kb
input:
4 4 2
output:
96
result:
ok 1 number(s): "96"
Test #4:
score: 10
Accepted
time: 0ms
memory: 1196kb
input:
4 4 5
output:
304
result:
ok 1 number(s): "304"
Test #5:
score: 10
Accepted
time: 0ms
memory: 1200kb
input:
3 4 3
output:
84
result:
ok 1 number(s): "84"
Test #6:
score: 10
Accepted
time: 0ms
memory: 1200kb
input:
3 5 2
output:
83
result:
ok 1 number(s): "83"
Test #7:
score: 10
Accepted
time: 0ms
memory: 1196kb
input:
3 5 3
output:
215
result:
ok 1 number(s): "215"
Test #8:
score: 10
Accepted
time: 0ms
memory: 1200kb
input:
3 5 4
output:
276
result:
ok 1 number(s): "276"
Test #9:
score: 10
Accepted
time: 0ms
memory: 1196kb
input:
3 5 5
output:
174
result:
ok 1 number(s): "174"
Test #10:
score: 10
Accepted
time: 0ms
memory: 1196kb
input:
4 3 5
output:
18
result:
ok 1 number(s): "18"
Extra Test:
score: 0
Extra Test Passed