Submission #880018

# Submission time Handle Problem Language Result Execution time Memory
880018 2023-11-28T15:11:21 Z alexdd Hyper-minimum (IZhO11_hyper) C++17
0 / 100
2000 ms 262144 KB
#include<bits/stdc++.h>
using namespace std;
int x[35][35][35][35];
int mnm[35][35][35][35][35];
int n,m;
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    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>>x[i][j][k][l];
                    mnm[i][j][k][l][1] = x[i][j][k][l];
                }
            }
        }
    }
    for(int p=2;p<=m;p++)
    {
        for(int i=n-p+1;i>0;i--)
        {
            for(int j=n-p+1;j>0;j--)
            {
                for(int k=n-p+1;k>0;k--)
                {
                    for(int l=n-p+1;l>0;l--)
                    {
                        mnm[i][j][k][l][p] = mnm[i][j][k][l][p-1];
                        for(int mask=1;mask<(1<<4);mask++)
                        {
                            mnm[i][j][k][l][p] = min(mnm[i][j][k][l][p], mnm[i+(((1<<0)&mask)!=0)][j+(((1<<1)&mask)!=0)][k+(((1<<2)&mask)!=0)][l+(((1<<3)&mask)!=0)][p-1]);
                        }
                    }
                }
            }
        }
    }
    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++)
                {
                    cout<<mnm[i][j][k][l][m]<<" ";
                }
            }
        }
    }
    return 0;
}
/**



*/
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 2 ms 16732 KB Output is correct
3 Correct 6 ms 39456 KB Output is correct
4 Correct 6 ms 39260 KB Output is correct
5 Correct 6 ms 39420 KB Output is correct
6 Correct 19 ms 72284 KB Output is correct
7 Correct 19 ms 72272 KB Output is correct
8 Correct 65 ms 111256 KB Output is correct
9 Correct 37 ms 112720 KB Output is correct
10 Correct 61 ms 111264 KB Output is correct
11 Correct 168 ms 153120 KB Output is correct
12 Correct 362 ms 185316 KB Output is correct
13 Correct 388 ms 184144 KB Output is correct
14 Correct 233 ms 189816 KB Output is correct
15 Correct 243 ms 214612 KB Output is correct
16 Correct 562 ms 203176 KB Output is correct
17 Correct 589 ms 204624 KB Output is correct
18 Execution timed out 2377 ms 262144 KB Time limit exceeded
19 Halted 0 ms 0 KB -