Submission #1800660


Source Code Expand

#include <cstdio>
#include <cstring>
#define MAXN 2010

int n,m,q;
int a[MAXN][MAXN];
int s1[MAXN][MAXN],s2[MAXN][MAXN],s3[MAXN][MAXN];

int getS1(int x1,int y1,int x2,int y2){ return s1[x2][y2]-s1[x1-1][y2]-s1[x2][y1-1]+s1[x1-1][y1-1]; }
int getS2(int x1,int y1,int x2,int y2){ return s2[x2][y2]-s2[x1-1][y2]-s2[x2][y1-1]+s2[x1-1][y1-1]; }
int getS3(int x1,int y1,int x2,int y2){ return s3[x2][y2]-s3[x1-1][y2]-s3[x2][y1-1]+s3[x1-1][y1-1]; }

int main(){
#ifdef DEBUG
	freopen("C.in","r",stdin);
#endif
	scanf("%d%d%d",&n,&m,&q);
	for(int i=1;i<=n;i++){
		static char str[MAXN];
		scanf("%s",str+1);
		for(int j=1;j<=m;j++)
			a[i][j]=str[j]-'0';
	}
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++){
			s1[i][j]=a[i][j];
			if(a[i][j] && a[i][j+1]) s2[i][j]=1;
			if(a[i][j] && a[i+1][j]) s3[i][j]=1;
		}
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++){
			s1[i][j]+=s1[i-1][j]+s1[i][j-1]-s1[i-1][j-1];
			s2[i][j]+=s2[i-1][j]+s2[i][j-1]-s2[i-1][j-1];
			s3[i][j]+=s3[i-1][j]+s3[i][j-1]-s3[i-1][j-1];
		}
	while(q--){
		int x1,y1,x2,y2;
		scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
		printf("%d\n",getS1(x1,y1,x2,y2)-getS2(x1,y1,x2,y2-1)-getS3(x1,y1,x2-1,y2));
	}
	return 0;
}

Submission Info

Submission Time
Task C - Nuske vs Phantom Thnook
User ez_zjt
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1209 Byte
Status AC
Exec Time 178 ms
Memory 64768 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:17: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:20:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s",str+1);
                    ^
./Main.cpp:38:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
                                    ^

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 136 ms 64384 KB
02.txt AC 174 ms 64256 KB
03.txt AC 149 ms 64384 KB
04.txt AC 172 ms 64128 KB
05.txt AC 154 ms 64640 KB
06.txt AC 178 ms 64256 KB
07.txt AC 123 ms 64256 KB
08.txt AC 156 ms 63616 KB
09.txt AC 147 ms 63744 KB
10.txt AC 177 ms 64128 KB
11.txt AC 136 ms 64384 KB
12.txt AC 125 ms 41984 KB
13.txt AC 92 ms 62336 KB
14.txt AC 73 ms 7168 KB
15.txt AC 66 ms 6656 KB
16.txt AC 72 ms 7040 KB
17.txt AC 88 ms 62208 KB
18.txt AC 91 ms 61824 KB
19.txt AC 74 ms 7168 KB
20.txt AC 148 ms 62080 KB
21.txt AC 134 ms 63872 KB
22.txt AC 176 ms 64128 KB
23.txt AC 75 ms 12160 KB
24.txt AC 177 ms 64256 KB
25.txt AC 66 ms 6656 KB
26.txt AC 71 ms 9344 KB
27.txt AC 68 ms 7040 KB
28.txt AC 91 ms 61824 KB
29.txt AC 88 ms 62208 KB
30.txt AC 72 ms 7040 KB
31.txt AC 144 ms 64768 KB
32.txt AC 158 ms 64512 KB
33.txt AC 129 ms 64256 KB
34.txt AC 158 ms 64512 KB
35.txt AC 118 ms 64000 KB
36.txt AC 156 ms 64000 KB
37.txt AC 123 ms 64000 KB
38.txt AC 155 ms 64000 KB
39.txt AC 119 ms 64640 KB
40.txt AC 168 ms 64384 KB
41.txt AC 129 ms 64256 KB
42.txt AC 157 ms 64000 KB
43.txt AC 126 ms 63616 KB
44.txt AC 154 ms 63744 KB
45.txt AC 2 ms 6272 KB
46.txt AC 2 ms 6272 KB
47.txt AC 2 ms 6272 KB
48.txt AC 2 ms 6272 KB
s1.txt AC 2 ms 6272 KB
s2.txt AC 2 ms 6272 KB