| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1329708 | Nika533 | Cultivation (JOI17_cultivation) | C++20 | 2094 ms | 327680 KiB |
#pragma GCC diagnostic warning "-std=c++11"
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define f first
#define s second
#define MOD 1000000007
#define flush fflush(stdout)
#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(), (x).rend()
#define pii pair<int,int>
using namespace std;
int n,m,T,k,r,c;
void test_case() {
cin>>r>>c>>n;
int arr[r+1][c+1];
for (int i=1; i<=r; i++) {
for (int j=1; j<=c; j++) {
arr[i][j]=0;
}
}
int a[n+1],b[n+1];
for (int i=1; i<=n; i++) {
cin>>a[i]>>b[i];
}
int ans=1e18;
for (int N=0; N<=r; N++) {
for (int S=0; S<=r; S++) {
for (int E=0; E<=c; E++) {
for (int W=0; W<=c; W++) {
for (int i=1; i<=r; i++) {
for (int j=1; j<=c; j++) {
arr[i][j]=0;
}
}
for (int o=1; o<=n; o++) {
for (int i=max(1ll,a[o]-N); i<=min(r,a[o]+S); i++) {
for (int j=max(1ll,b[o]-W); j<=min(c,b[o]+E); j++) {
arr[i][j]=1;
}
}
}
int cnt=0;
for (int i=1; i<=r; i++) {
for (int j=1; j<=c; j++) {
cnt+=arr[i][j];
}
}
if (cnt==r*c) {
ans=min(ans,N+S+W+E);
}
}
}
}
}
cout<<ans<<endl;
}
main () {
ios :: sync_with_stdio(0);
cin.tie(0); cout.tie(0);
T=1;
while (T--) test_case();
}
컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
