baoshuo/OI-codes
baoshuo/OI-codes
0
1
Fork 0
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-09 23:18:47 +00:00
Code Releases Activity

#866. 【2018.10雅礼集训day3】T1 u

Browse Source 
https://sjzezoj.com/submission/25533
This commit is contained in:
Baoshuo Ren 2021-09-02 15:25:21 +08:00 committed by Baoshuo Ren
parent 5f44c714b6
commit 5107feaff6
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68
1 changed files with 39 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

39
S2OJ/866/866.cpp Normal file
View File

@ -0,0 +1,39 @@
#include <bits/stdc++.h>
using namespace std;
int n, q, r, c, l;
long long s, s0[1005][1005], s1[1005][1005], s2[1005][1005], ans;
int main() {
cin >> n >> q;
while (q--) {
cin >> r >> c >> l >> s;
s1[r][c] += s;
if (r + l <= n) {
s1[r + l][c] -= s;
}
s2[r][c + 1] -= s;
if (r + l <= n && c + l + 1 <= n) {
s2[r + l][c + l + 1] += s;
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
s1[i][j] += s1[i - 1][j];
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
s2[i][j] += s2[i - 1][j - 1];
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
s0[i][j] = s0[i][j - 1] + s1[i][j] + s2[i][j];
ans ^= s0[i][j];
}
}
cout << ans << endl;
return 0;
}