제출 #357550

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
357550		LastRonin	최솟값 배열 (IZhO11_hyper)	C++14	0 / 100	2084 ms	118124 KiB

hyper

#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define mp make_pair
#define si short int
#define speed ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define pill pair<ll,ll>
#define f first
#define s second
#define pilc pair<ll,char>
#define all(a) (a).begin(),(a).end()
#define rep(s,e,step) for(int i = (s); i < (e) ; i += step)
#define vrep(s,e,step) for(int j = (s); j < (e) ; j += step)
#define ex exit(0) 
#define sz(a) (a).size()
#define triple pair<pill, ll>
#define pinode pair<node*, node*>
#define quadra pair<pill, pill>
#define ld long double
using namespace std;
 
const ll N = 30;
const ll M = 1e3 + 10;
const ll big = 2e9;
const ll hsh2 = 1964325029;
const ll wp = 491;
const long long mod = 1e9 + 7;
const long double EPS = 1e-14;
const ll block = 1e7;
const ll shift = 2e3;
mt19937_64 rofl(chrono::steady_clock::now().time_since_epoch().count());

ll n, m;

ll z[N][N][N][N];
ll p[N][N][N][N][N];

int main() {
	speed;
	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 >> z[i][j][k][l];
				}
			}
		}
	}
	for(int i = n; i >= 1; i--) {
		for(int j = n; j >= 1; j--) {
			for(int k = n; k >= 1; k--) {
				for(int l = n; l >= 1; l--) {
					p[i][j][k][l][1] = z[i][j][k][l];
					for(int h = 2; h <= m; h++) {						
						p[i][j][k][l][h] = big;
						for(int z = 0; z < 2; z++) {
							for(int z1 = 0; z1 < 2; z1++) {
								for(int z2 = 0; z2 < 2; z2++) {
									for(int z3 = 0; z3 < 2; z3++) {
										p[i][j][k][l][h] = min(p[i][j][k][l][h], p[i + z][j + z1][k + z2][l + z3][h - 1]);
									}
								}
							}
						}
					}
				}
			}
		}
	}
	for(int i = 1; i <= n - m + 1; i++) {
		for(int j = 1; j <= n - m + 1; j++) {
			for(int l = 1; l <= n - m + 1; l++) {
				for(int k = 1; k <= n - m + 1; k++) {
					cout << p[i][j][l][k][m] << ' ';
				}
			}
		}
	}
}                     
/*
AAAACACA
*/

• Subtask 1: 0 / 100