oj.uz

답안 #17695

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
17695 2016-01-12T08:48:46 Z Elibay 최솟값 배열 (IZhO11_hyper) C++
85 / 100
 2000 ms 21720 KB 
#include <bits/stdc++.h>
#define Fname "triangles"

using namespace std;

const int MaxN = 3e5 + 17, INF = 1e9 + 17, Mod = 1e9 + 7;

int a[40][40][40][40], x[40][40][40][40], n, m;

int main ()
{
    #ifdef Elibay
        freopen (".in", "r", stdin);
    #endif
    scanf ("%d%d", &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)
                    scanf ("%d", a[i][j][k] + l), x[i][j][k][l] = INF;
    for (int i1 = 1; i1 <= n - m + 1; ++ i1)
        for (int i2 = 1; i2 <= n - m + 1; ++ i2)
            for (int i3 = 1; i3 <= n - m + 1; ++ i3)
                for (int i4 = 1; i4 <= n - m + 1; ++ i4)
    for (int j1 = i1; j1 <= i1 + m - 1; ++ j1)
    for (int j2 = i2; j2 <= i2 + m - 1; ++ j2)
    for (int j3 = i3; j3 <= i3 + m - 1; ++ j3)
    for (int j4 = i4; j4 <= i4 + m - 1; ++ j4)
        x[i1][i2][i3][i4] = min (x[i1][i2][i3][i4], a[j1][j2][j3][j4]);
    for (int i1 = 1; i1 <= n - m + 1; ++ i1)
        for (int i2 = 1; i2 <= n - m + 1; ++ i2)
            for (int i3 = 1; i3 <= n - m + 1; ++ i3)
                for (int i4 = 1; i4 <= n - m + 1; ++ i4)
                    printf ("%d ", x[i1][i2][i3][i4]);
    return 0;
}

Subtask #1
85.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 21720 KB Output is correct
2 Correct 0 ms 21720 KB Output is correct
3 Correct 0 ms 21720 KB Output is correct
4 Correct 5 ms 21720 KB Output is correct
5 Correct 4 ms 21720 KB Output is correct
6 Correct 33 ms 21720 KB Output is correct
7 Correct 34 ms 21720 KB Output is correct
8 Correct 46 ms 21720 KB Output is correct
9 Correct 71 ms 21720 KB Output is correct
10 Correct 233 ms 21720 KB Output is correct
11 Correct 1230 ms 21720 KB Output is correct
12 Execution timed out 2000 ms 21716 KB Program timed out
13 Correct 134 ms 21720 KB Output is correct
14 Correct 480 ms 21720 KB Output is correct
15 Correct 392 ms 21720 KB Output is correct
16 Correct 1440 ms 21720 KB Output is correct
17 Execution timed out 2000 ms 21716 KB Program timed out
18 Correct 643 ms 21720 KB Output is correct
19 Execution timed out 2000 ms 21716 KB Program timed out
20 Correct 414 ms 21720 KB Output is correct