Submission #1800900


Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cassert>
#include <cctype>
using namespace std;
typedef long long lint;
#define cout cerr
#define ni (next_num<int>())
template<class T>inline T next_num(){
	T i=0;char c;
	while(!isdigit(c=getchar())&&c!='-');
	bool flag=c=='-';
	flag?c=getchar():0;
	while(i=i*10-'0'+c,isdigit(c=getchar()));
	return flag?-i:i;
}
template<class T1,class T2>inline void apmax(T1 &a,const T2 &b){if(a<b)a=b;}
template<class T1,class T2>inline void apmin(T1 &a,const T2 &b){if(b<a)a=b;}
const int N=2010;
char mat[N][N];
int __deg[N][N],_deghor[N][N],_degver[N][N];
int main(){
	int n=ni,m=ni,tot=ni;
	for(int i=1;i<=n;i++){
		scanf("%s",mat[i]+1);
	}
	memset(__deg,0,sizeof(__deg));
	memset(_deghor,0,sizeof(_deghor));
	memset(_degver,0,sizeof(_degver));
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(mat[i][j]=='1'){
				__deg[i][j]=-2;
				static const int dx[]={-1,0,1,0},dy[]={0,1,0,-1};
				for(int d=0;d<4;d++){
					__deg[i][j]+=mat[i+dx[d]][j+dy[d]]=='1';
				}
			}
			__deg[i][j]+=__deg[i-1][j]+__deg[i][j-1]-__deg[i-1][j-1];
			_deghor[i][j]=_deghor[i][j-1]+(mat[i][j]=='1'&&mat[i-1][j]=='1');
			_degver[i][j]=_degver[i-1][j]+(mat[i][j]=='1'&&mat[i][j-1]=='1');
		}
	}
	while(tot--){
		int x1=ni,y1=ni,x2=ni,y2=ni;
		int sum=__deg[x2][y2]-__deg[x1-1][y2]-__deg[x2][y1-1]+__deg[x1-1][y1-1];
		sum-=_deghor[x1][y2]-_deghor[x1][y1-1];
		sum-=_deghor[x2+1][y2]-_deghor[x2+1][y1-1];
		sum-=_degver[x2][y1]-_degver[x1-1][y1];
		sum-=_degver[x2][y2+1]-_degver[x1-1][y2+1];
		printf("%d\n",(-sum)>>1);
	}
	return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:26:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s",mat[i]+1);
                       ^

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 117 ms 52736 KB
02.txt AC 147 ms 52608 KB
03.txt AC 116 ms 52736 KB
04.txt AC 148 ms 52480 KB
05.txt AC 116 ms 52864 KB
06.txt AC 147 ms 52608 KB
07.txt AC 84 ms 52480 KB
08.txt AC 118 ms 52480 KB
09.txt AC 113 ms 52608 KB
10.txt AC 147 ms 52480 KB
11.txt AC 116 ms 52736 KB
12.txt AC 101 ms 52352 KB
13.txt AC 54 ms 52352 KB
14.txt AC 56 ms 50176 KB
15.txt AC 44 ms 49792 KB
16.txt AC 55 ms 50048 KB
17.txt AC 53 ms 52352 KB
18.txt AC 55 ms 51968 KB
19.txt AC 54 ms 50176 KB
20.txt AC 106 ms 51840 KB
21.txt AC 82 ms 52096 KB
22.txt AC 147 ms 52480 KB
23.txt AC 58 ms 50176 KB
24.txt AC 146 ms 52480 KB
25.txt AC 44 ms 49792 KB
26.txt AC 52 ms 49920 KB
27.txt AC 53 ms 49920 KB
28.txt AC 55 ms 51840 KB
29.txt AC 53 ms 52352 KB
30.txt AC 55 ms 50048 KB
31.txt AC 99 ms 53120 KB
32.txt AC 137 ms 52736 KB
33.txt AC 103 ms 52480 KB
34.txt AC 121 ms 52736 KB
35.txt AC 96 ms 52352 KB
36.txt AC 123 ms 52224 KB
37.txt AC 101 ms 52352 KB
38.txt AC 123 ms 52224 KB
39.txt AC 90 ms 52864 KB
40.txt AC 120 ms 52736 KB
41.txt AC 100 ms 52480 KB
42.txt AC 128 ms 52352 KB
43.txt AC 95 ms 51840 KB
44.txt AC 122 ms 52096 KB
45.txt AC 15 ms 49408 KB
46.txt AC 15 ms 49408 KB
47.txt AC 15 ms 49408 KB
48.txt AC 14 ms 49408 KB
s1.txt AC 15 ms 49408 KB
s2.txt AC 15 ms 49408 KB