oj.uz

답안 #521664

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
521664 2022-02-02T17:44:38 Z Kalashnikov 최솟값 배열 (IZhO11_hyper) C++17
0 / 100
 1737 ms 262144 KB 
#include <bits/stdc++.h>
 
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second
 
using namespace std;
using ll = long long;
 
const int N = 36 , inf = 2e9 + 7;
const ll INF = 1e18 ,   mod = 1e9+7 , P = 6547;

int a[N][N][N][N][N];
int n , m;

void solve(int tc) {
	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 >> a[i][j][k][l][1];
				}
			}
		}
	}
	for(int h = 2; h <= m; h ++) {
		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 ++) {
						a[i][j][k][l][h] = inf;
						for(int p1: {0 , 1}) {
							for(int p2: {0 , 1}) {
								for(int p3: {0 , 1}) {
									for(int p4: {0 , 1}) {
										a[i][j][k][l][h] = min(a[i][j][k][l][h] , a[i+p1][j+p2][k+p3][l+p4][h-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 << a[i][j][k][l][m] << ' ';
				}
			}
		}
	}
}
/*
*/
main() {
    ios;
    int tt = 1 , tc = 0;
    // cin >> tt;
    while(tt --) {
        solve(++tc);
    }
    return 0;
}

Compilation message

hyper.cpp:61:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   61 | main() {
      | ^~~~

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 844 KB Output is correct
3 Correct 6 ms 5580 KB Output is correct
4 Correct 5 ms 5576 KB Output is correct
5 Correct 4 ms 5580 KB Output is correct
6 Correct 23 ms 18384 KB Output is correct
7 Correct 30 ms 18236 KB Output is correct
8 Correct 174 ms 43384 KB Output is correct
9 Correct 49 ms 45000 KB Output is correct
10 Correct 125 ms 43372 KB Output is correct
11 Correct 240 ms 85972 KB Output is correct
12 Correct 619 ms 149692 KB Output is correct
13 Correct 1198 ms 148472 KB Output is correct
14 Correct 301 ms 154352 KB Output is correct
15 Correct 333 ms 210116 KB Output is correct
16 Correct 1737 ms 198772 KB Output is correct
17 Correct 1002 ms 200096 KB Output is correct
18 Runtime error 523 ms 262144 KB Execution killed with signal 11
19 Halted 0 ms 0 KB -