Submission #1269468

#	Time	Username	Problem	Language	Result	Execution time	Memory
1269468		medaa	최솟값 배열 (IZhO11_hyper)	C++20	100 / 100	180 ms	19744 KiB

hyper

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define endl '\n'

const int N = 36;
int a[N][N][N][N];
void SOLVE() {
    int n, m; cin >> n >> m;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            for(int k = 0; k < n; k++){
                for(int l = 0; l < n; l++){
                    cin >> a[i][j][k][l];
                }
            }
        }
    }
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            for(int k = 0; k < n; k++){
                for(int l = 0; l < n - m + 1; l++){
                    for(int v = 0; v < m; v++){
                        a[i][j][k][l] = min(a[i][j][k][l], a[i][j][k][l + v]);
                    }
                }
            }
        }
    }
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            for(int k = 0; k < n - m + 1; k++){
                for(int l = 0; l < n - m + 1; l++){
                    for(int v = 0; v < m; v++){
                        a[i][j][k][l] = min(a[i][j][k][l], a[i][j][k + v][l]);
                    }
                }
            }
        }
    }
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n - m + 1; j++){
            for(int k = 0; k < n - m + 1; k++){
                for(int l = 0; l < n - m + 1; l++){
                    for(int v = 0; v < m; v++){
                        a[i][j][k][l] = min(a[i][j][k][l], a[i][j + v][k][l]);
                    }
                }
            }
        }
    }
    for(int i = 0; i < n - m + 1; i++){
        for(int j = 0; j < n - m + 1; j++){
            for(int k = 0; k < n - m + 1; k++){
                for(int l = 0; l < n - m + 1; l++){
                    for(int v = 0; v < m; v++){
                        a[i][j][k][l] = min(a[i][j][k][l], a[i + v][j][k][l]);
                    }
                    cout << a[i][j][k][l] << " ";
                }
            }
        }
    }
}
signed main(){
    ios_base::sync_with_stdio(false); cout.tie(nullptr); cin.tie(nullptr);
    //int o_o; cin >> o_o; while(o_o--)
    SOLVE(); return 0;
}

• Subtask 1: 100 / 100