#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;
#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};
#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif
#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "["; REP(i, v.size()) out << v[i] << ", "; out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}
struct AcAutomaton{
int w, h;
int n;
vector<vi> plants;
int q;
vector<vi> queries;
void read_in(){
cin >> w >> h;
cin >> n;
plants.rsz(n, vi(4));
cin >> plants;
for(auto &x : plants){
x[0]--; x[1]--;
}
cin >> q;
queries.rsz(q, vi(4));
cin >> queries;
for(auto &x : queries){
x[0]--; x[1]--; x[2]--; x[3]--;
}
}
void solveNWH(){
vector<vll> grid(w, vll(h, 0)); // different than usual
REP(k, n) {
REP(i, w){
REP(j, h){
grid[i][j] += max(0ll, (ll)plants[k][2] - (ll)(max(abs(plants[k][0] - i), abs(plants[k][1] - j)))*(ll)plants[k][3]);
}
}
}
vector<vll> ps(w+1, vll(h+1, 0));
FOR(i, 1, w+1, 1){
FOR(j, 1, h+1, 1){
ps[i][j] = ps[i-1][j] + ps[i][j-1] - ps[i-1][j-1] + grid[i-1][j-1];
}
}
/* cout << "GRID" << endl; */
/* REP(i, w) cout << grid[i] << endl; */
/* cout << "PS" << endl; */
/* REP(i, w+1) cout << ps[i] << endl; */
for(auto x : queries){
ll sum = ps[x[2]+1][x[3]+1] - ps[x[2]+1][x[1]] - ps[x[0]][x[3]+1] + ps[x[0]][x[1]];
/* dbg(ps[x[2]+1][x[3]+1]); */
/* dbg(-ps[x[2]][x[1]]); */
/* dbg(-ps[x[0]][x[3]]); */
/* dbg(ps[x[0]][x[1]]); */
ll area = (x[3] - x[1] + 1) * (x[2] - x[0] + 1);
//dbg(mp(sum, area));
if((sum + area/2)/area > sum/area) cout << (sum + area/2)/area << "\n";
else cout << sum/area << "\n";
}
}
void solve_line(){
vll grid(w+10, 0);
vll a(w+10, 0);
REP(i, n){
int dist = plants[i][2] / plants[i][3];
int low = plants[i][0] - dist;
int starting = plants[i][2] - plants[i][3] * dist;
if(low < 0) {
starting += -low * plants[i][3];
low = 0;
}
a[low] += starting;
grid[low+1] += plants[i][3];
grid[plants[i][0]+1] += -2*plants[i][3];
int ending = plants[i][2] - plants[i][3] * dist;
int high = plants[i][0] + dist + 1;
if(high > w-1){
ending += plants[i][3] + high - (w-1);
high = w-1;
}
grid[high] += plants[i][3];
a[high] += -ending;
}
/* dbg(grid); */
/* dbg(a); */
vll ps(w+1, 0);
FOR(i, 1, w+1, 1) ps[i] = ps[i-1] + grid[i-1];
/* dbg(ps); */
vll grid2(w+10, 0);
REP(i, w){
if(i) grid2[i] = grid2[i-1] + ps[i+1] + a[i];
else grid2[i] = a[i] + ps[i+1];
}
/* dbg(grid2); */
// grid2 is the actual grid; stuff before were random prefix sum tricks to update stuff offline effectively
vll ps2(w+10, 0); // prefix sums of grid2 -> the real grid
FOR(i, 1, w+1, 1) ps2[i] = ps2[i-1] + grid2[i-1];
for(auto x : queries){
ll sum = ps2[x[2]+1] - ps2[x[0]];
ll area = x[2]+1 - x[0];
if((sum + area/2)/area > sum/area) cout << (sum + area/2)/area << "\n";
else cout << sum/area << "\n";
}
}
void solve(){
if(n*w*h > (int)1e8) solve_line();
else solveNWH();
}
};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int tcase = 1;
while(tcase--){
AcAutomaton solver;
solver.read_in();
solver.solve();
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
1029 ms |
274380 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
915 ms |
274480 KB |
Output is correct |
| 2 |
Correct |
119 ms |
14432 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
238 ms |
39996 KB |
Output is correct |
| 2 |
Correct |
101 ms |
14456 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
241 ms |
41504 KB |
Output is correct |
| 2 |
Correct |
103 ms |
14328 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
660 ms |
288760 KB |
Output is correct |
| 2 |
Correct |
120 ms |
14712 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
875 ms |
124644 KB |
Output is correct |
| 2 |
Correct |
105 ms |
14712 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
411 ms |
54264 KB |
Output is correct |
| 2 |
Correct |
108 ms |
14712 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
604 ms |
69752 KB |
Output is correct |
| 2 |
Correct |
112 ms |
14456 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
315 ms |
123720 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
326 ms |
123640 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
220 ms |
25720 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
222 ms |
25592 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
205 ms |
25848 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
209 ms |
26036 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
