Submission #17722

#	Time	Username	Problem	Language	Result	Execution time	Memory
17722		Elibay	Hyper-minimum (IZhO11_hyper)	C++98	30 / 100	2000 ms	21712 KiB

hyper

#include <bits/stdc++.h>

using namespace std;

const int MaxN = 1e5 + 17, INF = 1e9 + 17;
int a[40][40][40][40], x[40][40][40][40], n, m, Min = INF;

int main ()
{
    ios_base :: sync_with_stdio (0);
    int i1, i2, i3, i4, j1, j2, j3, j4;
    cin >> n >> m;
    int w = n - m + 1;
    for (i1 = 1; i1 <= n; ++ i1)
    for (i2 = 1; i2 <= n; ++ i2)
    for (i3 = 1; i3 <= n; ++ i3)
    for (i4 = 1; i4 <= n; ++ i4)
        cin >> a[i1][i2][i3][i4],
        x[i1][i2][i3][i4] = a[i1][i2][i3][i4], Min = min (Min, a[i1][i2][i3][i4]);
    for (i1 = 1; i1 <= w; ++ i1)
    for (i2 = 1; i2 <= w; ++ i2)
    for (i3 = 1; i3 <= w; ++ i3)
    for (i4 = 1; i4 <= w; ++ i4)
    {
    for (j1 = i1; j1 <= i1 + m - 1; ++ j1)
    for (j2 = i2; j2 <= i2 + m - 1; ++ j2)
    for (j3 = i3; j3 <= i3 + m - 1; ++ j3)
    for (j4 = i4; j4 <= i4 + m - 1; ++ j4)
    {
        if (x[i1][i2][i3][i4] > a[j1][j2][j3][j4])
        {
            x[i1][i2][i3][i4] = a[j1][j2][j3][j4];
            if (x[i1][i2][i3][i4] == Min)
                goto l;
        }
    }
    l:;
    }
    for (i1 = 1; i1 <= w; ++ i1)
        for (i2 = 1; i2 <= w; ++ i2)
            for (i3 = 1; i3 <= w; ++ i3)
                for (i4 = 1; i4 <= w; ++ i4)
                    cout << x[i1][i2][i3][i4] << ' ';
    return 0;
}

• Subtask 1: 30 / 100