问题标题: 酷町堂：3914 矩阵查询//暴力过不了了……

题目描述 Description

给出 N×N 的矩阵 A，初始时均为 0。我们需要支持两种操作：

1. C x1 y1 c，表示 (x1, y1)上的元素加上 c。(1≤x1, y1≤N,1≤c≤100)
2. Q x1 y1 x2 y2，查询子矩阵元素之和。(1≤x1≤x2≤N,1≤y1≤y2≤N)

输入描述 Input Description

第一行两个整数 N,Q(1≤N≤1000,1≤Q≤50000)。接下来 Q 行，每行一个操作。

输出描述 Output Description

对于每个询问操作，一行一个整数，表示矩阵的和。

啊啊啊，最后一个点1168ms!

o3都不行了……

#include<iostream>
#pragma GCC optimize(3)
#pragma GCC optimize(2)
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#include<cstdio>
using namespace std;
long long n,q,a[1005][1005]; 
int main(){
	cin>>n>>q;
	while(q--){
		char x;
		int x1,x2,y1,y2,c,sum=0;
		cin>>x;
		if(x=='C'){
			scanf("%d%d%d",&x1,&y1,&c);
			a[x1][y1]+=c;
		}
		else{
			scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
			for(int i=x1;i<=x2;i++){
				for(int j=y1;j<=y2;j++){
					sum+=a[i][j];
				}
			}
			cout<<sum<<endl;
		}
	}
	return 0;
}

汪恺恒在2021-01-28 11:14:06追加了内容

@包涵宇 不对呀

#include<iostream>
#include<bits/stdc++.h>
#pragma GCC optimize(3)
#pragma GCC optimize("no-stack-protector")
using namespace std;
long long n,q,a[1005][1005]; 
int main(){
	cin>>n>>q;
	while(q--){
		char x;
		int x1,x2,y1,y2,c,sum=0;
		cin>>x;
		if(x=='C'){
			scanf("%d%d%d",&x1,&y1,&c);
			for(int i=y1;i<=n;i++){
				a[x1][i]=a[x1][i-1]+c;
			}
		}
		else{
			scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
			for(int i=x1;i<=x2;i++){
				sum+=a[i][y2]-a[i][y1-1];
			}
			printf("%d\n",sum);
		}
	}
	return 0;
}

汪恺恒在2021-01-28 14:32:22追加了内容

@黄依成     可是……