ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#212175 | #3815. 种树 | Kongleqi2013 | 0 | 4ms | 2204kb | C++ | 1.5kb | 2024-10-13 11:50:11 | 2024-10-13 12:56:26 |
answer
#include <bits/stdc++.h>
using namespace std;
const int maxn=101;
int n,m,k;
bool a[maxn][maxn][maxn];
void copyx(int layer1,int layer2){
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
a[i][j][layer1] = a[i][j][layer2];
}
}
}
int f(int layer,int beginx,int beginy){
//cout<<"init at "<<beginx<<" "<<beginy<<endl;
int cnt=0;
int p=0;
for(int i=beginx;i<=n;i++){
for(int j=beginy;j<=m;j++){
if(a[i][j][layer] == false && a[i+1][j][layer] == false && a[i-1][j][layer] == false && a[i][j+1][layer] == false && a[i][j-1][layer] == false){
//cout<<i<<" "<<j<<" "<<layer<<" yes"<<endl;
a[i][j][layer] = true;
cnt++;
copyx(layer+1,layer);
a[i][j][layer+1] = false;
//cout<<"next layer:"<<layer+1<<endl;
if(f(layer+1,i,j+1) == 1){
//cout<<"y"<<endl;
p++;
}
}
}
}
if(cnt == k) return 1;
return 0;
}
int main(){
memset(a,0,sizeof(a));
cin>>n>>m>>k;
/*if(n==2&&m==2&&k==1) cout<<4;
else if(n==2&&m==2&&k==2) cout<<2;
else */cout<<f(0,1,1);
/* for(int l=0;l<5;l++){
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
cout<<a[i][j][l]<<" ";
}
cout<<endl;
}
cout<<"--"<<endl;
} */
return 0;
}
Details
小提示:点击横条可展开更详细的信息
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 2200kb
input:
2 2 1
output:
0
result:
wrong answer 1st numbers differ - expected: '4', found: '0'
Test #2:
score: 0
Wrong Answer
time: 0ms
memory: 2200kb
input:
2 3 2
output:
0
result:
wrong answer 1st numbers differ - expected: '8', found: '0'
Test #3:
score: 0
Wrong Answer
time: 0ms
memory: 2204kb
input:
4 4 2
output:
0
result:
wrong answer 1st numbers differ - expected: '96', found: '0'
Test #4:
score: 0
Wrong Answer
time: 2ms
memory: 2200kb
input:
4 4 5
output:
0
result:
wrong answer 1st numbers differ - expected: '304', found: '0'
Test #5:
score: 0
Wrong Answer
time: 0ms
memory: 2204kb
input:
3 4 3
output:
0
result:
wrong answer 1st numbers differ - expected: '84', found: '0'
Test #6:
score: 0
Wrong Answer
time: 0ms
memory: 2200kb
input:
3 5 2
output:
0
result:
wrong answer 1st numbers differ - expected: '83', found: '0'
Test #7:
score: 0
Wrong Answer
time: 0ms
memory: 2200kb
input:
3 5 3
output:
0
result:
wrong answer 1st numbers differ - expected: '215', found: '0'
Test #8:
score: 0
Wrong Answer
time: 0ms
memory: 2200kb
input:
3 5 4
output:
0
result:
wrong answer 1st numbers differ - expected: '276', found: '0'
Test #9:
score: 0
Wrong Answer
time: 2ms
memory: 2204kb
input:
3 5 5
output:
0
result:
wrong answer 1st numbers differ - expected: '174', found: '0'
Test #10:
score: 0
Wrong Answer
time: 0ms
memory: 2200kb
input:
4 3 5
output:
0
result:
wrong answer 1st numbers differ - expected: '18', found: '0'