Submission #357551

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
357551	2021-01-24T05:41:20 Z	LastRonin	Hyper-minimum (IZhO11_hyper)	C++14	0 / 100	163 ms	60524 KB

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;

int z[N][N][N][N];
int 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.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	876 KB	Output is correct
3	Correct	6 ms	4460 KB	Output is correct
4	Correct	5 ms	4460 KB	Output is correct
5	Correct	6 ms	4460 KB	Output is correct
6	Correct	19 ms	13804 KB	Output is correct
7	Correct	27 ms	13676 KB	Output is correct
8	Correct	97 ms	31220 KB	Output is correct
9	Correct	53 ms	32876 KB	Output is correct
10	Correct	91 ms	31212 KB	Output is correct
11	Correct	163 ms	60524 KB	Output is correct
12	Runtime error	111 ms	6636 KB	Execution killed with signal 11
13	Halted	0 ms	0 KB	-