#include<bits/stdc++.h>
#define pb push_back
#define pf push_front
#define mp make_pair
#define F first
#define S second
#define ff first
#define ss second
#define str string
#define Wansur "gay"
#define ll int
#define ull unsigned ll
#define ld long double
#define pll pair<ll,ll>
#define plll pair<pll,ll>
#define pllll pair<pll,pll>
#define pii pair<int,int>
#define pld pair<ld,ld>
#define vl vector<ll>
#define vll vector<pll>
#define vlll vector<plll>
#define vllll vector<pllll>
#define vb vector<bool>
#define vi vector<int>
#define vii vector<pii>
#define sz(x) (ll)(x).size()
#define fr front()
#define tp top()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define bk back();
#pragma GCC target( "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")
using namespace std;
const ld pi=acos(-1.0);
const ll e5=1e5;
const ll e6=1e6;
const ll e9=1e9;
const ll inf=1e18;
const ll mod=1e9+7;
const ll mod2=998244353;
const ll MOD=106710087877475399;
const ll N=36;
const ll M=1e2+10;
const ld eps=1e-9;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll bpm(ll x,ll y,ll m){if(y==0)return 1%m;ll p=bpm(x,y/2,m);
if(y%2==0)return (__int128)p*p%m;else return (__int128)p*p%m*x%m;}
ll bp(ll x,ll y){if(y==0)return 1;ll p=bp(x,y/2);
if(y%2==0)return p*p;else return p*p*x;}
ll n,m;
ll x[N][N][N][N][N];
void solve(){
cin>>n>>m;
for(ll i=1;i<=n;i++){
for(ll j=1;j<=n;j++){
for(ll k=1;k<=n;k++){
for(ll l=1;l<=n;l++){
cin>>x[i][j][k][l][0];
}
}
}
}
for(ll d=1;d<m;d++){
for(ll i=1;i<=n-d;i++){
for(ll j=1;j<=n-d;j++){
for(ll k=1;k<=n-d;k++){
for(ll l=1;l<=n-d;l++){
x[i][j][k][l][d]=min({x[i][j][k][l][d-1],
x[i][j][k][l+1][d-1], x[i][j][k+1][l][d-1], x[i][j][k+1][l+1][d-1],
x[i][j+1][k][l][d-1], x[i][j+1][k][l+1][d-1], x[i][j+1][k+1][l][d-1],
x[i][j+1][k+1][l+1][d-1], x[i+1][j][k][l][d-1], x[i+1][j][k][l+1][d-1],
x[i+1][j][k+1][l][d-1], x[i+1][j][k+1][l+1][d-1], x[i+1][j+1][k][l][d-1],
x[i+1][j+1][k][l+1][d-1], x[i+1][j+1][k+1][l][d-1], x[i+1][j+1][k+1][l+1][d-1]});
}
}
}
}
}
for(ll i=1;i<=n-m+1;i++){
for(ll j=1;j<=n-m+1;j++){
for(ll k=1;k<=n-m+1;k++){
for(ll l=1;l<=n-m+1;l++){
cout<<x[i][j][k][l][m-1]<<' ';
}
}
}
}
}
int main(/*Aldk*/){
ios_base::sync_with_stdio(false); cin.tie(NULL);
// freopen("hyper.in", "r", stdin);
// freopen("hyper.out ", "w", stdout);
//cout<<setprecision(6)<<fixed;
int test=1;
// cin>>test;
for(int i=1;i<=test;i++){
solve();
// cout<<'\n';
}
return 0;
}
Compilation message (stderr)
stones.cpp:39:14: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
39 | const ll inf=1e18;
| ^~~~
stones.cpp:42:14: warning: overflow in conversion from 'long int' to 'int' changes value from '106710087877475399' to '1910717511' [-Woverflow]
42 | const ll MOD=106710087877475399;
| ^~~~~~~~~~~~~~~~~~| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
