#include <bits/stdc++.h>
using namespace std;
#define FORN(i, a, b) for(int i=a; i<=b; ++i)
#define FORD(i, a, b) for(int i=a; i>=b; --i)
#define REPN(i, a, b) for(int i=a; i <b; ++i)
#define REPD(i, a, b) for(int i=(int)a-1; i>=b; --i)
const int maxR = 4*1e5;
const int maxN = 1e6 +10;
const int INF = 1e9 +7;
int M, N, B, P;
typedef tuple<int, int, int> i3;
vector< i3 > open[maxN], close[maxN];
struct Rectangle {
int x1, y1, x2, y2, cost;
Rectangle(){};
Rectangle(int x1, int y1, int x2, int y2): x1(x1), y1(y1), x2(x2), y2(y2) {};
void expand(int d) {
open[max(1, x1-d)].push_back({max(1, y1-d), y2, cost});
close[x2+1].push_back({max(1, y1-d), y2, cost});
}
friend istream & operator >> (istream &is, Rectangle &T) {
is >> T.x1 >> T.y1 >> T.x2 >> T.y2 >> T.cost;
return is;
}
} rec[maxR];
namespace subtask2 {
#define ii pair<int, int>
int a[maxN];
int it[4*maxN], t[4*maxN];
void lazy(int x, int l, int r) {
it[x] += t[x];
if (l != r) {
t[2*x] += t[x];
t[2*x+1] += t[x];
}
t[x] = 0;
}
void update(int x, int l, int r, int i, int j, int cost) {
lazy(x, l, r);
if (a[r] < i || j < a[l]) return;
if (i <= a[l] && a[r] <= j) {
t[x] = cost;
lazy(x, l, r);
return;
}
int m = l+r >> 1;
update(2*x, l, m, i, j, cost);
update(2*x+1, m+1, r, i, j, cost);
it[x] = min(it[2*x], it[2*x+1]);
}
int query(int x, int l, int r, int i, int j) {
lazy(x, l, r);
if (a[r] < i || j < a[l]) return INF;
if (i <= a[l] && a[r] <= j) return it[x];
int m = l+r >> 1;
return min(query(2*x, l, m, i, j), query(2*x+1, m+1, r, i, j));
}
bool ok(int d) {
FORN(i, 1, P) rec[i].expand(d -1);
open[M-d+2].push_back({1, N-d+1, 0});
int result = INF;
FORN(i, 1, M+1) {
if (open[i].size()) {
if (i > 1 && i-1 <= M-d+1)
result = min(result, query(1, 1, P+1, 1, N-d+1));
for(auto ss: open[i]) {
int y1, y2, cost;
tie(y1, y2, cost) = ss;
update(1, 1, P+1, y1, y2, cost);
}
}
for(auto ss: close[i]) {
int y1, y2, cost;
tie(y1, y2, cost) = ss;
update(1, 1, P+1, y1, y2, -cost);
}
}
FORN(i, 1, M) open[i].clear(), close[i].clear();
//cout << result << '\n';
return (result <= B);
}
void run() {
FORN(i, 1, P) a[i] = rec[i].y2 + 1;
a[P+1] = 1;
sort(a+1, a+P+2);
// ok(3);
int low = 0, high = min(M, N), result = 0;
while (low <= high) {
int mid = low + high >> 1;
if (ok(mid)) {
result = mid;
low = mid+1;
} else high = mid-1;
}
cout << result;
}
}
namespace subtask3 {
void run() {
}
}
int main() {
ios_base::sync_with_stdio(0);
cin >> M >> N >> B >> P;
FORN(i, 1, P) cin >> rec[i];
if (P <= 3e4) subtask2::run();
else subtask3::run();
return 0;
}
Compilation message
pyramid_base.cpp: In function 'void subtask2::update(int, int, int, int, int, int)':
pyramid_base.cpp:46:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
int m = l+r >> 1;
~^~
pyramid_base.cpp: In function 'int subtask2::query(int, int, int, int, int)':
pyramid_base.cpp:55:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
int m = l+r >> 1;
~^~
pyramid_base.cpp: In function 'void subtask2::run()':
pyramid_base.cpp:89:27: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
int mid = low + high >> 1;
~~~~^~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
45 ms |
47480 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
44 ms |
47324 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
48 ms |
47400 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
55 ms |
47556 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
69 ms |
47840 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
303 ms |
47872 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
309 ms |
47984 KB |
Output is correct |
| 2 |
Incorrect |
302 ms |
47612 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
92 ms |
47864 KB |
Output is correct |
| 2 |
Incorrect |
133 ms |
48124 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
407 ms |
50428 KB |
Output is correct |
| 2 |
Correct |
446 ms |
50956 KB |
Output is correct |
| 3 |
Incorrect |
529 ms |
51384 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
843 ms |
53268 KB |
Output is correct |
| 2 |
Correct |
336 ms |
52856 KB |
Output is correct |
| 3 |
Correct |
241 ms |
49548 KB |
Output is correct |
| 4 |
Correct |
996 ms |
57316 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1134 ms |
56092 KB |
Output is correct |
| 2 |
Incorrect |
1363 ms |
57904 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1109 ms |
54272 KB |
Output is correct |
| 2 |
Incorrect |
1570 ms |
58420 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
154 ms |
51192 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
208 ms |
53220 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
339 ms |
111352 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
