NOI.AC
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #211950 | #3815. 种树 | Fisher2013 | 100 | 1ms | 1200kb | C++ | 496b | 2024-10-13 09:03:46 | 2024-10-13 12:52:49 |
answer
#include <bits/stdc++.h>
using namespace std;
int cnt = 0, n, m, vis[18][18];
void DFS(int i, int j, int num){
if(num == 0){
cnt++;
return;
}
int x = i, y = j;
while(x <= n){
if (!vis[x][y] && !vis[x + 1][y] && !vis[x - 1][y] && !vis[x][y + 1] && !vis[x][y - 1]){
vis[x][y] = 1;
DFS(x, y, num - 1);
vis[x][y] = 0;
}
y++;
if(y == m + 1){
y = 1, x++;
}
}
}
int main() {
int k;
cin >> n >> m >> k;
DFS(1, 1, k);
cout << cnt;
return 0;
}
Details
小提示：点击横条可展开更详细的信息
Test #1:
score: 10
Accepted
time: 0ms
memory: 1200kb
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: 0ms
memory: 1196kb
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: 1196kb
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: 1ms
memory: 1196kb
input:
3 5 5
output:
174
result:
ok 1 number(s): "174"
Test #10:
score: 10
Accepted
time: 0ms
memory: 1200kb
input:
4 3 5
output:
18
result:
ok 1 number(s): "18"
Extra Test:
score: 0
Extra Test Passed
