oj.uz

답안 #17873

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
17873 2016-01-13T03:14:32 Z Adilkhan 최솟값 배열 (IZhO11_hyper) C++
30 / 100
 959 ms 31712 KB 
#include <bits/stdc++.h>
 
#define pb push_back
#define endl "\n"
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define fname ""
#define sz(x) (int)(x.size())
 
typedef long long ll;
 
using namespace std;
 
const ll N = (ll)(5e5) + 322;
const ll INF = (ll)(1e9);
const ll mod = (ll)(1e9) + 7;
const double eps = 1e-9;
 
int n, m, sz, a[40][40][40][40], sm, d[40][40][40][40], pre[40][40][40][40];
 
inline int getmn(int I, int J, int K, int Q) {
    int res = INF;
    for (int i = I; i <= I + m - 1; ++i) {
        for (int j = J; j <= J + m - 1; ++j) {
            for (int k = K; k <= K + m - 1; ++k) {
                for (int q = Q; q <= Q + m - 1; ++q) {
                    res = min(a[i][j][k][q], res);                 
                    if (res == pre[i][j][k][q]) break;
                }
            }      
        }
    }
    return res;
}
 
int main () {
  	ios_base :: sync_with_stdio(false);
    //freopen(fname".in", "r", stdin);
    //freopen(fname".out", "w", stdout);
    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 q = 1; q <= n; ++q) {
              	cin >> a[i][j][k][q];
              }
              pre[i][j][k][n + 1] = INF;
                for (int q = n; q >= 1; --q) {
                pre[i][j][k][q] = min(pre[i][j][k][q + 1], a[i][j][k][q]);
              }
            }
        }
    }
    sm = n - m + 1;
    for (int i = 1; i <= sm; ++i) {
        for (int j = 1; j <= sm; ++j) {
          for (int k = 1; k <= sm; ++k) {
            for (int q = 1; q <= sm; ++q) {
            	cout << getmn(i, j, k, q) << ' ';   
            }
          }
        }                  
    }
    return 0;
}

Subtask #1
30.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 31712 KB Output is correct
2 Correct 0 ms 31712 KB Output is correct
3 Correct 0 ms 31712 KB Output is correct
4 Runtime error 0 ms 31712 KB writev (syscall #20) was called by the program (disallowed syscall)
5 Runtime error 0 ms 31712 KB writev (syscall #20) was called by the program (disallowed syscall)
6 Runtime error 0 ms 31712 KB writev (syscall #20) was called by the program (disallowed syscall)
7 Runtime error 28 ms 31712 KB writev (syscall #20) was called by the program (disallowed syscall)
8 Correct 47 ms 31712 KB Output is correct
9 Runtime error 22 ms 31712 KB writev (syscall #20) was called by the program (disallowed syscall)
10 Runtime error 68 ms 31712 KB writev (syscall #20) was called by the program (disallowed syscall)
11 Runtime error 93 ms 31712 KB writev (syscall #20) was called by the program (disallowed syscall)
12 Runtime error 195 ms 31712 KB writev (syscall #20) was called by the program (disallowed syscall)
13 Correct 147 ms 31712 KB Output is correct
14 Runtime error 116 ms 31712 KB writev (syscall #20) was called by the program (disallowed syscall)
15 Runtime error 155 ms 31712 KB writev (syscall #20) was called by the program (disallowed syscall)
16 Runtime error 959 ms 31712 KB writev (syscall #20) was called by the program (disallowed syscall)
17 Runtime error 168 ms 31712 KB writev (syscall #20) was called by the program (disallowed syscall)
18 Runtime error 214 ms 31712 KB writev (syscall #20) was called by the program (disallowed syscall)
19 Runtime error 298 ms 31712 KB writev (syscall #20) was called by the program (disallowed syscall)
20 Correct 373 ms 31712 KB Output is correct