제출 #17694

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
17694		Elibay	최솟값 배열 (IZhO11_hyper)	C++98	75 / 100	2000 ms	13444 KiB

hyper

#include <bits/stdc++.h>
#define Fname "triangles"

using namespace std;

const int MaxN = 3e5 + 17, INF = 1e9 + 17, Mod = 1e9 + 7;

int a[35][35][35][35], x[35][35][35][35], n, m;

int main ()
{
    #ifdef Elibay
        freopen (".in", "r", stdin);
    #endif
    scanf ("%d%d", &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)
                    scanf ("%d", a[i][j][k] + l), x[i][j][k][l] = INF;
    for (int i1 = 1; i1 <= n - m + 1; ++ i1)
        for (int i2 = 1; i2 <= n - m + 1; ++ i2)
            for (int i3 = 1; i3 <= n - m + 1; ++ i3)
                for (int i4 = 1; i4 <= n - m + 1; ++ i4)
    for (int j1 = i1; j1 <= i1 + m - 1; ++ j1)
    for (int j2 = i2; j2 <= i2 + m - 1; ++ j2)
    for (int j3 = i3; j3 <= i3 + m - 1; ++ j3)
    for (int j4 = i4; j4 <= i4 + m - 1; ++ j4)
        x[i1][i2][i3][i4] = min (x[i1][i2][i3][i4], a[j1][j2][j3][j4]);
    for (int i1 = 1; i1 <= n - m + 1; ++ i1)
        for (int i2 = 1; i2 <= n - m + 1; ++ i2)
            for (int i3 = 1; i3 <= n - m + 1; ++ i3)
                for (int i4 = 1; i4 <= n - m + 1; ++ i4)
                    printf ("%d ", x[i1][i2][i3][i4]);
    return 0;
}

• Subtask 1: 75 / 100