Submission #1300038

#TimeUsernameProblemLanguageResultExecution timeMemory
1300038PetrixHyper-minimum (IZhO11_hyper)C++20
100 / 100
188 ms25364 KiB
#include <iostream> using namespace std; int v[50][50][50][50]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int i,j,k,l,n,m,x; cin>>n>>m; for(i=0;i<n;i++){ for(j=0;j<n;j++){ for(k=0;k<n;k++){ for(l=0;l<n;l++) cin>>v[i][j][k][l]; } } } for(i=0;i<n;i++){ for(j=0;j<n;j++){ for(k=0;k<n;k++){ for(l=0;l<n;l++){ for(x=i;x<min(n,i+m);x++){ v[i][j][k][l]=min(v[i][j][k][l],v[x][j][k][l]); } } } } } for(i=0;i<n;i++){ for(j=0;j<n;j++){ for(k=0;k<n;k++){ for(l=0;l<n;l++){ for(x=j;x<min(n,j+m);x++){ v[i][j][k][l]=min(v[i][j][k][l],v[i][x][k][l]); } } } } } for(i=0;i<n;i++){ for(j=0;j<n;j++){ for(k=0;k<n;k++){ for(l=0;l<n;l++){ for(x=k;x<min(n,k+m);x++){ v[i][j][k][l]=min(v[i][j][k][l],v[i][j][x][l]); } } } } } for(i=0;i<n;i++){ for(j=0;j<n;j++){ for(k=0;k<n;k++){ for(l=0;l<n;l++){ for(x=l;x<min(n,l+m);x++){ v[i][j][k][l]=min(v[i][j][k][l],v[i][j][k][x]); } } } } } for(i=0;i<=n-m;i++){ for(j=0;j<=n-m;j++){ for(k=0;k<=n-m;k++){ for(l=0;l<=n-m;l++){ cout<<v[i][j][k][l]<<" "; } } } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...