VBOARD - Bàn cờ

Tác giả: happyboy99x

Ngôn ngữ: C++

#include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;

typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef vector<int> vi;
typedef vector<vi> vvi;

#define sz(a) int((a).size())
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#define tr(c,i) for(typeof((c).begin()) i = (c).begin(), _e = (c).end(); i != _e; ++i)
#define present(c,x) ((c).find(x) != (c).end())
#define cpresent(c,x) (find(all(c),x) != (c).end())
#define rep(i,n) for(int i = 0, _n = (n); i < _n; ++i)
#define repd(i,n) for(int i = (n)-1; i >= 0; --i )
#define fo(i,a,b) for(int i = (a), _b = (b); i <= _b; ++i)
#define fod(i,a,b) for(int i = (a), _b = (b); i >= _b; --i)

#define INF 1000000000
#define N 505

int a[N][N], f[N][N], g[N][N], n, q;

int main() {
#ifndef ONLINE_JUDGE
	freopen( "input.txt", "r", stdin );
	//freopen( "output.txt", "w", stdout );
#endif
	scanf("%d",&n);
	fo(i,1,n) fo(j,1,n) scanf("%d",&a[i][j]);
	fo(i,1,n) fo(j,1,n) {
		f[i][j] = f[i-1][j] + f[i][j-1] - f[i-1][j-1] + a[i][j];
		g[i][j] = g[i-1][j] + g[i][j-1] - g[i-1][j-1] + ((i+j)%2?a[i][j]:0);
	}
	scanf("%d",&q);
	for(int i = 0, a,b,x,y; i < q; ++i) {
		scanf("%d%d%d%d",&a,&b,&x,&y);
		printf("%d\n", abs(f[x][y]-f[a-1][y]-f[x][b-1]+f[a-1][b-1]-2*(g[x][y]-g[a-1][y]-g[x][b-1]+g[a-1][b-1])));
	}
	return 0;
}

Download