Submission #880017

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
880017	2023-11-28T15:10:07 Z	alexdd	Hyper-minimum (IZhO11_hyper)	C++17	0 / 100	2000 ms	262144 KB

hyper

#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[min(n,i+(((1<<0)&mask)!=0))][min(n,j+(((1<<1)&mask)!=0))][min(n,k+(((1<<2)&mask)!=0))][min(n,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;
}
/**



*/

Subtask #1

0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	4440 KB	Output is correct
2	Correct	2 ms	16728 KB	Output is correct
3	Correct	6 ms	39260 KB	Output is correct
4	Correct	7 ms	39408 KB	Output is correct
5	Correct	7 ms	39260 KB	Output is correct
6	Correct	21 ms	72284 KB	Output is correct
7	Correct	21 ms	72276 KB	Output is correct
8	Correct	75 ms	111248 KB	Output is correct
9	Correct	40 ms	112868 KB	Output is correct
10	Correct	72 ms	111184 KB	Output is correct
11	Correct	189 ms	153108 KB	Output is correct
12	Correct	445 ms	185208 KB	Output is correct
13	Correct	448 ms	184312 KB	Output is correct
14	Correct	267 ms	189948 KB	Output is correct
15	Correct	264 ms	214856 KB	Output is correct
16	Correct	738 ms	215544 KB	Output is correct
17	Correct	685 ms	216660 KB	Output is correct
18	Execution timed out	2452 ms	262144 KB	Time limit exceeded
19	Halted	0 ms	0 KB	-