Submission #2246956


Source Code Expand

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int n,m,q;
char ma[2010][2010];
int a[2010][2010],li[2010][2010],ha[2010][2010];
int main(){
	int i,j;
	scanf("%d%d%d",&n,&m,&q);
	for(i=1;i<=n;++i){
		scanf("%s",ma[i]);
		for(j=m;j>=1;--j)  ma[i][j]=ma[i][j-1];
	}
	memset(a,0,sizeof(a));
	memset(li,0,sizeof(li));
	memset(ha,0,sizeof(ha));
	for(i=1;i<=n;++i){
		for(j=1;j<=m;++j){
			a[i][j]=a[i-1][j]+a[i][j-1]-a[i-1][j-1];
			li[i][j]=li[i-1][j]+li[i][j-1]-li[i-1][j-1];
			ha[j][i]=ha[j][i-1]+ha[j-1][i]-ha[j-1][i-1];
			if(ma[i][j]=='1'){
				a[i][j]++;
			}
			if(ma[i][j]=='1' && ma[i][j-1]=='1'){
				li[i][j]++;
			}
			if(ma[i][j]=='1' && ma[i-1][j]=='1'){
				ha[j][i]++;
			}
		}
	}
	int x,y,xa,ya;
	for(i=1;i<=q;++i){
		scanf("%d%d%d%d",&x,&y,&xa,&ya);
		int one=a[xa][ya]-a[x-1][ya]-a[xa][y-1]+a[x-1][y-1];
		int ans,kk;
		kk=li[xa][ya]-li[xa][y]-li[x-1][ya]+li[x-1][y];
		kk+=ha[ya][xa]-ha[ya][x]-ha[y-1][xa]+ha[y-1][x];
		ans=one-kk;
		printf("%d\n",ans);
	}
	return 0;
}

Submission Info

Submission Time
Task C - Nuske vs Phantom Thnook
User vjudge3
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1067 Byte
Status AC
Exec Time 159 ms
Memory 53120 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:13:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d",&n,&m,&q);
                          ^
./Main.cpp:15:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s",ma[i]);
                    ^
./Main.cpp:39:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d%d",&x,&y,&xa,&ya);
                                  ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 2
AC × 50
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt AC 132 ms 52736 KB
02.txt AC 156 ms 52608 KB
03.txt AC 132 ms 52736 KB
04.txt AC 156 ms 52480 KB
05.txt AC 134 ms 52864 KB
06.txt AC 159 ms 52608 KB
07.txt AC 121 ms 52480 KB
08.txt AC 145 ms 52480 KB
09.txt AC 126 ms 52608 KB
10.txt AC 153 ms 52480 KB
11.txt AC 131 ms 52736 KB
12.txt AC 116 ms 52352 KB
13.txt AC 83 ms 52352 KB
14.txt AC 85 ms 50176 KB
15.txt AC 79 ms 49792 KB
16.txt AC 84 ms 50048 KB
17.txt AC 82 ms 52352 KB
18.txt AC 83 ms 51968 KB
19.txt AC 85 ms 50176 KB
20.txt AC 138 ms 51840 KB
21.txt AC 121 ms 52096 KB
22.txt AC 153 ms 52480 KB
23.txt AC 85 ms 50176 KB
24.txt AC 153 ms 52480 KB
25.txt AC 78 ms 49792 KB
26.txt AC 82 ms 49920 KB
27.txt AC 80 ms 49920 KB
28.txt AC 83 ms 51968 KB
29.txt AC 82 ms 52352 KB
30.txt AC 84 ms 50048 KB
31.txt AC 125 ms 53120 KB
32.txt AC 147 ms 52736 KB
33.txt AC 127 ms 52480 KB
34.txt AC 150 ms 52736 KB
35.txt AC 125 ms 52352 KB
36.txt AC 148 ms 52224 KB
37.txt AC 124 ms 52352 KB
38.txt AC 149 ms 52224 KB
39.txt AC 125 ms 52864 KB
40.txt AC 147 ms 52736 KB
41.txt AC 128 ms 52480 KB
42.txt AC 149 ms 52352 KB
43.txt AC 122 ms 51968 KB
44.txt AC 145 ms 52096 KB
45.txt AC 14 ms 49408 KB
46.txt AC 14 ms 49408 KB
47.txt AC 14 ms 49408 KB
48.txt AC 14 ms 49408 KB
s1.txt AC 14 ms 49536 KB
s2.txt AC 14 ms 49408 KB