oj.uz

답안 #521680

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
521680 2022-02-02T17:55:57 Z Kalashnikov 최솟값 배열 (IZhO11_hyper) C++17
100 / 100
 368 ms 25132 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 = 35 , inf = 2e9 + 7;
const ll INF = 1e18 ,   mod = 1e9+7 , P = 6547;

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

void solve(int tc) {
	cin >> n >> m;
	for(int i = 0; i < n; i ++) {
		for(int j = 0; j < n; j ++) {
			for(int k = 0; k < n; k ++) {
				for(int l = 0; l < n; l ++) {
					cin >> a[i][j][k][l][1];
				}
			}
		}
	}
	for(int h = 2; h <= m; h ++) {
		for(int i = 0; i < n-h+1; i ++) {
			for(int j = 0; j < n-h+1; j ++) {
				for(int k = 0; k < n-h+1; k ++) {
					for(int l = 0; l < n-h+1; l ++) {
						a[i][j][k][l][h%2] = 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%2] = min(a[i][j][k][l][h%2] , a[i+p1][j+p2][k+p3][l+p4][h%2^1]);
									}
								}
							}
						}
					}
				}
			}
		}
	}
	for(int i = 0; i < n-m+1; i ++) {
		for(int j = 0; j < n-m+1; j ++) {
			for(int k = 0; k < n-m+1; k ++) {
				for(int l = 0; l < n-m+1; l ++) {
					cout << a[i][j][k][l][m%2] << ' ';
				}
			}
		}
	}
}
/*
*/
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
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 2 ms 972 KB Output is correct
4 Correct 2 ms 972 KB Output is correct
5 Correct 2 ms 1028 KB Output is correct
6 Correct 10 ms 2252 KB Output is correct
7 Correct 9 ms 2124 KB Output is correct
8 Correct 29 ms 4044 KB Output is correct
9 Correct 31 ms 5604 KB Output is correct
10 Correct 30 ms 4056 KB Output is correct
11 Correct 84 ms 7032 KB Output is correct
12 Correct 180 ms 10168 KB Output is correct
13 Correct 178 ms 8888 KB Output is correct
14 Correct 162 ms 14816 KB Output is correct
15 Correct 225 ms 22416 KB Output is correct
16 Correct 289 ms 10868 KB Output is correct
17 Correct 276 ms 12256 KB Output is correct
18 Correct 297 ms 25132 KB Output is correct
19 Correct 364 ms 14148 KB Output is correct
20 Correct 368 ms 11988 KB Output is correct