#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
const int mod = 1e9+7, N = 38;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val);}
int n, m;
int a[N][N][N][N];
int ans[N][N][N][N];
int get(int i, int j, int k, int l){
int I, J, K, L;
int res = mod;
for(I=1;I<=min(n, i+m-1);I++)
for(J=1;J<=min(n, j+m-1);J++)
for(K=1;K<=min(n, k+m-1);K++)
for(L=1;L<=min(n, l+m-1);L++)
res = min(res, a[I][J][K][L]);
return res;
}
void solve(int test_case){
int i, j, k, l;
cin >> n >> m;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
for(k=1;k<=n;k++)
for(l=1;l<=n;l++)
cin >> a[i][j][k][l];
int li = n-m+1;
for(i=1;i<=li;i++)
for(j=1;j<=li;j++)
for(k=1;k<=li;k++)
for(l=1;l<=li;l++){
ans[i][j][k][l] = get(i,j,k,l);
}
for(i=1;i<=li;i++)
for(j=1;j<=li;j++)
for(k=1;k<=li;k++)
for(l=1;l<=li;l++)
cout << ans[i][j][k][l] << ' ';
cout << '\n';
return;
}
signed main(){
FASTIO;
#define MULTITEST 0
#if MULTITEST
int ___T;
cin >> ___T;
for(int T_CASE = 1; T_CASE <= ___T; T_CASE++)
solve(T_CASE);
#else
solve(1);
#endif
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
492 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
