Submission #2247355


Source Code Expand

#include<bits/stdc++.h>
#define F(i,a,b) for(int i=(a);i<=(b);++i)

int N,M,Q;
char str[2005];
int fk[2005][2005],f2[2005][2005],f3[2005][2005];

int main(){
	scanf("%d%d%d",&N,&M,&Q);
	F(i,1,N){
		scanf("%s",str+1);
		F(j,1,M){
			if(str[j]=='1'){
				fk[i][j]=1;
				if(fk[i-1][j]) f2[i-1][j]=1;
				if(fk[i][j-1]) f3[i][j-1]=1;
			}
		}
	}
	F(i,1,N) F(j,1,M)
		fk[i][j]+=fk[i-1][j]+fk[i][j-1]-fk[i-1][j-1],
		f2[i][j]+=f2[i-1][j]+f2[i][j-1]-f2[i-1][j-1],
		f3[i][j]+=f3[i-1][j]+f3[i][j-1]-f3[i-1][j-1];
	F(i,1,Q){
		int X1,Y1,X2,Y2;
		scanf("%d%d%d%d",&X1,&Y1,&X2,&Y2);
		int Dots=fk[X2][Y2]-fk[X1-1][Y2]-fk[X2][Y1-1]+fk[X1-1][Y1-1];
		int Edges=f2[X2-1][Y2]-f2[X1-1][Y2]-f2[X2-1][Y1-1]+f2[X1-1][Y1-1]+f3[X2][Y2-1]-f3[X1-1][Y2-1]-f3[X2][Y1-1]+f3[X1-1][Y1-1];
		printf("%d\n",Dots-Edges);
	}
	return 0;
}

Submission Info

Submission Time
Task C - Nuske vs Phantom Thnook
User luogu_bot5
Language C++14 (GCC 5.4.1)
Score 700
Code Size 837 Byte
Status AC
Exec Time 154 ms
Memory 48896 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:9: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:11:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s",str+1);
                    ^
./Main.cpp:26: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 133 ms 48512 KB
02.txt AC 154 ms 48384 KB
03.txt AC 130 ms 48512 KB
04.txt AC 151 ms 48256 KB
05.txt AC 131 ms 48768 KB
06.txt AC 154 ms 48384 KB
07.txt AC 108 ms 48256 KB
08.txt AC 136 ms 48384 KB
09.txt AC 123 ms 48512 KB
10.txt AC 153 ms 48256 KB
11.txt AC 129 ms 48512 KB
12.txt AC 114 ms 31872 KB
13.txt AC 79 ms 47104 KB
14.txt AC 73 ms 5120 KB
15.txt AC 66 ms 4736 KB
16.txt AC 72 ms 4992 KB
17.txt AC 78 ms 47104 KB
18.txt AC 80 ms 46720 KB
19.txt AC 69 ms 5120 KB
20.txt AC 128 ms 47744 KB
21.txt AC 108 ms 47872 KB
22.txt AC 152 ms 48256 KB
23.txt AC 75 ms 10112 KB
24.txt AC 154 ms 48256 KB
25.txt AC 70 ms 4736 KB
26.txt AC 71 ms 7424 KB
27.txt AC 69 ms 4992 KB
28.txt AC 80 ms 46720 KB
29.txt AC 78 ms 47104 KB
30.txt AC 72 ms 4992 KB
31.txt AC 112 ms 48896 KB
32.txt AC 136 ms 48640 KB
33.txt AC 112 ms 48384 KB
34.txt AC 138 ms 48640 KB
35.txt AC 110 ms 48128 KB
36.txt AC 132 ms 48128 KB
37.txt AC 110 ms 48128 KB
38.txt AC 133 ms 48128 KB
39.txt AC 111 ms 48768 KB
40.txt AC 134 ms 48512 KB
41.txt AC 112 ms 48256 KB
42.txt AC 133 ms 48128 KB
43.txt AC 108 ms 47744 KB
44.txt AC 132 ms 47872 KB
45.txt AC 2 ms 4352 KB
46.txt AC 2 ms 4352 KB
47.txt AC 2 ms 4352 KB
48.txt AC 2 ms 4352 KB
s1.txt AC 2 ms 4352 KB
s2.txt AC 2 ms 4352 KB