제출 #1111690

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1111690		Nomio	최솟값 배열 (IZhO11_hyper)	C++17	100 / 100	217 ms	34636 KiB

hyper

#include<bits/stdc++.h>
#define f(i, n) for(int i = 0; i < n; i++)
using namespace std;
int x[35][35][35][35];
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n, m;
	cin >> n >> m;
	f(i, n) f(i1, n) f(i2, n) f(i3, n) cin >> x[i][i1][i2][i3];
	f(i, n) f(i1, n) f(i2, n) f(i3, n - m + 1) f(X, m) x[i][i1][i2][i3] = min(x[i][i1][i2][i3], x[i][i1][i2][i3 + X]);
	f(i, n) f(i1, n) f(i2, n - m + 1) f(i3, n) f(X, m) x[i][i1][i2][i3] = min(x[i][i1][i2][i3], x[i][i1][i2 + X][i3]);
	f(i, n) f(i1, n - m + 1) f(i2, n) f(i3, n) f(X, m) x[i][i1][i2][i3] = min(x[i][i1][i2][i3], x[i][i1 + X][i2][i3]);
	f(i, n - m + 1) f(i1, n) f(i2, n) f(i3, n) f(X, m) x[i][i1][i2][i3] = min(x[i][i1][i2][i3], x[i + X][i1][i2][i3]);
	f(i, n - m + 1) f(i1, n - m + 1) f(i2, n - m + 1) f(i3, n - m + 1) cout << x[i][i1][i2][i3] << ' ';
	cout << '\n';
	return 0;
}

• Subtask 1: 100 / 100