#include <bits/stdc++.h>
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second
using namespace std;
using ll = long long;
const int N = 36 , inf = 2e9 + 7;
const ll INF = 1e18 , mod = 1e9+7 , P = 6547;
int a[N][N][N][N][N];
int n , m;
void solve(int tc) {
cin >> n >> m;
for(int i = 1; i <= n; i ++) {
for(int j = 1; j <= n; j ++) {
for(int k = 1; k <= n; k ++) {
for(int l = 1; l <= n; l ++) {
cin >> a[i][j][k][l][1];
}
}
}
}
for(int h = 2; h <= m; h ++) {
for(int i = 1; i <= n-m+1; i ++) {
for(int j = 1; j <= n-m+1; j ++) {
for(int k = 1; k <= n-m+1; k ++) {
for(int l = 1; l <= n-m+1; l ++) {
a[i][j][k][l][h] = inf;
for(int p1: {0 , 1}) {
for(int p2: {0 , 1}) {
for(int p3: {0 , 1}) {
for(int p4: {0 , 1}) {
a[i][j][k][l][h] = min(a[i][j][k][l][h] , a[i+p1][j+p2][k+p3][l+p4][h-1]);
}
}
}
}
if(h == m) {
cout << a[i][j][k][l][h] << ' ';
}
}
}
}
}
}
}
/*
*/
main() {
ios;
int tt = 1 , tc = 0;
// cin >> tt;
while(tt --) {
solve(++tc);
}
return 0;
}
Compilation message
hyper.cpp:55:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
55 | main() {
| ^~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
