답안 #337650

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
337650	2020-12-21T10:45:09 Z	amunduzbaev	최솟값 배열 (IZhO11_hyper)	C++14	100 / 100	371 ms	103148 KB

hyper

/** made by amunduzbaev **/
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long 
#define ld long double 
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
const int N = 40;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
ll n, m, k, ans;
ll a[5][N][N][N][N];
void solve(){
	fastios
	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[4][i][j][k][l];
				}
			}
		}
	}
	
	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-m+1;l++){
					a[3][i][j][k][l] = inf;
					for(int q=0;q<m;q++) a[3][i][j][k][l] = min(a[3][i][j][k][l], a[4][i][j][k][l+q]);
				}
			}
		}
	}
	
	
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			for(int k=0;k<n-m+1;k++){
				for(int l=0;l<n-m+1;l++){
					a[2][i][j][k][l] = inf;
					for(int q=0;q<m;q++) a[2][i][j][k][l] = min(a[2][i][j][k][l], a[3][i][j][k+q][l]);
				}
			}
		}
	}
	
	
	for(int i=0;i<n;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++){
					a[1][i][j][k][l] = inf;
					for(int q=0;q<m;q++) a[1][i][j][k][l] = min(a[1][i][j][k][l], a[2][i][j+q][k][l]);
				}
			}
		}
	}
	
	
	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++){
					a[0][i][j][k][l] = inf;
					for(int q=0;q<m;q++) a[0][i][j][k][l] = min(a[0][i][j][k][l], a[1][i+q][j][k][l]);
				}
			}
		}
	}
	
	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[0][i][j][k][l]<<" ";
				}//cout<<'\n';
			}
		}
	}
	
	
	
	return;
}


int main(){
	fastios
	int t = 1;
	if(t) solve();
	else {
		cin>>t;
		while (t--) solve();
	}
	return 0;
}

Subtask #1

100.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	876 KB	Output is correct
3	Correct	3 ms	2284 KB	Output is correct
4	Correct	3 ms	3052 KB	Output is correct
5	Correct	4 ms	3436 KB	Output is correct
6	Correct	15 ms	8556 KB	Output is correct
7	Correct	11 ms	6784 KB	Output is correct
8	Correct	27 ms	12284 KB	Output is correct
9	Correct	51 ms	24320 KB	Output is correct
10	Correct	29 ms	14060 KB	Output is correct
11	Correct	79 ms	29932 KB	Output is correct
12	Correct	159 ms	44524 KB	Output is correct
13	Correct	119 ms	35180 KB	Output is correct
14	Correct	201 ms	66540 KB	Output is correct
15	Correct	334 ms	90988 KB	Output is correct
16	Correct	176 ms	47212 KB	Output is correct
17	Correct	226 ms	60908 KB	Output is correct
18	Correct	371 ms	103148 KB	Output is correct
19	Correct	293 ms	74604 KB	Output is correct
20	Correct	211 ms	52588 KB	Output is correct