| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 813214 | JakobZorz | Nuclearia (CEOI15_nuclearia) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <set>
#include <stack>
#include <limits.h>
#include <math.h>
#include <iomanip>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <cstring>
#include <sstream>
#pragma GCC target("popcnt")
typedef long long ll;
typedef long double ld;
using namespace std;
const int MOD=1e9+7;
typedef pair<ll,ll>point;
//#define x first
//#define y second
vector<ll>map_arr;
int w,h;
void init_map(){
map_arr.resize(w*h);
}
ll&get(int x,int y){
return map_arr[y*w+x];
}
int main(){
ios::sync_with_stdio(false);
cout.tie(NULL);
cin.tie(NULL);
cin>>w>>h;
init_map();
int n;
cin>>n;
while(n--){
int x1,y1;
ll center,step;
cin>>x1>>y1>>center>>step;
x1--;y1--;
for(int x=0;x<w;x++)
for(int y=0;y<h;y++){
int dist=max(abs(x1-x),abs(y1-y));
ll val=max(0,center-dist*step);
get(x,y)+=val;
}
}
int q;
cin>>q;
while(q--){
int x1,y1,x2,y2;
cin>>x1>>y1>>x2>>y2;
x1--;y1--;
ll sum=0;
for(int x=x1;x<x2;x++)
for(int y=y1;y<y2;y++)
sum+=get(x,y);
ll area=(x2-x1)*(y2-y1);
ll res=sum/area;
if((sum%area)*2 >= area)
res++;
cout<<res<<"\n";
}
return 0;
}
/*
4 3
2
1 1 7 3
3 2 4 2
4
1 2 2 3
1 1 4 3
4 2 4 2
1 3 4 3
*/