// vaziat meshki-ghermeze !
#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'
using namespace std;
typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const ll Mod = 1000000007LL;
const int N = 6e3 + 10;
const int Q = 3e6 + 10;
const ll Inf = 2242545357980376863LL;
const ll Log = 30;
// X : X + T;
// Y : X - T;
vector<int> cx, cy;
void Add(int x, int y){ cx.pb(x); cy.pb(y); }
void Uni(vector<int>& C){
sort(all(C));
C.resize(unique(all(C)) - C.begin());
}
void Init(){ Uni(cx); Uni(cy); }
pii Get(int x, int y){
x = lower_bound(all(cx), x) - cx.begin();
y = lower_bound(all(cy), y) - cy.begin();
return {x, y};
}
int T[N], T2[N], A[N], B[N], C[N], P[Q], X[Q];
int up[N][N], rt[N][N];
ll dp[N][N];
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, q;
cin >> n >> q;
for(int i = -3000; i <= 3000; i++) Add(i, i);
for(int i = 1; i <= n; i++){
cin >> T[i] >> A[i] >> B[i] >> C[i];
T2[i] = abs(A[i] - B[i]) + T[i];
C[i] /= 2;
// Add(T[i] + A[i], T[i] - A[i]);
// Add(T2[i]+ B[i],T2[i] - B[i]);
}
Add(Q, Q);
for(int i = 1; i <= q; i++){
cin >> P[i] >> X[i];
// Add(P[i] + X[i], P[i] - X[i]);
}
Init();
for(int i = 1; i <= n; i++){
pii st = Get(T[i] + A[i], T[i] - A[i]);
pii fn = Get(T2[i]+ B[i],T2[i] - B[i]);
// cerr <<
if(st.F == fn.F){
for(int _i = st.S; _i < fn.S; _i++)
up[st.F][_i] = max(up[st.F][_i], C[i]);
} else {
for(int _i = st.F; _i < fn.F; _i++)
rt[_i][st.S] = max(rt[_i][st.S], C[i]);
}
}
int nx = cx.size(), ny = cy.size();
for(int i = nx - 2; i >= 0; i--)
for(int j = ny - 2; j >= 0; j--)
dp[i][j] = max(1ll * up[i][j] * (cy[j + 1] - cy[j]) + dp[i][j + 1], 1ll * rt[i][j] * (cx[i + 1] - cx[i]) + dp[i + 1][j]);
for(int i = 1; i <= q; i++){
pii st = Get(P[i] + X[i], P[i] - X[i]);
cout << dp[st.F][st.S] << '\n';
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1880 ms |
382668 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
317 ms |
283380 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
317 ms |
283380 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
317 ms |
283380 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1880 ms |
382668 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
