이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
#pragma GCC optimize("Ofast")
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define int long long
#define lowbit(x) x&-x
const int maxn = 5000 + 5;
const int INF = 1e18;
int a[maxn][maxn], dp[maxn * 2][maxn], h[maxn], c[maxn], mx[maxn * 2];
signed main(void){
// fastio;
int n, m, d;
cin>>n>>m>>d;
set<int> cx, cy;
for(int i = 0; i < n; i++){
int x, y;
cin>>x>>y;
cx.insert(x), cy.insert(y);
h[x] |= 1;
c[y] |= 1;
}
for(int i = 0; i < m; i++){
int x, y;
cin>>x>>y;
a[x][y] = 2;
// h[x] |= 2, c[y] |= 2;
}
auto cal = [&](int x, int y) -> int {
if(x <= 0 || y <= 0) return 0;
// cout<<"cal : "<<x<<" "<<y<<"\n";
y = min(y, d - 1);
x = min(x, d - 1);
return (x + y) * d - x * y;
};
int ans = 0;
for(int j = d - 1; j >= 0; j--){
if(c[j]) continue;
for(int i = 0; i < d; i++){
if(h[i] || a[i][j]) continue;
dp[i][j] = dp[i][j + 1] + 1;
// cout<<"ok : "<<i<<" "<<j<<" "<<dp[i][j]<<"\n";
}
for(int i = d; i < 2 * d; i++) dp[i][j] = dp[i - d][j];
vector<int> st;
for(int i = 0; i < 2 * d; i++){
while(st.size() && dp[st.back()][j] > dp[i][j]){
int id = st.back(); st.pop_back();
ans = max(ans, cal(dp[id][j], mx[id] + (i - id) - 1));
}
mx[i] = (st.size() ? i - st.back() : i + 1);
st.pb(i);
}
while(!st.empty()){
ans = max(ans, cal(dp[st.back()][j], mx[st.back()] + 2 * d - st.back() - 1));
st.pop_back();
}
}
ans = d * d - ans;
int cur = *(cx.rbegin()) + 1;
int id = 0;
for(int i = 0; i < d; i++){
ans = min(ans, d * cur);
if(!cx.count(i)) cur--;
else cur = d;
}
ans = min(ans, d * cur);
cur = *(cy.rbegin()) + 1;
for(int i = 0; i < d; i++){
ans = min(ans, d * cur);
if(!cy.count(i)) cur--;
else cur = d;
}
ans = min(ans, d * cur);
cout<<ans<<"\n";
}
컴파일 시 표준 에러 (stderr) 메시지
garden.cpp: In function 'int main()':
garden.cpp:67:9: warning: unused variable 'id' [-Wunused-variable]
67 | int id = 0;
| ^~
# | 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... |