oj.uz

답안 #365904

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
365904 2021-02-12T13:47:55 Z kostia244 Nuclearia (CEOI15_nuclearia) C++17
0 / 100
 1000 ms 62612 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#include<bits/stdc++.h>
#define all(x) begin(x), end(x)
using namespace std;
using ll = long long;
int n, m, q;
vector<vector<ll>> che;
vector<ll> rur, rul;
	
void init() {
	che.resize(n, vector<ll>(m));
	rur.resize(m);
	rul.resize(m);
}
void add_radius(int x, int y, int r, ll val) {
	che[max(x-r, 0)][max(y-r, 0)] += val;
	if(x+r+1 < n)
		che[x+r+1][max(y-r, 0)] -= val;
	if(y+r+1 < m)
		che[max(x-r, 0)][y+r+1] -= val;
	if(x+r+1 < n && y+r+1 < m)
		che[x+r+1][y+r+1] += val;
}
void add_vert(int x, int y, ll a, ll b) {
	ll maxrad = a/b;
	add_radius(x, y, maxrad, a - b*maxrad);
	//cout << a-b*maxrad << ":((" << endl;
	for(ll i = 0; i < min((ll)(n+m), (ll)maxrad); i++) {
		add_radius(x, y, i, b);
	}
	
}
void finish() {
	for(int it = 0; it < 2; it++) {
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < m; j++) {
			if(i) che[i][j] += che[i-1][j];
			if(j) che[i][j] += che[i][j-1];
			if(i&&j) che[i][j] -= che[i-1][j-1];
		}
	}
	
	/*for(auto i : che) {
		for(auto j : i) cout << j << " ";
		cout << endl;
	}*/
	}
}

ll get_rect(int xl, int xr, int yl, int yr) {
	ll sum = che[xr][yr];
	--xl, --yl;
	if(xl>=0) sum -= che[xl][yr];
	if(yl>=0) sum -= che[xr][yl];
	if(xl>=0&&yl>=0) sum += che[xl][yl];
	ll area = (xr-xl)*(yr-yl);
	//cout << xl << " " << xr << " " << yl << " " << yr << " " << area << endl;
	ll rem = sum % area;
	return (sum/area) + (rem*2 >= area);
}
int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin >> n >> m >> q;
	int rev = 0;
	if(n > m) swap(n, m), rev = 1;
	init();
	for(int x, y, a, b; q--;) {
		cin >> x >> y >> a >> b;x--, y--;
		if(rev) swap(x, y);
		add_vert(x, y, a, b);
	}
	finish();
	cin >> q;
	for(int xl, xr, yl, yr; q--;) {
		cin >> xl >> yl >> xr >> yr;xl--,xr--,yl--,yr--;
		if(rev) swap(xl, yl);
		if(rev) swap(xr, yr);
		//cout << xl << " " << xr << " " << yl << " " << yr << " QUERY:" << endl;
		cout << get_rect(xl, xr, yl, yr) << '\n';
	}
}

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 521 ms 59112 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 471 ms 59112 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 31 ms 19948 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 55 ms 21912 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 297 ms 62612 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 533 ms 27864 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 155 ms 23532 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 334 ms 19620 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1076 ms 59040 KB Time limit exceeded

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1094 ms 59060 KB Time limit exceeded

Subtask #11
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1018 ms 23660 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #12
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1086 ms 21612 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #13
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1090 ms 21068 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #14
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1076 ms 20684 KB Time limit exceeded
2 Halted 0 ms 0 KB -