oj.uz

답안 #337553

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
337553 2020-12-21T04:54:15 Z beksultan04 최솟값 배열 (IZhO11_hyper) C++14
0 / 100
 2000 ms 28028 KB 
#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

hyper.cpp:21:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   21 | main(){
      |      ^
hyper.cpp: In function 'int main()':
hyper.cpp:12:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   12 | #define scan2(a,b) scanf("%lld %lld",&a, &b);
      |                    ~~~~~^~~~~~~~~~~~~~~~~~~~
hyper.cpp:23:5: note: in expansion of macro 'scan2'
   23 |     scan2(n,m)
      |     ^~~~~
hyper.cpp:11:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   11 | #define scan1(a) scanf("%lld",&a);
      |                  ~~~~~^~~~~~~~~~~
hyper.cpp:28:21: note: in expansion of macro 'scan1'
   28 |                     scan1(q[i][j][k][l])
      |                     ^~~~~

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 620 KB Output is correct
3 Correct 3 ms 1644 KB Output is correct
4 Correct 4 ms 1900 KB Output is correct
5 Correct 4 ms 2284 KB Output is correct
6 Correct 24 ms 5868 KB Output is correct
7 Correct 27 ms 4460 KB Output is correct
8 Correct 42 ms 8556 KB Output is correct
9 Correct 59 ms 17900 KB Output is correct
10 Correct 193 ms 9196 KB Output is correct
11 Correct 923 ms 20332 KB Output is correct
12 Execution timed out 2076 ms 28028 KB Time limit exceeded
13 Halted 0 ms 0 KB -