# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
337553 | beksultan04 | Hyper-minimum (IZhO11_hyper) | C++14 | 2076 ms | 28028 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
const int N = 1e6+12,INF=1e9+7;
int q[100][100][100][100],a[100][100][100][100];
main(){
int n,m,i,j,k,l,i1,i2,i3,i4,j1,j2,j3,j4;
scan2(n,m)
for (i=1;i<=n;++i)
for (j=1;j<=n;++j)
for (k=1;k<=n;++k)
for (l=1;l<=n;++l)
scan1(q[i][j][k][l])
for (i1=1;i1<=n-m+1;++i1)
for (i2=1;i2<=n-m+1;++i2)
for (i3=1;i3<=n-m+1;++i3)
for (i4=1;i4<=n-m+1;++i4){
int mn = INF;
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++)
mn = min(mn,q[j1][j2][j3][j4]);
a[i1][i2][i3][i4] = mn;
}
for (i=1;i<=n-m+1;++i)
for (j=1;j<=n-m+1;++j)
for (k=1;k<=n-m+1;++k)
for (l=1;l<=n-m+1;++l)
cout <<a[i][j][k][l]<<" ";
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |