闲蛋皇yyds

常规
1

#include<bits/stdc++.h>
using namespace std;
bool st[55][55][55];
int a[55][55][55];
int dx[6] = {0, 1, 0, -1, 0, 0};
int dy[6] = {1, 0, -1, 0, 0, 0};
int dz[6] = {0, 0, 0, 0, -1, 1};
int ans = 0;
int l, w, h, m;
struct LLL {
int x, y, z;
};

void bfs(int i, int j, int k) {
queue q;
q.push({i, j, k});
st[i][j][k] = true;
while (!q.empty()) {
LLL t = q.front(); q.pop();
int x = t.x, y = t.y, z = t.z;
for (int i = 0; i < 6; ++ i) {
int nx = x + dx[i];
int ny = y + dy[i];
int nz = z + dz[i];
if (nx <= 0 || ny <= 0 | nz <= 0) continue;
if (nx > l || ny > w || nz > h) continue;
if (st[nx][ny][nz]) continue;
if (abs(a[nx][ny][nz] - a[y][z]) <= m) {
st[nx][ny][nz] = true;
q.push({nx, ny, nz});
}
}
}
ans ++;
}
int main(){
cin >> l >> w >> h;
cin >> m;
for (int i = 1; i <= l; ++ i) {
for (int j = 1; j <= w; ++ j) {
for (int k = 1; k <= h; ++ k) {
cin >> a[i][j][k];
}
}
}
for (int i = 1; i <= l; ++ i) {
for (int j = 1; j <= w; ++ j) {
for (int k = 1; k <= h; ++ k) {
if (!st[i][j][k]) {
bfs(i ,j ,k);
}
}
}
}
cout << ans;
return 0;

}

1 个赞
2

#include<bits/stdc++.h>
using namespace std;
int a[1099][1099],c,n,m,t,sx,sy,fx,fy,x,y;
char b;
int LLL(int x1,int y_1,int time){
int dist = abs(fx - x1) + abs(fy - y_1);
if (t - time < dist) return 0;
if(x1>n||y_1>m) return 0;
//a[x1][y_1]=1;
int DDD=0;
if(x1==fx&&y_1==fy&&time==t) {
a[x1][y_1]=0;
return 1;
}
time++;
if(x1-1!=0&&a[x1-1][y_1]==0) DDD+=LLL(x1-1,y_1,time);
if(y_1-1!=0&&a[x1][y_1-1]==0) DDD+=LLL(x1,y_1-1,time);
if(x1+1!=0&&a[x1+1][y_1]==0) DDD+=LLL(x1+1,y_1,time);
if(y_1+1!=0&&a[x1][y_1+1]==0) DDD+=LLL(x1,y_1+1,time);
a[x1][y_1]=0;
return DDD;
}
int main(){
cin>>n>>m>>t;
for(int i=1;i<=n;i++){
for(int l=1;l<=m;l++){
cin>>b;
if(b==‘.’) a[i][l]=0;
else a[i][l]=1;
}
}
cin>>sx>>sy>>fx>>fy;
/*
cout<<endl;
for(int i=1;i<=16;i++){
for(int j=1;j<=16;j++){
cout<<a[i][j];
}
cout<<endl;
}*/
c+=LLL(sx,sy,0);
cout<<c<<endl;

return 0;
}

3

//最佳调度
#include<bits/stdc++.h>
using namespace std;
int a,b,c,n,k,tim[10086],mine,MMM[100086];
void LLL(int x){//X:任务个数
int maxe=-1000086;
for(int i=1;i<=n;i++){
maxe=max(maxe,MMM[i]);
}
if(maxe>=mine) return ; //剪枝1
if(x>n){
mine=min(mine,maxe);
return ;
}
//for遍历当前任务到每个机器
for(int i=1;i<=k;i++){
if(i>1 && MMM[i]==MMM[i-1]) continue;//剪枝2
MMM[i]+=tim;
LLL(x+1);
MMM[i]-=tim;
}
return ;
}
bool abab(int x,int y){
return x>y;
}
int main(){
mine = 100099;
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>tim[i];
}
sort(tim+1,tim+n+1,abab);//jian zhi3
LLL(1);
cout<<mine;
return 0;
}

4

//最佳调度
那个勾是

5

[ x ]

6

别给自己解决

7

// Function
#include<bits/stdc++.h>
using namespace std;
long long a,b,c,DDD[26][26][26];
long long LLL(long long x,long long y,long long z){
if(x<=0||y<=0||z<=0) return 1;
if(x>20||y>20||z>20){
if(DDD[20][20][20]!=4557430888798830399) return DDD[20][20][20];
DDD[20][20][20]=LLL(20,20,20);
return DDD[20][20][20];
}
if(DDD[y][z]!=4557430888798830399) return DDD[y][z];
if(x<y&&y<z){
DDD[y][z]=LLL(x,y,z-1)+LLL(x,y-1,z-1)-LLL(x,y-1,z);
return DDD[y][z];
}
DDD[y][z]=LLL(x-1,y,z)+LLL(x-1,y-1,z)+LLL(x-1,y,z-1)-LLL(x-1,y-1,z-1);
return DDD[y][z];
}
int main(){
memset(DDD,63,sizeof(DDD));
while(cin >> a >> b >> c){
if (a == -1 && b == -1 && c == -1) break;
cout<<“w(”<<a<<", “<<b<<”, “<<c<<”) = "<<LLL(a,b,c);
cout<<endl;
}
return 0;
}

8

//四元组
#include<bits/stdc++.h>
using namespace std;
int a,b,c,d,n,k,fxg;
int main(){
freopen(“quadruple.in”,“r”,stdin);
freopen(“quadruple.out”,“w”,stdout);
cin>>n>>k;
if(k==0) k-=1;
for(a=n;a>1;a–){
if(a!=k){
for(b=n;b>n/a;b–){
if(b!=k&&ab>n){//一优
int GGG=ab-n;
for(c=a-1;c>=a-n/b;c–){//二优
if(GGG%c==0){
if(GGG/c<b&&GGG/c>0){//三优
//cout<<a<<’ ‘<<b<<’ ‘<<c<<’ '<<GGG/c<<endl;
fxg++;
}
}
}
}
}
}
}
cout<<fxg;
return 0;
}

9

屎山代码发力了

10

确实

11

這是僞代碼？？？

12

此话题已在最后回复的 15 天后被自动关闭。不再允许新回复。