1 solutions

  • 1
    @ 2025-5-4 16:29:58
    #include<bits/stdc++.h>
    using namespace std;
    int a[100][100],s[100][100];
    int main(){
    	int n,m,ax,ay,bx,by,t;
    	scanf("%d%d%d",&n,&m,&t);
    	for(int i = 1;i<=n;i++)
    		for(int j = 1;j<=m;j++){
    			scanf("%d",&a[i][j]);
    			s[i][j] = s[i-1][j]+s[i][j-1]-s[i-1][j-1]+a[i][j];
    		}
    	while(t--){
    		scanf("%d%d%d%d",&ax,&ay,&bx,&by);
    		printf("%d\n",s[bx][by]-s[ax-1][by]-s[bx][ay-1]+s[ax-1][ay-1]);
    	}
    	return 0;
    }
    
    • 1

    Information

    ID
    658
    Time
    1000ms
    Memory
    256MiB
    Difficulty
    10
    Tags
    # Submissions
    5
    Accepted
    3
    Uploaded By