Submission #461231

#TimeUsernameProblemLanguageResultExecution timeMemory
461231vanicNuclearia (CEOI15_nuclearia)C++14
0 / 100
1092 ms10220 KiB
#include <iostream> #include <cstdio> #include <cmath> #include <algorithm> #include <cstring> using namespace std; const int maxn=100; int main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int h, w; cin >> w >> h; int l[w][h]; memset(l, 0, sizeof(l)); int n; cin >> n; int a, b, c, d; for(int i=0; i<n; i++){ cin >> a >> b >> c >> d; a--; b--; for(int j=0; j<w; j++){ for(int k=0; k<h; k++){ l[j][k]+=max(0, c-d*max(abs(j-a), abs(k-b))); } } } int q; cin >> q; int sum; for(int i=0; i<q; i++){ cin >> a >> b >> c >> d; a--; b--; c--; d--; sum=0; for(int j=a; j<=c; j++){ for(int k=b; k<=d; k++){ sum+=l[j][k]; } } cout << round((double)sum/((c-a+1)*(d-b+1))) << '\n'; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...